/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 19:43:43,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 19:43:43,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 19:43:43,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 19:43:43,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 19:43:43,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 19:43:43,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 19:43:43,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 19:43:43,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 19:43:43,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 19:43:43,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 19:43:43,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 19:43:43,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 19:43:43,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 19:43:43,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 19:43:43,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 19:43:43,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 19:43:43,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 19:43:43,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 19:43:43,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 19:43:43,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 19:43:43,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 19:43:43,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 19:43:43,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 19:43:43,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 19:43:43,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 19:43:43,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 19:43:43,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 19:43:43,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 19:43:43,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 19:43:43,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 19:43:43,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 19:43:43,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 19:43:43,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 19:43:43,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 19:43:43,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 19:43:43,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 19:43:43,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 19:43:43,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 19:43:43,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 19:43:43,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 19:43:43,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-02-10 19:43:43,268 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 19:43:43,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 19:43:43,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 19:43:43,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 19:43:43,275 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 19:43:43,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 19:43:43,276 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 19:43:43,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 19:43:43,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 19:43:43,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 19:43:43,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 19:43:43,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 19:43:43,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 19:43:43,277 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 19:43:43,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 19:43:43,277 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 19:43:43,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 19:43:43,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 19:43:43,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 19:43:43,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 19:43:43,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 19:43:43,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:43:43,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 19:43:43,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 19:43:43,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 19:43:43,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 19:43:43,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 19:43:43,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 19:43:43,281 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-02-10 19:43:43,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 19:43:43,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 19:43:43,558 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 19:43:43,561 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 19:43:43,563 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 19:43:43,563 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 19:43:43,564 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 19:43:43,564 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_7.bpl' [2020-02-10 19:43:43,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 19:43:43,622 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 19:43:43,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 19:43:43,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 19:43:43,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 19:43:43,638 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 07:43:43" (1/1) ... [2020-02-10 19:43:43,647 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 07:43:43" (1/1) ... [2020-02-10 19:43:43,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 19:43:43,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 19:43:43,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 19:43:43,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 19:43:43,668 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 07:43:43" (1/1) ... [2020-02-10 19:43:43,668 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 07:43:43" (1/1) ... [2020-02-10 19:43:43,669 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 07:43:43" (1/1) ... [2020-02-10 19:43:43,669 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 07:43:43" (1/1) ... [2020-02-10 19:43:43,673 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 07:43:43" (1/1) ... [2020-02-10 19:43:43,674 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 07:43:43" (1/1) ... [2020-02-10 19:43:43,675 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 07:43:43" (1/1) ... [2020-02-10 19:43:43,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 19:43:43,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 19:43:43,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 19:43:43,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 19:43:43,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:43" (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 19:43:43,751 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 19:43:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 19:43:43,753 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 19:43:43,753 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 19:43:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 19:43:43,754 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 19:43:43,754 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 19:43:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 19:43:43,757 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 19:43:43,758 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 19:43:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 19:43:43,758 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 19:43:43,759 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 19:43:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 19:43:43,759 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 19:43:43,760 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 19:43:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 19:43:43,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 19:43:43,760 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 19:43:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 19:43:43,761 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 19:43:43,762 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-02-10 19:43:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-02-10 19:43:43,763 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-02-10 19:43:43,764 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 19:43:44,017 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 19:43:44,017 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 19:43:44,035 INFO L202 PluginConnector]: Adding new model example_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:43:44 BoogieIcfgContainer [2020-02-10 19:43:44,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 19:43:44,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 19:43:44,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 19:43:44,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 19:43:44,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:43" (1/2) ... [2020-02-10 19:43:44,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f762fc7 and model type example_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 07:43:44, skipping insertion in model container [2020-02-10 19:43:44,052 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 07:43:44" (2/2) ... [2020-02-10 19:43:44,054 INFO L109 eAbstractionObserver]: Analyzing ICFG example_7.bpl [2020-02-10 19:43:44,068 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 19:43:44,069 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 19:43:44,078 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 19:43:44,078 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 19:43:44,263 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-02-10 19:43:44,281 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 19:43:44,281 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 19:43:44,281 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 19:43:44,281 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 19:43:44,281 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 19:43:44,282 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 19:43:44,282 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 19:43:44,282 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 19:43:44,296 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 80 transitions [2020-02-10 19:43:44,298 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 80 transitions [2020-02-10 19:43:44,534 INFO L129 PetriNetUnfolder]: 321/472 cut-off events. [2020-02-10 19:43:44,535 INFO L130 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2020-02-10 19:43:44,548 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 19:43:44,559 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 80 transitions [2020-02-10 19:43:44,662 INFO L129 PetriNetUnfolder]: 321/472 cut-off events. [2020-02-10 19:43:44,662 INFO L130 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2020-02-10 19:43:44,667 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 19:43:44,680 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1260 [2020-02-10 19:43:44,681 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 19:43:44,826 INFO L206 etLargeBlockEncoding]: Checked pairs total: 357 [2020-02-10 19:43:44,826 INFO L214 etLargeBlockEncoding]: Total number of compositions: 8 [2020-02-10 19:43:44,830 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 72 transitions [2020-02-10 19:43:45,088 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2316 states. [2020-02-10 19:43:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states. [2020-02-10 19:43:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:45,139 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:45,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 19:43:45,141 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 19:43:45,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:45,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1886146014, now seen corresponding path program 1 times [2020-02-10 19:43:45,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:45,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643523012] [2020-02-10 19:43:45,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:45,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 19:43:45,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643523012] [2020-02-10 19:43:45,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:45,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:45,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971436962] [2020-02-10 19:43:45,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:45,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:45,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:45,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:45,447 INFO L87 Difference]: Start difference. First operand 2316 states. Second operand 3 states. [2020-02-10 19:43:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:45,547 INFO L93 Difference]: Finished difference Result 1820 states and 7856 transitions. [2020-02-10 19:43:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:45,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-02-10 19:43:45,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:45,612 INFO L225 Difference]: With dead ends: 1820 [2020-02-10 19:43:45,613 INFO L226 Difference]: Without dead ends: 1819 [2020-02-10 19:43:45,614 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 19:43:45,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2020-02-10 19:43:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1819. [2020-02-10 19:43:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2020-02-10 19:43:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 7855 transitions. [2020-02-10 19:43:45,805 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 7855 transitions. Word has length 22 [2020-02-10 19:43:45,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:45,806 INFO L479 AbstractCegarLoop]: Abstraction has 1819 states and 7855 transitions. [2020-02-10 19:43:45,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:45,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 7855 transitions. [2020-02-10 19:43:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:45,820 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:45,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 19:43:45,821 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 19:43:45,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:45,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1634401592, now seen corresponding path program 1 times [2020-02-10 19:43:45,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:45,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971142438] [2020-02-10 19:43:45,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:45,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 19:43:45,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971142438] [2020-02-10 19:43:45,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:45,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:45,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435432432] [2020-02-10 19:43:45,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:45,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:45,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:45,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:45,902 INFO L87 Difference]: Start difference. First operand 1819 states and 7855 transitions. Second operand 3 states. [2020-02-10 19:43:45,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:45,933 INFO L93 Difference]: Finished difference Result 1275 states and 5199 transitions. [2020-02-10 19:43:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:45,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-02-10 19:43:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:45,947 INFO L225 Difference]: With dead ends: 1275 [2020-02-10 19:43:45,947 INFO L226 Difference]: Without dead ends: 1275 [2020-02-10 19:43:45,949 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 19:43:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2020-02-10 19:43:46,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1275. [2020-02-10 19:43:46,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2020-02-10 19:43:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 5199 transitions. [2020-02-10 19:43:46,032 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 5199 transitions. Word has length 22 [2020-02-10 19:43:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:46,033 INFO L479 AbstractCegarLoop]: Abstraction has 1275 states and 5199 transitions. [2020-02-10 19:43:46,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 5199 transitions. [2020-02-10 19:43:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:46,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:46,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 19:43:46,041 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 19:43:46,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:46,042 INFO L82 PathProgramCache]: Analyzing trace with hash -488840274, now seen corresponding path program 1 times [2020-02-10 19:43:46,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:46,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662144975] [2020-02-10 19:43:46,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:46,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 19:43:46,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662144975] [2020-02-10 19:43:46,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:46,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:46,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120240262] [2020-02-10 19:43:46,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:46,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:46,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:46,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:46,083 INFO L87 Difference]: Start difference. First operand 1275 states and 5199 transitions. Second operand 3 states. [2020-02-10 19:43:46,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:46,115 INFO L93 Difference]: Finished difference Result 847 states and 3331 transitions. [2020-02-10 19:43:46,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:46,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-02-10 19:43:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:46,124 INFO L225 Difference]: With dead ends: 847 [2020-02-10 19:43:46,125 INFO L226 Difference]: Without dead ends: 847 [2020-02-10 19:43:46,126 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 19:43:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2020-02-10 19:43:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2020-02-10 19:43:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2020-02-10 19:43:46,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 3331 transitions. [2020-02-10 19:43:46,180 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 3331 transitions. Word has length 22 [2020-02-10 19:43:46,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:46,181 INFO L479 AbstractCegarLoop]: Abstraction has 847 states and 3331 transitions. [2020-02-10 19:43:46,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 3331 transitions. [2020-02-10 19:43:46,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:46,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:46,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:46,188 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 19:43:46,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:46,189 INFO L82 PathProgramCache]: Analyzing trace with hash 625763952, now seen corresponding path program 1 times [2020-02-10 19:43:46,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:46,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312008610] [2020-02-10 19:43:46,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:46,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 19:43:46,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312008610] [2020-02-10 19:43:46,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:46,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:46,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081332945] [2020-02-10 19:43:46,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:46,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:46,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:46,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:46,234 INFO L87 Difference]: Start difference. First operand 847 states and 3331 transitions. Second operand 3 states. [2020-02-10 19:43:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:46,280 INFO L93 Difference]: Finished difference Result 575 states and 2209 transitions. [2020-02-10 19:43:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:46,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-02-10 19:43:46,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:46,286 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:43:46,287 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:43:46,287 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 19:43:46,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:43:46,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2020-02-10 19:43:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2020-02-10 19:43:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 2209 transitions. [2020-02-10 19:43:46,312 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 2209 transitions. Word has length 22 [2020-02-10 19:43:46,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:46,313 INFO L479 AbstractCegarLoop]: Abstraction has 575 states and 2209 transitions. [2020-02-10 19:43:46,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 2209 transitions. [2020-02-10 19:43:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:46,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:46,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 19:43:46,316 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 19:43:46,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:46,317 INFO L82 PathProgramCache]: Analyzing trace with hash 625764882, now seen corresponding path program 1 times [2020-02-10 19:43:46,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:46,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737421508] [2020-02-10 19:43:46,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:46,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 19:43:46,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737421508] [2020-02-10 19:43:46,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:46,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:46,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926927107] [2020-02-10 19:43:46,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:46,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:46,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:46,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:46,960 INFO L87 Difference]: Start difference. First operand 575 states and 2209 transitions. Second operand 9 states. [2020-02-10 19:43:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:47,098 INFO L93 Difference]: Finished difference Result 908 states and 3017 transitions. [2020-02-10 19:43:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:47,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:47,107 INFO L225 Difference]: With dead ends: 908 [2020-02-10 19:43:47,107 INFO L226 Difference]: Without dead ends: 884 [2020-02-10 19:43:47,107 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 19:43:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2020-02-10 19:43:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 588. [2020-02-10 19:43:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-02-10 19:43:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 2250 transitions. [2020-02-10 19:43:47,139 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 2250 transitions. Word has length 22 [2020-02-10 19:43:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:47,139 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 2250 transitions. [2020-02-10 19:43:47,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 2250 transitions. [2020-02-10 19:43:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:47,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:47,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 19:43:47,143 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 19:43:47,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:47,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2078936528, now seen corresponding path program 2 times [2020-02-10 19:43:47,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:47,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509415176] [2020-02-10 19:43:47,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:47,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 19:43:47,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509415176] [2020-02-10 19:43:47,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:47,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:47,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953611909] [2020-02-10 19:43:47,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:47,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:47,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:47,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:47,635 INFO L87 Difference]: Start difference. First operand 588 states and 2250 transitions. Second operand 9 states. [2020-02-10 19:43:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:47,773 INFO L93 Difference]: Finished difference Result 900 states and 2993 transitions. [2020-02-10 19:43:47,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:47,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:47,782 INFO L225 Difference]: With dead ends: 900 [2020-02-10 19:43:47,783 INFO L226 Difference]: Without dead ends: 879 [2020-02-10 19:43:47,783 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 19:43:47,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2020-02-10 19:43:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 583. [2020-02-10 19:43:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2020-02-10 19:43:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 2238 transitions. [2020-02-10 19:43:47,819 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 2238 transitions. Word has length 22 [2020-02-10 19:43:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:47,953 INFO L479 AbstractCegarLoop]: Abstraction has 583 states and 2238 transitions. [2020-02-10 19:43:47,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 2238 transitions. [2020-02-10 19:43:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:47,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:47,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 19:43:47,959 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 19:43:47,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:47,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1978315202, now seen corresponding path program 3 times [2020-02-10 19:43:47,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:47,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804831176] [2020-02-10 19:43:47,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:48,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 19:43:48,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804831176] [2020-02-10 19:43:48,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:48,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:48,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327307748] [2020-02-10 19:43:48,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:48,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:48,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:48,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:48,334 INFO L87 Difference]: Start difference. First operand 583 states and 2238 transitions. Second operand 9 states. [2020-02-10 19:43:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:48,430 INFO L93 Difference]: Finished difference Result 908 states and 3014 transitions. [2020-02-10 19:43:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:48,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:48,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:48,438 INFO L225 Difference]: With dead ends: 908 [2020-02-10 19:43:48,438 INFO L226 Difference]: Without dead ends: 884 [2020-02-10 19:43: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 19:43:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2020-02-10 19:43:48,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 588. [2020-02-10 19:43:48,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-02-10 19:43:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 2247 transitions. [2020-02-10 19:43:48,467 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 2247 transitions. Word has length 22 [2020-02-10 19:43:48,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:48,467 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 2247 transitions. [2020-02-10 19:43:48,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 2247 transitions. [2020-02-10 19:43:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:48,470 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:48,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 19:43:48,470 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 19:43:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:48,471 INFO L82 PathProgramCache]: Analyzing trace with hash 684254128, now seen corresponding path program 1 times [2020-02-10 19:43:48,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:48,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277810209] [2020-02-10 19:43:48,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:48,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 19:43:48,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277810209] [2020-02-10 19:43:48,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:48,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:48,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956234595] [2020-02-10 19:43:48,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:48,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:48,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:48,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:48,489 INFO L87 Difference]: Start difference. First operand 588 states and 2247 transitions. Second operand 3 states. [2020-02-10 19:43:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:48,497 INFO L93 Difference]: Finished difference Result 522 states and 1921 transitions. [2020-02-10 19:43:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:48,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-02-10 19:43:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:48,502 INFO L225 Difference]: With dead ends: 522 [2020-02-10 19:43:48,502 INFO L226 Difference]: Without dead ends: 522 [2020-02-10 19:43:48,503 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 19:43:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-02-10 19:43:48,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2020-02-10 19:43:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2020-02-10 19:43:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1921 transitions. [2020-02-10 19:43:48,523 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1921 transitions. Word has length 22 [2020-02-10 19:43:48,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:48,524 INFO L479 AbstractCegarLoop]: Abstraction has 522 states and 1921 transitions. [2020-02-10 19:43:48,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:48,524 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1921 transitions. [2020-02-10 19:43:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:48,528 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:48,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 19:43:48,529 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 19:43:48,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:48,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1999772210, now seen corresponding path program 1 times [2020-02-10 19:43:48,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:48,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922445549] [2020-02-10 19:43:48,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:48,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922445549] [2020-02-10 19:43:48,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:48,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:48,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896083180] [2020-02-10 19:43:48,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:48,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:48,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:48,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:48,551 INFO L87 Difference]: Start difference. First operand 522 states and 1921 transitions. Second operand 3 states. [2020-02-10 19:43:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:48,556 INFO L93 Difference]: Finished difference Result 392 states and 1373 transitions. [2020-02-10 19:43:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:48,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-02-10 19:43:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:48,560 INFO L225 Difference]: With dead ends: 392 [2020-02-10 19:43:48,560 INFO L226 Difference]: Without dead ends: 392 [2020-02-10 19:43:48,561 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 19:43:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-02-10 19:43:48,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2020-02-10 19:43:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:43:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1373 transitions. [2020-02-10 19:43:48,576 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1373 transitions. Word has length 22 [2020-02-10 19:43:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:48,577 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1373 transitions. [2020-02-10 19:43:48,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1373 transitions. [2020-02-10 19:43:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:48,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:48,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 19:43:48,579 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 19:43:48,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:48,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1755583602, now seen corresponding path program 4 times [2020-02-10 19:43:48,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:48,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959814750] [2020-02-10 19:43:48,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:48,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 19:43:48,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959814750] [2020-02-10 19:43:48,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:48,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:48,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136284811] [2020-02-10 19:43:48,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:48,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:48,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:48,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:48,975 INFO L87 Difference]: Start difference. First operand 392 states and 1373 transitions. Second operand 9 states. [2020-02-10 19:43:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:49,069 INFO L93 Difference]: Finished difference Result 593 states and 1773 transitions. [2020-02-10 19:43:49,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:49,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:49,077 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:43:49,077 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:43:49,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:49,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:43:49,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 390. [2020-02-10 19:43:49,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:43:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1369 transitions. [2020-02-10 19:43:49,099 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1369 transitions. Word has length 22 [2020-02-10 19:43:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:49,099 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1369 transitions. [2020-02-10 19:43:49,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1369 transitions. [2020-02-10 19:43:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:49,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:49,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 19:43:49,102 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 19:43:49,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:49,102 INFO L82 PathProgramCache]: Analyzing trace with hash 784024996, now seen corresponding path program 5 times [2020-02-10 19:43:49,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:49,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780176730] [2020-02-10 19:43:49,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:49,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 19:43:49,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780176730] [2020-02-10 19:43:49,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:49,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:49,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985122583] [2020-02-10 19:43:49,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:49,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:49,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:49,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:49,485 INFO L87 Difference]: Start difference. First operand 390 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:43:49,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:49,590 INFO L93 Difference]: Finished difference Result 589 states and 1766 transitions. [2020-02-10 19:43:49,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:49,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:49,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:49,598 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:43:49,599 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:43:49,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 19:43:49,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:43:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 391. [2020-02-10 19:43:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:43:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1370 transitions. [2020-02-10 19:43:49,621 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1370 transitions. Word has length 22 [2020-02-10 19:43:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:49,621 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1370 transitions. [2020-02-10 19:43:49,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1370 transitions. [2020-02-10 19:43:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:49,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:49,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 19:43:49,623 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 19:43:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash -661492014, now seen corresponding path program 6 times [2020-02-10 19:43:49,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:49,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515985285] [2020-02-10 19:43:49,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:49,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515985285] [2020-02-10 19:43:49,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:49,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:49,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524429325] [2020-02-10 19:43:49,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:49,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:49,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:49,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:49,999 INFO L87 Difference]: Start difference. First operand 391 states and 1370 transitions. Second operand 9 states. [2020-02-10 19:43:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:50,128 INFO L93 Difference]: Finished difference Result 587 states and 1761 transitions. [2020-02-10 19:43:50,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:50,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:50,133 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:43:50,133 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:43:50,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:43:50,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 388. [2020-02-10 19:43:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:43:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1365 transitions. [2020-02-10 19:43:50,151 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1365 transitions. Word has length 22 [2020-02-10 19:43:50,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:50,151 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1365 transitions. [2020-02-10 19:43:50,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1365 transitions. [2020-02-10 19:43:50,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:50,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:50,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 19:43:50,154 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 19:43:50,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:50,154 INFO L82 PathProgramCache]: Analyzing trace with hash 203279156, now seen corresponding path program 7 times [2020-02-10 19:43:50,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:50,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541188849] [2020-02-10 19:43:50,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:50,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 19:43:50,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541188849] [2020-02-10 19:43:50,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:50,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:50,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207528905] [2020-02-10 19:43:50,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:50,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:50,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:50,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:50,535 INFO L87 Difference]: Start difference. First operand 388 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:43:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:50,652 INFO L93 Difference]: Finished difference Result 608 states and 1810 transitions. [2020-02-10 19:43:50,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:50,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:50,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:50,657 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:43:50,658 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:43:50,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 19:43:50,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:43:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 395. [2020-02-10 19:43:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:43:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1381 transitions. [2020-02-10 19:43:50,687 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1381 transitions. Word has length 22 [2020-02-10 19:43:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:50,687 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1381 transitions. [2020-02-10 19:43:50,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1381 transitions. [2020-02-10 19:43:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:50,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:50,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 19:43:50,689 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 19:43:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:50,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1793545042, now seen corresponding path program 8 times [2020-02-10 19:43:50,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:50,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698658432] [2020-02-10 19:43:50,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:51,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 19:43:51,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698658432] [2020-02-10 19:43:51,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:51,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:51,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429464505] [2020-02-10 19:43:51,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:51,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:51,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:51,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:51,009 INFO L87 Difference]: Start difference. First operand 395 states and 1381 transitions. Second operand 9 states. [2020-02-10 19:43:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:51,137 INFO L93 Difference]: Finished difference Result 603 states and 1797 transitions. [2020-02-10 19:43:51,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:51,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:51,143 INFO L225 Difference]: With dead ends: 603 [2020-02-10 19:43:51,143 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:43:51,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:51,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:43:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 391. [2020-02-10 19:43:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:43:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1372 transitions. [2020-02-10 19:43:51,161 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1372 transitions. Word has length 22 [2020-02-10 19:43:51,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:51,161 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1372 transitions. [2020-02-10 19:43:51,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1372 transitions. [2020-02-10 19:43:51,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:51,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:51,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 19:43:51,163 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 19:43:51,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:51,163 INFO L82 PathProgramCache]: Analyzing trace with hash 304191328, now seen corresponding path program 9 times [2020-02-10 19:43:51,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:51,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701467807] [2020-02-10 19:43:51,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:51,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701467807] [2020-02-10 19:43:51,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:51,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:51,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711380277] [2020-02-10 19:43:51,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:51,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:51,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:51,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:51,499 INFO L87 Difference]: Start difference. First operand 391 states and 1372 transitions. Second operand 9 states. [2020-02-10 19:43:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:51,631 INFO L93 Difference]: Finished difference Result 606 states and 1802 transitions. [2020-02-10 19:43:51,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:51,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:51,638 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:43:51,638 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:43:51,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 19:43:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:43:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 394. [2020-02-10 19:43:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:43:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1376 transitions. [2020-02-10 19:43:51,656 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1376 transitions. Word has length 22 [2020-02-10 19:43:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:51,656 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1376 transitions. [2020-02-10 19:43:51,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1376 transitions. [2020-02-10 19:43:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:51,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:51,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 19:43:51,658 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 19:43:51,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash 430827702, now seen corresponding path program 10 times [2020-02-10 19:43:51,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:51,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014987001] [2020-02-10 19:43:51,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:52,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 19:43:52,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014987001] [2020-02-10 19:43:52,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:52,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:52,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582290297] [2020-02-10 19:43:52,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:52,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:52,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:52,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:52,020 INFO L87 Difference]: Start difference. First operand 394 states and 1376 transitions. Second operand 9 states. [2020-02-10 19:43:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:52,139 INFO L93 Difference]: Finished difference Result 600 states and 1788 transitions. [2020-02-10 19:43:52,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:52,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:52,145 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:43:52,146 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:43:52,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 19:43:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:43:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 391. [2020-02-10 19:43:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:43:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1369 transitions. [2020-02-10 19:43:52,162 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1369 transitions. Word has length 22 [2020-02-10 19:43:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:52,163 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1369 transitions. [2020-02-10 19:43:52,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1369 transitions. [2020-02-10 19:43:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:52,164 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:52,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 19:43:52,165 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 19:43:52,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:52,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1984190466, now seen corresponding path program 11 times [2020-02-10 19:43:52,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:52,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969810343] [2020-02-10 19:43:52,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:52,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969810343] [2020-02-10 19:43:52,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:52,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:52,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681224935] [2020-02-10 19:43:52,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:52,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:52,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:52,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:52,488 INFO L87 Difference]: Start difference. First operand 391 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:43:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:52,623 INFO L93 Difference]: Finished difference Result 595 states and 1779 transitions. [2020-02-10 19:43:52,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:52,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:52,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:52,629 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:43:52,630 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:43:52,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 19:43:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:43:52,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 393. [2020-02-10 19:43:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:43:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1372 transitions. [2020-02-10 19:43:52,653 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1372 transitions. Word has length 22 [2020-02-10 19:43:52,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:52,653 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1372 transitions. [2020-02-10 19:43:52,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1372 transitions. [2020-02-10 19:43:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:52,655 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43: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 19:43:52,655 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 19:43:52,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:52,655 INFO L82 PathProgramCache]: Analyzing trace with hash -642257678, now seen corresponding path program 12 times [2020-02-10 19:43:52,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:52,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309163053] [2020-02-10 19:43:52,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:53,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 19:43:53,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309163053] [2020-02-10 19:43:53,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:53,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:53,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113290715] [2020-02-10 19:43:53,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:53,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:53,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:53,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:53,013 INFO L87 Difference]: Start difference. First operand 393 states and 1372 transitions. Second operand 9 states. [2020-02-10 19:43:53,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:53,130 INFO L93 Difference]: Finished difference Result 594 states and 1775 transitions. [2020-02-10 19:43:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:53,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:53,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:53,135 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:43:53,135 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:43:53,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 19:43:53,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:43:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 388. [2020-02-10 19:43:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:43:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1363 transitions. [2020-02-10 19:43:53,160 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1363 transitions. Word has length 22 [2020-02-10 19:43:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:53,160 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1363 transitions. [2020-02-10 19:43:53,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1363 transitions. [2020-02-10 19:43:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:53,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:53,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 19:43:53,162 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 19:43:53,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:53,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1959727298, now seen corresponding path program 13 times [2020-02-10 19:43:53,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:53,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92764229] [2020-02-10 19:43:53,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:53,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 19:43:53,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92764229] [2020-02-10 19:43:53,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:53,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:53,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071075438] [2020-02-10 19:43:53,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:53,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:53,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:53,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:53,502 INFO L87 Difference]: Start difference. First operand 388 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:43:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:53,616 INFO L93 Difference]: Finished difference Result 598 states and 1781 transitions. [2020-02-10 19:43:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:53,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:53,620 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:43:53,620 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:43:53,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 19:43:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:43:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 392. [2020-02-10 19:43:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:43:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1371 transitions. [2020-02-10 19:43:53,637 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1371 transitions. Word has length 22 [2020-02-10 19:43:53,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:53,638 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1371 transitions. [2020-02-10 19:43:53,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:53,638 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1371 transitions. [2020-02-10 19:43:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:53,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:53,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 19:43:53,639 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 19:43:53,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:53,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1774171506, now seen corresponding path program 14 times [2020-02-10 19:43:53,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:53,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102841278] [2020-02-10 19:43:53,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:53,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 19:43:53,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102841278] [2020-02-10 19:43:53,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:53,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:53,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356777956] [2020-02-10 19:43:53,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:53,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:53,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:53,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:53,978 INFO L87 Difference]: Start difference. First operand 392 states and 1371 transitions. Second operand 9 states. [2020-02-10 19:43:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:54,071 INFO L93 Difference]: Finished difference Result 591 states and 1766 transitions. [2020-02-10 19:43:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:54,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:54,074 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:43:54,075 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:43:54,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:43:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 390. [2020-02-10 19:43:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:43:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1367 transitions. [2020-02-10 19:43:54,091 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1367 transitions. Word has length 22 [2020-02-10 19:43:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:54,091 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1367 transitions. [2020-02-10 19:43:54,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1367 transitions. [2020-02-10 19:43:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:54,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:54,093 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:54,093 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 19:43:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:54,093 INFO L82 PathProgramCache]: Analyzing trace with hash 359289444, now seen corresponding path program 15 times [2020-02-10 19:43:54,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:54,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118886546] [2020-02-10 19:43:54,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:54,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 19:43:54,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118886546] [2020-02-10 19:43:54,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:54,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:54,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925163522] [2020-02-10 19:43:54,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:54,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:54,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:54,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:54,436 INFO L87 Difference]: Start difference. First operand 390 states and 1367 transitions. Second operand 9 states. [2020-02-10 19:43:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:54,524 INFO L93 Difference]: Finished difference Result 600 states and 1784 transitions. [2020-02-10 19:43:54,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:54,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:54,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:54,527 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:43:54,527 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:43:54,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:43:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 393. [2020-02-10 19:43:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:43:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1371 transitions. [2020-02-10 19:43:54,547 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1371 transitions. Word has length 22 [2020-02-10 19:43:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:54,547 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1371 transitions. [2020-02-10 19:43:54,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1371 transitions. [2020-02-10 19:43:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:54,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:54,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 19:43:54,549 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 19:43:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash -602914218, now seen corresponding path program 16 times [2020-02-10 19:43:54,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:54,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650927964] [2020-02-10 19:43:54,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:54,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650927964] [2020-02-10 19:43:54,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:54,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:54,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356264197] [2020-02-10 19:43:54,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:54,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:54,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:54,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:54,942 INFO L87 Difference]: Start difference. First operand 393 states and 1371 transitions. Second operand 9 states. [2020-02-10 19:43:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:55,059 INFO L93 Difference]: Finished difference Result 594 states and 1770 transitions. [2020-02-10 19:43:55,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:55,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:55,062 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:43:55,062 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 19:43:55,062 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 19:43:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 19:43:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 390. [2020-02-10 19:43:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:43:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1365 transitions. [2020-02-10 19:43:55,086 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1365 transitions. Word has length 22 [2020-02-10 19:43:55,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:55,087 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1365 transitions. [2020-02-10 19:43:55,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1365 transitions. [2020-02-10 19:43:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:55,088 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:55,088 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:55,089 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 19:43:55,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:55,089 INFO L82 PathProgramCache]: Analyzing trace with hash 414011670, now seen corresponding path program 17 times [2020-02-10 19:43:55,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:55,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823404575] [2020-02-10 19:43:55,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:55,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823404575] [2020-02-10 19:43:55,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:55,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:55,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285248588] [2020-02-10 19:43:55,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:55,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:55,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:55,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:55,431 INFO L87 Difference]: Start difference. First operand 390 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:43:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:55,613 INFO L93 Difference]: Finished difference Result 584 states and 1751 transitions. [2020-02-10 19:43:55,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:55,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:55,616 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:43:55,616 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:43:55,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 19:43:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:43:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 391. [2020-02-10 19:43:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:43:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-02-10 19:43:55,637 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-02-10 19:43:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:55,637 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-02-10 19:43:55,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-02-10 19:43:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:55,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:55,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 19:43:55,639 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 19:43:55,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:55,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2024952628, now seen corresponding path program 18 times [2020-02-10 19:43:55,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:55,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982372463] [2020-02-10 19:43:55,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:55,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 19:43:55,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982372463] [2020-02-10 19:43:55,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:55,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:55,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762655048] [2020-02-10 19:43:55,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:55,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:55,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:55,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:55,975 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:43:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:56,087 INFO L93 Difference]: Finished difference Result 585 states and 1752 transitions. [2020-02-10 19:43:56,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:56,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:56,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:56,092 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:43:56,092 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:43:56,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:56,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:43:56,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 388. [2020-02-10 19:43:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:43:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1361 transitions. [2020-02-10 19:43:56,112 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1361 transitions. Word has length 22 [2020-02-10 19:43:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:56,112 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1361 transitions. [2020-02-10 19:43:56,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1361 transitions. [2020-02-10 19:43:56,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:56,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:56,114 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:56,114 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 19:43:56,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:56,114 INFO L82 PathProgramCache]: Analyzing trace with hash 322537952, now seen corresponding path program 19 times [2020-02-10 19:43:56,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:56,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938433558] [2020-02-10 19:43:56,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:56,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 19:43:56,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938433558] [2020-02-10 19:43:56,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:56,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:56,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171356786] [2020-02-10 19:43:56,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:56,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:56,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:56,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:56,459 INFO L87 Difference]: Start difference. First operand 388 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:43:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:56,588 INFO L93 Difference]: Finished difference Result 579 states and 1743 transitions. [2020-02-10 19:43:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:56,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:56,591 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:43:56,591 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:43:56,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:43:56,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 390. [2020-02-10 19:43:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:43:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1365 transitions. [2020-02-10 19:43:56,606 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1365 transitions. Word has length 22 [2020-02-10 19:43:56,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:56,607 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1365 transitions. [2020-02-10 19:43:56,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1365 transitions. [2020-02-10 19:43:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:56,608 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:56,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 19:43:56,608 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 19:43:56,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:56,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1122979058, now seen corresponding path program 20 times [2020-02-10 19:43:56,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:56,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232376054] [2020-02-10 19:43:56,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:56,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 19:43:56,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232376054] [2020-02-10 19:43:56,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:56,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:56,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294232936] [2020-02-10 19:43:56,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:56,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:56,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:56,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:56,956 INFO L87 Difference]: Start difference. First operand 390 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:43:57,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:57,042 INFO L93 Difference]: Finished difference Result 577 states and 1738 transitions. [2020-02-10 19:43:57,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:57,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:57,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:57,045 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:43:57,045 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:43:57,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 19:43:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:43:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 389. [2020-02-10 19:43:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:43:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1363 transitions. [2020-02-10 19:43:57,060 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1363 transitions. Word has length 22 [2020-02-10 19:43:57,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:57,060 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1363 transitions. [2020-02-10 19:43:57,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1363 transitions. [2020-02-10 19:43:57,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:57,061 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:57,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 19:43:57,062 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 19:43:57,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:57,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1277899902, now seen corresponding path program 21 times [2020-02-10 19:43:57,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:57,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124519646] [2020-02-10 19:43:57,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:57,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 19:43:57,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124519646] [2020-02-10 19:43:57,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:57,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:57,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142511283] [2020-02-10 19:43:57,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:57,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:57,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:57,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:57,379 INFO L87 Difference]: Start difference. First operand 389 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:43:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:57,509 INFO L93 Difference]: Finished difference Result 581 states and 1747 transitions. [2020-02-10 19:43:57,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:57,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:57,512 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:43:57,512 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:43:57,513 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:43:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 391. [2020-02-10 19:43:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:43:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-02-10 19:43:57,530 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-02-10 19:43:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:57,531 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-02-10 19:43:57,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-02-10 19:43:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:57,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:57,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 19:43:57,533 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 19:43:57,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:57,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1024807150, now seen corresponding path program 22 times [2020-02-10 19:43:57,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:57,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994936359] [2020-02-10 19:43:57,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:57,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 19:43:57,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994936359] [2020-02-10 19:43:57,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:57,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:57,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595949410] [2020-02-10 19:43:57,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:57,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:57,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:57,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:57,862 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:43:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:57,996 INFO L93 Difference]: Finished difference Result 580 states and 1743 transitions. [2020-02-10 19:43:57,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:57,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:57,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:57,999 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:43:57,999 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:43:57,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 19:43:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:43:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 389. [2020-02-10 19:43:58,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:43:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1362 transitions. [2020-02-10 19:43:58,014 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1362 transitions. Word has length 22 [2020-02-10 19:43:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:58,014 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1362 transitions. [2020-02-10 19:43:58,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1362 transitions. [2020-02-10 19:43:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:58,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:58,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 19:43:58,016 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 19:43:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash -28887470, now seen corresponding path program 23 times [2020-02-10 19:43:58,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:58,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949121827] [2020-02-10 19:43:58,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43: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 19:43:58,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949121827] [2020-02-10 19:43:58,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:58,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:58,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742460310] [2020-02-10 19:43:58,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:58,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:58,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:58,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:58,373 INFO L87 Difference]: Start difference. First operand 389 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:43:58,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:58,466 INFO L93 Difference]: Finished difference Result 576 states and 1735 transitions. [2020-02-10 19:43:58,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:58,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:58,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:58,469 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:43:58,470 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:43:58,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:58,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:43:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 390. [2020-02-10 19:43:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:43:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1363 transitions. [2020-02-10 19:43:58,487 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1363 transitions. Word has length 22 [2020-02-10 19:43:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:58,488 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1363 transitions. [2020-02-10 19:43:58,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1363 transitions. [2020-02-10 19:43:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:58,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:58,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 19:43:58,490 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 19:43:58,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:58,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1582053488, now seen corresponding path program 24 times [2020-02-10 19:43:58,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:58,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493956940] [2020-02-10 19:43:58,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:58,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 19:43:58,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493956940] [2020-02-10 19:43:58,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:58,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:58,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892543559] [2020-02-10 19:43:58,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:58,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:58,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:58,840 INFO L87 Difference]: Start difference. First operand 390 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:43:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:58,961 INFO L93 Difference]: Finished difference Result 577 states and 1736 transitions. [2020-02-10 19:43:58,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:58,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:58,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:58,963 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:43:58,963 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:43:58,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:43:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 386. [2020-02-10 19:43:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:43:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1357 transitions. [2020-02-10 19:43:58,979 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1357 transitions. Word has length 22 [2020-02-10 19:43:58,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:58,979 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1357 transitions. [2020-02-10 19:43:58,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1357 transitions. [2020-02-10 19:43:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:58,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:58,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 19:43:58,981 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 19:43:58,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:58,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2110854208, now seen corresponding path program 25 times [2020-02-10 19:43:58,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:58,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140770405] [2020-02-10 19:43:58,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:59,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 19:43:59,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140770405] [2020-02-10 19:43:59,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:59,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:59,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664067158] [2020-02-10 19:43:59,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:59,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:59,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:59,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:59,326 INFO L87 Difference]: Start difference. First operand 386 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:43:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:59,413 INFO L93 Difference]: Finished difference Result 618 states and 1833 transitions. [2020-02-10 19:43:59,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:59,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:59,417 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:43:59,418 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:43:59,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 19:43:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:43:59,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 395. [2020-02-10 19:43:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:43:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1380 transitions. [2020-02-10 19:43:59,434 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1380 transitions. Word has length 22 [2020-02-10 19:43:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:59,434 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1380 transitions. [2020-02-10 19:43:59,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1380 transitions. [2020-02-10 19:43:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:59,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:59,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 19:43:59,436 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 19:43:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:59,436 INFO L82 PathProgramCache]: Analyzing trace with hash -593847202, now seen corresponding path program 26 times [2020-02-10 19:43:59,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:59,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148357161] [2020-02-10 19:43:59,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:59,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 19:43:59,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148357161] [2020-02-10 19:43:59,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:59,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:43:59,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176428749] [2020-02-10 19:43:59,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:43:59,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:59,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:43:59,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:59,725 INFO L87 Difference]: Start difference. First operand 395 states and 1380 transitions. Second operand 9 states. [2020-02-10 19:43:59,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:59,825 INFO L93 Difference]: Finished difference Result 613 states and 1820 transitions. [2020-02-10 19:43:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:43:59,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:43:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:59,827 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:43:59,827 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:43:59,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 19:43:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:43:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 391. [2020-02-10 19:43:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:43:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1372 transitions. [2020-02-10 19:43:59,841 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1372 transitions. Word has length 22 [2020-02-10 19:43:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:59,841 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1372 transitions. [2020-02-10 19:43:59,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:43:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1372 transitions. [2020-02-10 19:43:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:43:59,842 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:59,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 19:43:59,843 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 19:43:59,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:59,843 INFO L82 PathProgramCache]: Analyzing trace with hash -831562768, now seen corresponding path program 27 times [2020-02-10 19:43:59,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:59,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629167161] [2020-02-10 19:43:59,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:00,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 19:44:00,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629167161] [2020-02-10 19:44:00,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:00,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:00,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438560114] [2020-02-10 19:44:00,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:00,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:00,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:00,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:00,134 INFO L87 Difference]: Start difference. First operand 391 states and 1372 transitions. Second operand 9 states. [2020-02-10 19:44:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:00,219 INFO L93 Difference]: Finished difference Result 614 states and 1821 transitions. [2020-02-10 19:44:00,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:00,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:00,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:00,221 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:44:00,221 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:44:00,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 19:44:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:44:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 393. [2020-02-10 19:44:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:44:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1374 transitions. [2020-02-10 19:44:00,235 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1374 transitions. Word has length 22 [2020-02-10 19:44:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:00,235 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1374 transitions. [2020-02-10 19:44:00,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1374 transitions. [2020-02-10 19:44:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:00,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:00,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 19:44:00,237 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 19:44:00,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:00,237 INFO L82 PathProgramCache]: Analyzing trace with hash -270494276, now seen corresponding path program 28 times [2020-02-10 19:44:00,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:00,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505624756] [2020-02-10 19:44:00,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:00,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 19:44:00,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505624756] [2020-02-10 19:44:00,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:00,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:00,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780735519] [2020-02-10 19:44:00,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:00,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:00,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:00,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:00,554 INFO L87 Difference]: Start difference. First operand 393 states and 1374 transitions. Second operand 9 states. [2020-02-10 19:44:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:00,644 INFO L93 Difference]: Finished difference Result 607 states and 1806 transitions. [2020-02-10 19:44:00,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:00,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:00,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:00,646 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:44:00,646 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:44:00,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:00,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:44:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 391. [2020-02-10 19:44:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1370 transitions. [2020-02-10 19:44:00,658 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1370 transitions. Word has length 22 [2020-02-10 19:44:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:00,658 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1370 transitions. [2020-02-10 19:44:00,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1370 transitions. [2020-02-10 19:44:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:00,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:00,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:00,660 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 19:44:00,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:00,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2025852974, now seen corresponding path program 29 times [2020-02-10 19:44:00,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:00,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704609695] [2020-02-10 19:44:00,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:00,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704609695] [2020-02-10 19:44:00,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:00,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:00,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894354226] [2020-02-10 19:44:00,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:00,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:00,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:00,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:00,962 INFO L87 Difference]: Start difference. First operand 391 states and 1370 transitions. Second operand 9 states. [2020-02-10 19:44:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:01,074 INFO L93 Difference]: Finished difference Result 603 states and 1799 transitions. [2020-02-10 19:44:01,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:01,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:01,076 INFO L225 Difference]: With dead ends: 603 [2020-02-10 19:44:01,076 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:44:01,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 19:44:01,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:44:01,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 392. [2020-02-10 19:44:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:44:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1371 transitions. [2020-02-10 19:44:01,090 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1371 transitions. Word has length 22 [2020-02-10 19:44:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:01,090 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1371 transitions. [2020-02-10 19:44:01,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1371 transitions. [2020-02-10 19:44:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:01,091 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:01,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 19:44:01,092 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 19:44:01,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:01,092 INFO L82 PathProgramCache]: Analyzing trace with hash 823597312, now seen corresponding path program 30 times [2020-02-10 19:44:01,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:01,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180887650] [2020-02-10 19:44:01,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:01,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 19:44:01,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180887650] [2020-02-10 19:44:01,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:01,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:01,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060422187] [2020-02-10 19:44:01,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:01,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:01,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:01,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:01,422 INFO L87 Difference]: Start difference. First operand 392 states and 1371 transitions. Second operand 9 states. [2020-02-10 19:44:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:01,506 INFO L93 Difference]: Finished difference Result 601 states and 1794 transitions. [2020-02-10 19:44:01,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:01,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:01,509 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:44:01,509 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 19:44:01,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 19:44:01,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 19:44:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 389. [2020-02-10 19:44:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1366 transitions. [2020-02-10 19:44:01,522 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1366 transitions. Word has length 22 [2020-02-10 19:44:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:01,522 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1366 transitions. [2020-02-10 19:44:01,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1366 transitions. [2020-02-10 19:44:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:01,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:01,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 19:44:01,524 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 19:44:01,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:01,524 INFO L82 PathProgramCache]: Analyzing trace with hash 350801268, now seen corresponding path program 31 times [2020-02-10 19:44:01,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:01,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253710718] [2020-02-10 19:44:01,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:01,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 19:44:01,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253710718] [2020-02-10 19:44:01,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:01,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:01,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385754615] [2020-02-10 19:44:01,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:01,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:01,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:01,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:01,872 INFO L87 Difference]: Start difference. First operand 389 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:44:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:01,949 INFO L93 Difference]: Finished difference Result 634 states and 1873 transitions. [2020-02-10 19:44:01,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:01,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:01,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:01,951 INFO L225 Difference]: With dead ends: 634 [2020-02-10 19:44:01,951 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 19:44:01,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 19:44:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 398. [2020-02-10 19:44:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:44:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1388 transitions. [2020-02-10 19:44:01,964 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1388 transitions. Word has length 22 [2020-02-10 19:44:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:01,964 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1388 transitions. [2020-02-10 19:44:01,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1388 transitions. [2020-02-10 19:44:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:01,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:01,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 19:44:01,965 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 19:44:01,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:01,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1941067154, now seen corresponding path program 32 times [2020-02-10 19:44:01,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:01,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367229757] [2020-02-10 19:44:01,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:02,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 19:44:02,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367229757] [2020-02-10 19:44:02,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:02,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:02,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334834701] [2020-02-10 19:44:02,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:02,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:02,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:02,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:02,287 INFO L87 Difference]: Start difference. First operand 398 states and 1388 transitions. Second operand 9 states. [2020-02-10 19:44:02,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:02,408 INFO L93 Difference]: Finished difference Result 629 states and 1860 transitions. [2020-02-10 19:44:02,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:02,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:02,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:02,410 INFO L225 Difference]: With dead ends: 629 [2020-02-10 19:44:02,410 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 19:44: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 19:44:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 19:44:02,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 394. [2020-02-10 19:44:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:44:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1378 transitions. [2020-02-10 19:44:02,428 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1378 transitions. Word has length 22 [2020-02-10 19:44:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:02,429 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1378 transitions. [2020-02-10 19:44:02,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1378 transitions. [2020-02-10 19:44:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:02,430 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:02,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 19:44:02,430 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 19:44:02,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:02,431 INFO L82 PathProgramCache]: Analyzing trace with hash 615852132, now seen corresponding path program 33 times [2020-02-10 19:44:02,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:02,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133916362] [2020-02-10 19:44:02,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:02,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 19:44:02,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133916362] [2020-02-10 19:44:02,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:02,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:02,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321373691] [2020-02-10 19:44:02,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:02,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:02,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:02,745 INFO L87 Difference]: Start difference. First operand 394 states and 1378 transitions. Second operand 9 states. [2020-02-10 19:44:02,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:02,855 INFO L93 Difference]: Finished difference Result 641 states and 1885 transitions. [2020-02-10 19:44:02,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:02,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:02,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:02,858 INFO L225 Difference]: With dead ends: 641 [2020-02-10 19:44:02,858 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 19:44:02,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 19:44:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 19:44:02,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 402. [2020-02-10 19:44:02,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 19:44:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1391 transitions. [2020-02-10 19:44:02,883 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1391 transitions. Word has length 22 [2020-02-10 19:44:02,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:02,884 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1391 transitions. [2020-02-10 19:44:02,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1391 transitions. [2020-02-10 19:44:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:02,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:02,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 19:44:02,885 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 19:44:02,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:02,886 INFO L82 PathProgramCache]: Analyzing trace with hash -881719418, now seen corresponding path program 34 times [2020-02-10 19:44:02,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:02,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605143053] [2020-02-10 19:44:02,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:03,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 19:44:03,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605143053] [2020-02-10 19:44:03,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:03,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:03,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573621754] [2020-02-10 19:44:03,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:03,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:03,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:03,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:03,234 INFO L87 Difference]: Start difference. First operand 402 states and 1391 transitions. Second operand 9 states. [2020-02-10 19:44:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:03,333 INFO L93 Difference]: Finished difference Result 639 states and 1875 transitions. [2020-02-10 19:44:03,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:03,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:03,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,334 INFO L225 Difference]: With dead ends: 639 [2020-02-10 19:44:03,334 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:44:03,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 19:44:03,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:44:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 394. [2020-02-10 19:44:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:44:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1373 transitions. [2020-02-10 19:44:03,347 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1373 transitions. Word has length 22 [2020-02-10 19:44:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,348 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1373 transitions. [2020-02-10 19:44:03,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:03,348 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1373 transitions. [2020-02-10 19:44:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:03,349 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,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 19:44:03,349 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 19:44:03,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,350 INFO L82 PathProgramCache]: Analyzing trace with hash -599444282, now seen corresponding path program 35 times [2020-02-10 19:44:03,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648933509] [2020-02-10 19:44:03,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:03,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 19:44:03,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648933509] [2020-02-10 19:44:03,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:03,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:03,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444760367] [2020-02-10 19:44:03,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:03,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:03,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:03,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:03,684 INFO L87 Difference]: Start difference. First operand 394 states and 1373 transitions. Second operand 9 states. [2020-02-10 19:44:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:03,786 INFO L93 Difference]: Finished difference Result 626 states and 1850 transitions. [2020-02-10 19:44:03,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:03,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:03,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,787 INFO L225 Difference]: With dead ends: 626 [2020-02-10 19:44:03,787 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 19:44:03,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 19:44:03,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 19:44:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 397. [2020-02-10 19:44:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:44:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1378 transitions. [2020-02-10 19:44:03,798 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1378 transitions. Word has length 22 [2020-02-10 19:44:03,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,799 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1378 transitions. [2020-02-10 19:44:03,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1378 transitions. [2020-02-10 19:44:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:03,800 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,800 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:03,801 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 19:44:03,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,801 INFO L82 PathProgramCache]: Analyzing trace with hash -581010256, now seen corresponding path program 36 times [2020-02-10 19:44:03,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534797169] [2020-02-10 19:44:03,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:04,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 19:44:04,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534797169] [2020-02-10 19:44:04,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:04,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:04,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340335927] [2020-02-10 19:44:04,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:04,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:04,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:04,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:04,105 INFO L87 Difference]: Start difference. First operand 397 states and 1378 transitions. Second operand 9 states. [2020-02-10 19:44:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:04,220 INFO L93 Difference]: Finished difference Result 629 states and 1853 transitions. [2020-02-10 19:44:04,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:04,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:04,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:04,222 INFO L225 Difference]: With dead ends: 629 [2020-02-10 19:44:04,222 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 19:44:04,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 19:44:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 19:44:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 389. [2020-02-10 19:44:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1363 transitions. [2020-02-10 19:44:04,234 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1363 transitions. Word has length 22 [2020-02-10 19:44:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:04,234 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1363 transitions. [2020-02-10 19:44:04,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1363 transitions. [2020-02-10 19:44:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:04,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:04,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 19:44:04,236 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 19:44:04,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:04,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1509912752, now seen corresponding path program 37 times [2020-02-10 19:44:04,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:04,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251216818] [2020-02-10 19:44:04,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:04,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 19:44:04,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251216818] [2020-02-10 19:44:04,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:04,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:04,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092531899] [2020-02-10 19:44:04,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:04,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:04,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:04,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:04,559 INFO L87 Difference]: Start difference. First operand 389 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:44:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:04,656 INFO L93 Difference]: Finished difference Result 622 states and 1836 transitions. [2020-02-10 19:44:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:04,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:04,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:04,658 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:44:04,658 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:44:04,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:44:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 394. [2020-02-10 19:44:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:44:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1373 transitions. [2020-02-10 19:44:04,672 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1373 transitions. Word has length 22 [2020-02-10 19:44:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:04,672 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1373 transitions. [2020-02-10 19:44:04,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1373 transitions. [2020-02-10 19:44:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:04,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:04,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 19:44:04,674 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 19:44:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2070981244, now seen corresponding path program 38 times [2020-02-10 19:44:04,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:04,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074720852] [2020-02-10 19:44:04,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:04,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 19:44:04,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074720852] [2020-02-10 19:44:04,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:04,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:04,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976318057] [2020-02-10 19:44:04,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:04,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:04,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:04,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:04,982 INFO L87 Difference]: Start difference. First operand 394 states and 1373 transitions. Second operand 9 states. [2020-02-10 19:44:05,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:05,070 INFO L93 Difference]: Finished difference Result 615 states and 1821 transitions. [2020-02-10 19:44:05,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:05,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:05,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:05,072 INFO L225 Difference]: With dead ends: 615 [2020-02-10 19:44:05,072 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 19:44:05,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 19:44:05,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 19:44:05,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 392. [2020-02-10 19:44:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:44:05,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1369 transitions. [2020-02-10 19:44:05,084 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1369 transitions. Word has length 22 [2020-02-10 19:44:05,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:05,084 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1369 transitions. [2020-02-10 19:44:05,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1369 transitions. [2020-02-10 19:44:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:05,085 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:05,085 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:05,085 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 19:44:05,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:05,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1772362012, now seen corresponding path program 39 times [2020-02-10 19:44:05,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:05,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033526596] [2020-02-10 19:44:05,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:05,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 19:44:05,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033526596] [2020-02-10 19:44:05,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:05,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:05,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19343977] [2020-02-10 19:44:05,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:05,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:05,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:05,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:05,517 INFO L87 Difference]: Start difference. First operand 392 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:44:05,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:05,613 INFO L93 Difference]: Finished difference Result 633 states and 1860 transitions. [2020-02-10 19:44:05,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:05,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:05,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:05,615 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:44:05,615 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:44:05,616 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 19:44:05,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:44:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 400. [2020-02-10 19:44:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 19:44:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1382 transitions. [2020-02-10 19:44:05,638 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1382 transitions. Word has length 22 [2020-02-10 19:44:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:05,639 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1382 transitions. [2020-02-10 19:44:05,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:05,639 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1382 transitions. [2020-02-10 19:44:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:05,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:05,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 19:44:05,640 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 19:44:05,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:05,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1902332458, now seen corresponding path program 40 times [2020-02-10 19:44:05,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:05,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504803301] [2020-02-10 19:44:05,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:05,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 19:44:05,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504803301] [2020-02-10 19:44:05,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:05,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:05,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832822532] [2020-02-10 19:44:05,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:05,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:05,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:05,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:05,970 INFO L87 Difference]: Start difference. First operand 400 states and 1382 transitions. Second operand 9 states. [2020-02-10 19:44:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:06,102 INFO L93 Difference]: Finished difference Result 631 states and 1850 transitions. [2020-02-10 19:44:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:06,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:06,104 INFO L225 Difference]: With dead ends: 631 [2020-02-10 19:44:06,105 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 19:44:06,105 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:06,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 19:44:06,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 392. [2020-02-10 19:44:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:44:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1366 transitions. [2020-02-10 19:44:06,118 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1366 transitions. Word has length 22 [2020-02-10 19:44:06,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:06,118 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1366 transitions. [2020-02-10 19:44:06,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1366 transitions. [2020-02-10 19:44:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:06,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:06,120 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:06,120 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 19:44:06,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:06,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1717639786, now seen corresponding path program 41 times [2020-02-10 19:44:06,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:06,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368274162] [2020-02-10 19:44:06,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:06,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 19:44:06,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368274162] [2020-02-10 19:44:06,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:06,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:06,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698618737] [2020-02-10 19:44:06,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:06,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:06,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:06,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:06,425 INFO L87 Difference]: Start difference. First operand 392 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:44:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:06,526 INFO L93 Difference]: Finished difference Result 612 states and 1813 transitions. [2020-02-10 19:44:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:06,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:06,528 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:44:06,528 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 19:44:06,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 19:44:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 393. [2020-02-10 19:44:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:44:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1367 transitions. [2020-02-10 19:44:06,540 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1367 transitions. Word has length 22 [2020-02-10 19:44:06,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:06,540 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1367 transitions. [2020-02-10 19:44:06,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1367 transitions. [2020-02-10 19:44:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:06,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:06,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:06,541 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 19:44:06,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:06,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1501616354, now seen corresponding path program 42 times [2020-02-10 19:44:06,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:06,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846743051] [2020-02-10 19:44:06,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:06,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 19:44:06,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846743051] [2020-02-10 19:44:06,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:06,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:06,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590324058] [2020-02-10 19:44:06,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:06,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:06,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:06,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:06,842 INFO L87 Difference]: Start difference. First operand 393 states and 1367 transitions. Second operand 9 states. [2020-02-10 19:44:06,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:06,998 INFO L93 Difference]: Finished difference Result 617 states and 1822 transitions. [2020-02-10 19:44:06,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:06,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:06,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:07,000 INFO L225 Difference]: With dead ends: 617 [2020-02-10 19:44:07,000 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:44:07,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:07,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:44:07,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 389. [2020-02-10 19:44:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-02-10 19:44:07,013 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-02-10 19:44:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:07,013 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-02-10 19:44:07,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-02-10 19:44:07,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:07,024 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:07,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 19:44:07,024 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 19:44:07,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:07,024 INFO L82 PathProgramCache]: Analyzing trace with hash -127276594, now seen corresponding path program 43 times [2020-02-10 19:44:07,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:07,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290407447] [2020-02-10 19:44:07,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:07,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 19:44:07,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290407447] [2020-02-10 19:44:07,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:07,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:07,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112860060] [2020-02-10 19:44:07,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:07,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:07,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:07,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:07,293 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:44:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:07,420 INFO L93 Difference]: Finished difference Result 598 states and 1785 transitions. [2020-02-10 19:44:07,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:07,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:07,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:07,422 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:44:07,422 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:44:07,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:44:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 391. [2020-02-10 19:44:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-02-10 19:44:07,433 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-02-10 19:44:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:07,433 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-02-10 19:44:07,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-02-10 19:44:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:07,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:07,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 19:44:07,435 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 19:44:07,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:07,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1572793604, now seen corresponding path program 44 times [2020-02-10 19:44:07,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:07,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478275224] [2020-02-10 19:44:07,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:07,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 19:44:07,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478275224] [2020-02-10 19:44:07,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:07,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:07,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015480318] [2020-02-10 19:44:07,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:07,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:07,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:07,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:07,749 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:44:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:07,867 INFO L93 Difference]: Finished difference Result 596 states and 1780 transitions. [2020-02-10 19:44:07,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:07,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:07,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:07,870 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:44:07,870 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:44:07,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 19:44:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:44:07,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 390. [2020-02-10 19:44:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1362 transitions. [2020-02-10 19:44:07,882 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1362 transitions. Word has length 22 [2020-02-10 19:44:07,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:07,882 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1362 transitions. [2020-02-10 19:44:07,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1362 transitions. [2020-02-10 19:44:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:07,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:07,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 19:44:07,883 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 19:44:07,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:07,884 INFO L82 PathProgramCache]: Analyzing trace with hash 885415938, now seen corresponding path program 45 times [2020-02-10 19:44:07,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:07,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664459478] [2020-02-10 19:44:07,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:08,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 19:44:08,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664459478] [2020-02-10 19:44:08,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:08,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:08,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498372984] [2020-02-10 19:44:08,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:08,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:08,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:08,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:08,200 INFO L87 Difference]: Start difference. First operand 390 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:44:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:08,314 INFO L93 Difference]: Finished difference Result 605 states and 1800 transitions. [2020-02-10 19:44:08,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:08,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:08,317 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:44:08,317 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:44:08,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 19:44:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:44:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 393. [2020-02-10 19:44:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:44:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1367 transitions. [2020-02-10 19:44:08,330 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1367 transitions. Word has length 22 [2020-02-10 19:44:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:08,330 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1367 transitions. [2020-02-10 19:44:08,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1367 transitions. [2020-02-10 19:44:08,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:08,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:08,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 19:44:08,332 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 19:44:08,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:08,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2023516228, now seen corresponding path program 46 times [2020-02-10 19:44:08,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:08,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785958167] [2020-02-10 19:44:08,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:08,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 19:44:08,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785958167] [2020-02-10 19:44:08,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:08,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:08,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377124550] [2020-02-10 19:44:08,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:08,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:08,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:08,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:08,618 INFO L87 Difference]: Start difference. First operand 393 states and 1367 transitions. Second operand 9 states. [2020-02-10 19:44:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:08,743 INFO L93 Difference]: Finished difference Result 608 states and 1803 transitions. [2020-02-10 19:44:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:08,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:08,744 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:44:08,744 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:44:08,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 19:44:08,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:44:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 390. [2020-02-10 19:44:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1361 transitions. [2020-02-10 19:44:08,756 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1361 transitions. Word has length 22 [2020-02-10 19:44:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:08,756 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1361 transitions. [2020-02-10 19:44:08,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1361 transitions. [2020-02-10 19:44:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:08,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:08,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 19:44:08,758 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 19:44:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:08,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2134428370, now seen corresponding path program 47 times [2020-02-10 19:44:08,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:08,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375885668] [2020-02-10 19:44:08,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:09,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 19:44:09,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375885668] [2020-02-10 19:44:09,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:09,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:09,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536724012] [2020-02-10 19:44:09,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:09,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:09,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:09,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:09,042 INFO L87 Difference]: Start difference. First operand 390 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:44:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:09,130 INFO L93 Difference]: Finished difference Result 599 states and 1785 transitions. [2020-02-10 19:44:09,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:09,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:09,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:09,132 INFO L225 Difference]: With dead ends: 599 [2020-02-10 19:44:09,132 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:44:09,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 19:44:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:44:09,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 391. [2020-02-10 19:44:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 19:44:09,144 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 19:44:09,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:09,144 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 19:44:09,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 19:44:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:09,145 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:09,146 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:09,146 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 19:44:09,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:09,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1058717214, now seen corresponding path program 48 times [2020-02-10 19:44:09,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:09,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497145846] [2020-02-10 19:44:09,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:09,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 19:44:09,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497145846] [2020-02-10 19:44:09,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:09,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:09,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846759932] [2020-02-10 19:44:09,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:09,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:09,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:09,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:09,452 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:44:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:09,567 INFO L93 Difference]: Finished difference Result 604 states and 1794 transitions. [2020-02-10 19:44:09,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:09,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:09,569 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:44:09,569 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:44:09,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 19:44:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:44:09,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 386. [2020-02-10 19:44:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:44:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1354 transitions. [2020-02-10 19:44:09,581 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1354 transitions. Word has length 22 [2020-02-10 19:44:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:09,581 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1354 transitions. [2020-02-10 19:44:09,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1354 transitions. [2020-02-10 19:44:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:09,583 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:09,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 19:44:09,583 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 19:44:09,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:09,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1476212864, now seen corresponding path program 49 times [2020-02-10 19:44:09,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:09,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042828697] [2020-02-10 19:44:09,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:09,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:09,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042828697] [2020-02-10 19:44:09,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:09,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:09,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128722964] [2020-02-10 19:44:09,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:09,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:09,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:09,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:09,904 INFO L87 Difference]: Start difference. First operand 386 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:44:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:10,032 INFO L93 Difference]: Finished difference Result 630 states and 1870 transitions. [2020-02-10 19:44:10,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:10,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:10,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:10,035 INFO L225 Difference]: With dead ends: 630 [2020-02-10 19:44:10,035 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 19:44:10,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 19:44:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 19:44:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 397. [2020-02-10 19:44:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:44:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1386 transitions. [2020-02-10 19:44:10,064 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1386 transitions. Word has length 22 [2020-02-10 19:44:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:10,064 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1386 transitions. [2020-02-10 19:44:10,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1386 transitions. [2020-02-10 19:44:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:10,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:10,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 19:44:10,066 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 19:44:10,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:10,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1228488546, now seen corresponding path program 50 times [2020-02-10 19:44:10,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:10,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709836617] [2020-02-10 19:44:10,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:10,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 19:44:10,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709836617] [2020-02-10 19:44:10,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:10,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:10,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985910654] [2020-02-10 19:44:10,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:10,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:10,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:10,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:10,332 INFO L87 Difference]: Start difference. First operand 397 states and 1386 transitions. Second operand 9 states. [2020-02-10 19:44:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:10,449 INFO L93 Difference]: Finished difference Result 625 states and 1857 transitions. [2020-02-10 19:44:10,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:10,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:10,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:10,451 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:44:10,451 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:44:10,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 19:44:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:44:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 393. [2020-02-10 19:44:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:44:10,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1377 transitions. [2020-02-10 19:44:10,463 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1377 transitions. Word has length 22 [2020-02-10 19:44:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:10,463 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1377 transitions. [2020-02-10 19:44:10,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1377 transitions. [2020-02-10 19:44:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:10,464 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:10,464 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:10,464 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 19:44:10,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:10,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1577125036, now seen corresponding path program 51 times [2020-02-10 19:44:10,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:10,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780888840] [2020-02-10 19:44:10,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:10,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 19:44:10,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780888840] [2020-02-10 19:44:10,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:10,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:10,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729092000] [2020-02-10 19:44:10,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:10,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:10,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:10,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:10,880 INFO L87 Difference]: Start difference. First operand 393 states and 1377 transitions. Second operand 9 states. [2020-02-10 19:44:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:11,025 INFO L93 Difference]: Finished difference Result 628 states and 1862 transitions. [2020-02-10 19:44:11,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:11,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:11,028 INFO L225 Difference]: With dead ends: 628 [2020-02-10 19:44:11,028 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 19:44:11,028 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 19:44:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 19:44:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 396. [2020-02-10 19:44:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:44:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1381 transitions. [2020-02-10 19:44:11,046 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1381 transitions. Word has length 22 [2020-02-10 19:44:11,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:11,047 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1381 transitions. [2020-02-10 19:44:11,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1381 transitions. [2020-02-10 19:44:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:11,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:11,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 19:44:11,048 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 19:44:11,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:11,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1703761410, now seen corresponding path program 52 times [2020-02-10 19:44:11,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:11,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890306851] [2020-02-10 19:44:11,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:11,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 19:44:11,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890306851] [2020-02-10 19:44:11,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:11,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:11,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954042620] [2020-02-10 19:44:11,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:11,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:11,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:11,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:11,350 INFO L87 Difference]: Start difference. First operand 396 states and 1381 transitions. Second operand 9 states. [2020-02-10 19:44:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:11,444 INFO L93 Difference]: Finished difference Result 622 states and 1848 transitions. [2020-02-10 19:44:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:11,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:11,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:11,446 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:44:11,446 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 19:44:11,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 19:44:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 19:44:11,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 393. [2020-02-10 19:44:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:44:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1374 transitions. [2020-02-10 19:44:11,457 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1374 transitions. Word has length 22 [2020-02-10 19:44:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:11,457 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1374 transitions. [2020-02-10 19:44:11,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1374 transitions. [2020-02-10 19:44:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:11,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:11,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 19:44:11,458 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 19:44:11,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash -711256758, now seen corresponding path program 53 times [2020-02-10 19:44:11,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:11,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278423633] [2020-02-10 19:44:11,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:11,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 19:44:11,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278423633] [2020-02-10 19:44:11,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:11,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:11,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144046298] [2020-02-10 19:44:11,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:11,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:11,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:11,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:11,778 INFO L87 Difference]: Start difference. First operand 393 states and 1374 transitions. Second operand 9 states. [2020-02-10 19:44:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:11,895 INFO L93 Difference]: Finished difference Result 617 states and 1839 transitions. [2020-02-10 19:44:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:11,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:11,897 INFO L225 Difference]: With dead ends: 617 [2020-02-10 19:44:11,897 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:44:11,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 19:44:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:44:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 395. [2020-02-10 19:44:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:44:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1377 transitions. [2020-02-10 19:44:11,908 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1377 transitions. Word has length 22 [2020-02-10 19:44:11,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:11,908 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1377 transitions. [2020-02-10 19:44:11,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1377 transitions. [2020-02-10 19:44:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:11,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:11,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 19:44:11,909 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 19:44:11,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:11,909 INFO L82 PathProgramCache]: Analyzing trace with hash 630676030, now seen corresponding path program 54 times [2020-02-10 19:44:11,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:11,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255061436] [2020-02-10 19:44:11,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:12,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 19:44:12,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255061436] [2020-02-10 19:44:12,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:12,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:12,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714835918] [2020-02-10 19:44:12,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:12,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:12,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:12,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:12,235 INFO L87 Difference]: Start difference. First operand 395 states and 1377 transitions. Second operand 9 states. [2020-02-10 19:44:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:12,348 INFO L93 Difference]: Finished difference Result 616 states and 1835 transitions. [2020-02-10 19:44:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:12,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:12,350 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:44:12,351 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 19:44:12,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 19:44:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 19:44:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 390. [2020-02-10 19:44:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1367 transitions. [2020-02-10 19:44:12,362 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1367 transitions. Word has length 22 [2020-02-10 19:44:12,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:12,362 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1367 transitions. [2020-02-10 19:44:12,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1367 transitions. [2020-02-10 19:44:12,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:12,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:12,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 19:44:12,363 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 19:44:12,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:12,363 INFO L82 PathProgramCache]: Analyzing trace with hash 138645650, now seen corresponding path program 55 times [2020-02-10 19:44:12,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:12,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615569807] [2020-02-10 19:44:12,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:12,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 19:44:12,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615569807] [2020-02-10 19:44:12,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:12,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:12,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716045706] [2020-02-10 19:44:12,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:12,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:12,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:12,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:12,694 INFO L87 Difference]: Start difference. First operand 390 states and 1367 transitions. Second operand 9 states. [2020-02-10 19:44:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:12,779 INFO L93 Difference]: Finished difference Result 642 states and 1897 transitions. [2020-02-10 19:44:12,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:12,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:12,782 INFO L225 Difference]: With dead ends: 642 [2020-02-10 19:44:12,782 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 19:44:12,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 19:44:12,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 19:44:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 399. [2020-02-10 19:44:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:44:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1389 transitions. [2020-02-10 19:44:12,792 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1389 transitions. Word has length 22 [2020-02-10 19:44:12,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:12,793 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1389 transitions. [2020-02-10 19:44:12,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1389 transitions. [2020-02-10 19:44:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:12,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:12,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 19:44:12,794 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 19:44:12,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:12,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1728911536, now seen corresponding path program 56 times [2020-02-10 19:44:12,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:12,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13854508] [2020-02-10 19:44:12,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:13,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 19:44:13,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13854508] [2020-02-10 19:44:13,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:13,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:13,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902935748] [2020-02-10 19:44:13,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:13,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:13,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:13,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:13,124 INFO L87 Difference]: Start difference. First operand 399 states and 1389 transitions. Second operand 9 states. [2020-02-10 19:44:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:13,236 INFO L93 Difference]: Finished difference Result 637 states and 1884 transitions. [2020-02-10 19:44:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:13,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:13,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:13,238 INFO L225 Difference]: With dead ends: 637 [2020-02-10 19:44:13,239 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 19:44:13,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 19:44:13,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 19:44:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 395. [2020-02-10 19:44:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:44:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1379 transitions. [2020-02-10 19:44:13,249 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1379 transitions. Word has length 22 [2020-02-10 19:44:13,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:13,249 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1379 transitions. [2020-02-10 19:44:13,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:13,249 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1379 transitions. [2020-02-10 19:44:13,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:13,250 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:13,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 19:44:13,250 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 19:44:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:13,251 INFO L82 PathProgramCache]: Analyzing trace with hash 403696514, now seen corresponding path program 57 times [2020-02-10 19:44:13,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:13,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538574235] [2020-02-10 19:44:13,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:13,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538574235] [2020-02-10 19:44:13,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:13,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:13,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442690188] [2020-02-10 19:44:13,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:13,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:13,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:13,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:13,583 INFO L87 Difference]: Start difference. First operand 395 states and 1379 transitions. Second operand 9 states. [2020-02-10 19:44:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:13,676 INFO L93 Difference]: Finished difference Result 649 states and 1909 transitions. [2020-02-10 19:44:13,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:13,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:13,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:13,677 INFO L225 Difference]: With dead ends: 649 [2020-02-10 19:44:13,678 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 19:44: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 19:44:13,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 19:44:13,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 403. [2020-02-10 19:44:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-02-10 19:44:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1392 transitions. [2020-02-10 19:44:13,688 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1392 transitions. Word has length 22 [2020-02-10 19:44:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:13,688 INFO L479 AbstractCegarLoop]: Abstraction has 403 states and 1392 transitions. [2020-02-10 19:44:13,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1392 transitions. [2020-02-10 19:44:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:13,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:13,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 19:44:13,690 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 19:44:13,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:13,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1093875036, now seen corresponding path program 58 times [2020-02-10 19:44:13,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:13,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555288916] [2020-02-10 19:44:13,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:14,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 19:44:14,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555288916] [2020-02-10 19:44:14,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:14,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:14,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446169085] [2020-02-10 19:44:14,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:14,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:14,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:14,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:14,013 INFO L87 Difference]: Start difference. First operand 403 states and 1392 transitions. Second operand 9 states. [2020-02-10 19:44:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:14,124 INFO L93 Difference]: Finished difference Result 647 states and 1899 transitions. [2020-02-10 19:44:14,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:14,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:14,126 INFO L225 Difference]: With dead ends: 647 [2020-02-10 19:44:14,126 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 19:44:14,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 19:44:14,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 19:44:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 395. [2020-02-10 19:44:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:44:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1374 transitions. [2020-02-10 19:44:14,138 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1374 transitions. Word has length 22 [2020-02-10 19:44:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:14,138 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1374 transitions. [2020-02-10 19:44:14,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1374 transitions. [2020-02-10 19:44:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:14,139 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:14,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 19:44:14,140 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 19:44:14,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:14,140 INFO L82 PathProgramCache]: Analyzing trace with hash -811599900, now seen corresponding path program 59 times [2020-02-10 19:44:14,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:14,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275126370] [2020-02-10 19:44:14,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:14,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275126370] [2020-02-10 19:44:14,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:14,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:14,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754081577] [2020-02-10 19:44:14,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:14,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:14,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:14,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:14,455 INFO L87 Difference]: Start difference. First operand 395 states and 1374 transitions. Second operand 9 states. [2020-02-10 19:44:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:14,570 INFO L93 Difference]: Finished difference Result 634 states and 1874 transitions. [2020-02-10 19:44:14,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:14,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:14,572 INFO L225 Difference]: With dead ends: 634 [2020-02-10 19:44:14,572 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 19:44:14,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 19:44:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 19:44:14,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 398. [2020-02-10 19:44:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:44:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1379 transitions. [2020-02-10 19:44:14,585 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1379 transitions. Word has length 22 [2020-02-10 19:44:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:14,585 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1379 transitions. [2020-02-10 19:44:14,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1379 transitions. [2020-02-10 19:44:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:14,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:14,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 19:44:14,587 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 19:44:14,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:14,587 INFO L82 PathProgramCache]: Analyzing trace with hash -793165874, now seen corresponding path program 60 times [2020-02-10 19:44:14,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:14,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925972287] [2020-02-10 19:44:14,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:14,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 19:44:14,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925972287] [2020-02-10 19:44:14,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:14,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:14,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456094280] [2020-02-10 19:44:14,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:14,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:14,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:14,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:14,896 INFO L87 Difference]: Start difference. First operand 398 states and 1379 transitions. Second operand 9 states. [2020-02-10 19:44:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:15,020 INFO L93 Difference]: Finished difference Result 637 states and 1877 transitions. [2020-02-10 19:44:15,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:15,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:15,022 INFO L225 Difference]: With dead ends: 637 [2020-02-10 19:44:15,022 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 19:44:15,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 19:44:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 19:44:15,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 390. [2020-02-10 19:44:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1363 transitions. [2020-02-10 19:44:15,033 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1363 transitions. Word has length 22 [2020-02-10 19:44:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:15,033 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1363 transitions. [2020-02-10 19:44:15,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1363 transitions. [2020-02-10 19:44:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:15,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44: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 19:44:15,034 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 19:44:15,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:15,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1075532706, now seen corresponding path program 61 times [2020-02-10 19:44:15,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:15,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628840993] [2020-02-10 19:44:15,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:15,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 19:44:15,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628840993] [2020-02-10 19:44:15,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:15,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:15,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351266596] [2020-02-10 19:44:15,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:15,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:15,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:15,353 INFO L87 Difference]: Start difference. First operand 390 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:44:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:15,465 INFO L93 Difference]: Finished difference Result 636 states and 1876 transitions. [2020-02-10 19:44:15,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:15,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:15,467 INFO L225 Difference]: With dead ends: 636 [2020-02-10 19:44:15,467 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 19:44:15,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 19:44:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 19:44:15,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 397. [2020-02-10 19:44:15,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:44:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1379 transitions. [2020-02-10 19:44:15,478 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1379 transitions. Word has length 22 [2020-02-10 19:44:15,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:15,478 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1379 transitions. [2020-02-10 19:44:15,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1379 transitions. [2020-02-10 19:44:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:15,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:15,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 19:44:15,479 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 19:44:15,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:15,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1202169080, now seen corresponding path program 62 times [2020-02-10 19:44:15,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:15,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665516428] [2020-02-10 19:44:15,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:15,875 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2020-02-10 19:44:16,064 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 24 [2020-02-10 19:44:16,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 19:44:16,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665516428] [2020-02-10 19:44:16,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:16,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:16,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740612998] [2020-02-10 19:44:16,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:16,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:16,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:16,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:16,072 INFO L87 Difference]: Start difference. First operand 397 states and 1379 transitions. Second operand 9 states. [2020-02-10 19:44:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:16,185 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2020-02-10 19:44:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:16,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:16,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:16,187 INFO L225 Difference]: With dead ends: 630 [2020-02-10 19:44:16,187 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:44:16,187 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:44:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 394. [2020-02-10 19:44:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:44:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1372 transitions. [2020-02-10 19:44:16,198 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1372 transitions. Word has length 22 [2020-02-10 19:44:16,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:16,199 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1372 transitions. [2020-02-10 19:44:16,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1372 transitions. [2020-02-10 19:44:16,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:16,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:16,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 19:44:16,200 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 19:44:16,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:16,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1611119408, now seen corresponding path program 63 times [2020-02-10 19:44:16,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:16,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159775943] [2020-02-10 19:44:16,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:16,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 19:44:16,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159775943] [2020-02-10 19:44:16,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:16,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:16,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345782004] [2020-02-10 19:44:16,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:16,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:16,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:16,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:16,537 INFO L87 Difference]: Start difference. First operand 394 states and 1372 transitions. Second operand 9 states. [2020-02-10 19:44:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:16,638 INFO L93 Difference]: Finished difference Result 645 states and 1894 transitions. [2020-02-10 19:44:16,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:16,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:16,640 INFO L225 Difference]: With dead ends: 645 [2020-02-10 19:44:16,640 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 19:44:16,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 19:44:16,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 19:44:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 402. [2020-02-10 19:44:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 19:44:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1385 transitions. [2020-02-10 19:44:16,650 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1385 transitions. Word has length 22 [2020-02-10 19:44:16,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:16,651 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1385 transitions. [2020-02-10 19:44:16,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1385 transitions. [2020-02-10 19:44:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:16,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:16,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 19:44:16,652 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 19:44:16,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:16,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2034402296, now seen corresponding path program 64 times [2020-02-10 19:44:16,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:16,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066379362] [2020-02-10 19:44:16,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:16,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066379362] [2020-02-10 19:44:16,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:16,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:16,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604052522] [2020-02-10 19:44:16,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:16,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:16,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:16,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:16,980 INFO L87 Difference]: Start difference. First operand 402 states and 1385 transitions. Second operand 9 states. [2020-02-10 19:44:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:17,093 INFO L93 Difference]: Finished difference Result 643 states and 1884 transitions. [2020-02-10 19:44:17,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:17,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:17,096 INFO L225 Difference]: With dead ends: 643 [2020-02-10 19:44:17,096 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 19:44:17,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 19:44:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 19:44:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 394. [2020-02-10 19:44:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:44:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1368 transitions. [2020-02-10 19:44:17,108 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1368 transitions. Word has length 22 [2020-02-10 19:44:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:17,108 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1368 transitions. [2020-02-10 19:44:17,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1368 transitions. [2020-02-10 19:44:17,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:17,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:17,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 19:44:17,110 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 19:44:17,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:17,110 INFO L82 PathProgramCache]: Analyzing trace with hash 664313502, now seen corresponding path program 65 times [2020-02-10 19:44:17,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:17,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519557936] [2020-02-10 19:44:17,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:17,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:17,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519557936] [2020-02-10 19:44:17,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:17,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:17,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582990449] [2020-02-10 19:44:17,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:17,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:17,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:17,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:17,460 INFO L87 Difference]: Start difference. First operand 394 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:44:17,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:17,571 INFO L93 Difference]: Finished difference Result 627 states and 1853 transitions. [2020-02-10 19:44:17,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:17,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:17,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:17,573 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:44:17,573 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:44:17,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 19:44:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:44:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 396. [2020-02-10 19:44:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:44:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1371 transitions. [2020-02-10 19:44:17,583 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1371 transitions. Word has length 22 [2020-02-10 19:44:17,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:17,583 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1371 transitions. [2020-02-10 19:44:17,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1371 transitions. [2020-02-10 19:44:17,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:17,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:17,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 19:44:17,584 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 19:44:17,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:17,585 INFO L82 PathProgramCache]: Analyzing trace with hash -253636688, now seen corresponding path program 66 times [2020-02-10 19:44:17,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:17,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395574992] [2020-02-10 19:44:17,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:17,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 19:44:17,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395574992] [2020-02-10 19:44:17,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:17,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:17,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582894734] [2020-02-10 19:44:17,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:17,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:17,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:17,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:17,876 INFO L87 Difference]: Start difference. First operand 396 states and 1371 transitions. Second operand 9 states. [2020-02-10 19:44:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:17,992 INFO L93 Difference]: Finished difference Result 631 states and 1859 transitions. [2020-02-10 19:44:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:17,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:17,995 INFO L225 Difference]: With dead ends: 631 [2020-02-10 19:44:17,995 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 19:44:17,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 19:44:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 390. [2020-02-10 19:44:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1359 transitions. [2020-02-10 19:44:18,006 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1359 transitions. Word has length 22 [2020-02-10 19:44:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:18,006 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1359 transitions. [2020-02-10 19:44:18,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1359 transitions. [2020-02-10 19:44:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:18,007 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:18,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 19:44:18,007 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 19:44:18,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:18,007 INFO L82 PathProgramCache]: Analyzing trace with hash -118757500, now seen corresponding path program 67 times [2020-02-10 19:44:18,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:18,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614689752] [2020-02-10 19:44:18,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:18,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 19:44:18,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614689752] [2020-02-10 19:44:18,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:18,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:18,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324155447] [2020-02-10 19:44:18,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:18,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:18,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:18,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:18,313 INFO L87 Difference]: Start difference. First operand 390 states and 1359 transitions. Second operand 9 states. [2020-02-10 19:44:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:18,428 INFO L93 Difference]: Finished difference Result 612 states and 1824 transitions. [2020-02-10 19:44:18,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:18,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:18,430 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:44:18,430 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 19:44:18,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 19:44:18,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 19:44:18,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 394. [2020-02-10 19:44:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:44:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1369 transitions. [2020-02-10 19:44:18,441 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1369 transitions. Word has length 22 [2020-02-10 19:44:18,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:18,441 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1369 transitions. [2020-02-10 19:44:18,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1369 transitions. [2020-02-10 19:44:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:18,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:18,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 19:44:18,442 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 19:44:18,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:18,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1223175288, now seen corresponding path program 68 times [2020-02-10 19:44:18,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:18,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961849147] [2020-02-10 19:44:18,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:18,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 19:44:18,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961849147] [2020-02-10 19:44:18,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:18,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:18,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657997171] [2020-02-10 19:44:18,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:18,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:18,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:18,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:18,758 INFO L87 Difference]: Start difference. First operand 394 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:44:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:18,871 INFO L93 Difference]: Finished difference Result 611 states and 1820 transitions. [2020-02-10 19:44:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:18,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:18,873 INFO L225 Difference]: With dead ends: 611 [2020-02-10 19:44:18,874 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:44:18,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 19:44:18,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:44:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 392. [2020-02-10 19:44:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:44:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-02-10 19:44:18,885 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-02-10 19:44:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:18,885 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-02-10 19:44:18,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-02-10 19:44:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:18,886 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:18,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 19:44:18,886 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 19:44:18,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:18,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1489557682, now seen corresponding path program 69 times [2020-02-10 19:44:18,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:18,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728377724] [2020-02-10 19:44:18,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:19,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 19:44:19,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728377724] [2020-02-10 19:44:19,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:19,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:19,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900903387] [2020-02-10 19:44:19,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:19,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:19,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:19,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:19,203 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:44:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:19,317 INFO L93 Difference]: Finished difference Result 617 states and 1833 transitions. [2020-02-10 19:44:19,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:19,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:19,319 INFO L225 Difference]: With dead ends: 617 [2020-02-10 19:44:19,319 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:44:19,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:44:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 395. [2020-02-10 19:44:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:44:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1369 transitions. [2020-02-10 19:44:19,329 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1369 transitions. Word has length 22 [2020-02-10 19:44:19,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:19,329 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1369 transitions. [2020-02-10 19:44:19,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1369 transitions. [2020-02-10 19:44:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:19,330 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:19,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 19:44:19,330 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 19:44:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:19,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1938849630, now seen corresponding path program 70 times [2020-02-10 19:44:19,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:19,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124247193] [2020-02-10 19:44:19,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:19,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 19:44:19,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124247193] [2020-02-10 19:44:19,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:19,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:19,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905167070] [2020-02-10 19:44:19,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:19,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:19,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:19,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:19,648 INFO L87 Difference]: Start difference. First operand 395 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:44:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:19,768 INFO L93 Difference]: Finished difference Result 620 states and 1836 transitions. [2020-02-10 19:44:19,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:19,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:19,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:19,770 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:44:19,770 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 19:44:19,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 19:44:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 19:44:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 392. [2020-02-10 19:44:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:44:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-02-10 19:44:19,780 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-02-10 19:44:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:19,781 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-02-10 19:44:19,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-02-10 19:44:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:19,781 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:19,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 19:44:19,782 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 19:44:19,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:19,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1758405090, now seen corresponding path program 71 times [2020-02-10 19:44:19,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:19,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073346126] [2020-02-10 19:44:19,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:20,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 19:44:20,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073346126] [2020-02-10 19:44:20,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:20,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:20,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283350582] [2020-02-10 19:44:20,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:20,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:20,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:20,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:20,086 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:44:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:20,195 INFO L93 Difference]: Finished difference Result 614 states and 1824 transitions. [2020-02-10 19:44:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:20,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:20,197 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:44:20,197 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 19:44:20,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 19:44:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 19:44:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 394. [2020-02-10 19:44:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:44:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1365 transitions. [2020-02-10 19:44:20,208 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1365 transitions. Word has length 22 [2020-02-10 19:44:20,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:20,208 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1365 transitions. [2020-02-10 19:44:20,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1365 transitions. [2020-02-10 19:44:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:20,209 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:20,209 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:20,209 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 19:44:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash 840454900, now seen corresponding path program 72 times [2020-02-10 19:44:20,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:20,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838934653] [2020-02-10 19:44:20,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:20,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 19:44:20,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838934653] [2020-02-10 19:44:20,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:20,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:20,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484232796] [2020-02-10 19:44:20,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:20,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:20,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:20,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:20,505 INFO L87 Difference]: Start difference. First operand 394 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:44:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:20,632 INFO L93 Difference]: Finished difference Result 618 states and 1830 transitions. [2020-02-10 19:44:20,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:20,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:20,634 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:44:20,634 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:44:20,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 19:44:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:44:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 386. [2020-02-10 19:44:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:44:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1351 transitions. [2020-02-10 19:44:20,644 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1351 transitions. Word has length 22 [2020-02-10 19:44:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:20,644 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1351 transitions. [2020-02-10 19:44:20,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1351 transitions. [2020-02-10 19:44:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:20,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:20,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 19:44:20,645 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 19:44:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:20,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1531024386, now seen corresponding path program 73 times [2020-02-10 19:44:20,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:20,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446036447] [2020-02-10 19:44:20,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:20,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 19:44:20,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446036447] [2020-02-10 19:44:20,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:20,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:20,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877305730] [2020-02-10 19:44:20,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:20,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:20,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:20,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:20,955 INFO L87 Difference]: Start difference. First operand 386 states and 1351 transitions. Second operand 9 states. [2020-02-10 19:44:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:21,037 INFO L93 Difference]: Finished difference Result 608 states and 1800 transitions. [2020-02-10 19:44:21,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:21,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:21,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:21,039 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:44:21,040 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:44:21,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 19:44:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:44:21,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 393. [2020-02-10 19:44:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:44:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1370 transitions. [2020-02-10 19:44:21,049 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1370 transitions. Word has length 22 [2020-02-10 19:44:21,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:21,049 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1370 transitions. [2020-02-10 19:44:21,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:21,049 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1370 transitions. [2020-02-10 19:44:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:21,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:21,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 19:44:21,050 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 19:44:21,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:21,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2092092878, now seen corresponding path program 74 times [2020-02-10 19:44:21,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:21,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995412333] [2020-02-10 19:44:21,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:21,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 19:44:21,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995412333] [2020-02-10 19:44:21,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:21,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:21,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542932413] [2020-02-10 19:44:21,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:21,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:21,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:21,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:21,370 INFO L87 Difference]: Start difference. First operand 393 states and 1370 transitions. Second operand 9 states. [2020-02-10 19:44:21,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:21,455 INFO L93 Difference]: Finished difference Result 601 states and 1785 transitions. [2020-02-10 19:44:21,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:21,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:21,457 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:44:21,457 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:44:21,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 19:44:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:44:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 391. [2020-02-10 19:44:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:21,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-02-10 19:44:21,467 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-02-10 19:44:21,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:21,468 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-02-10 19:44:21,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:21,468 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-02-10 19:44:21,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:21,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:21,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 19:44:21,469 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 19:44:21,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:21,469 INFO L82 PathProgramCache]: Analyzing trace with hash -69413468, now seen corresponding path program 75 times [2020-02-10 19:44:21,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:21,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240717890] [2020-02-10 19:44:21,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:21,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 19:44:21,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240717890] [2020-02-10 19:44:21,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:21,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:21,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628090711] [2020-02-10 19:44:21,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:21,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:21,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:21,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:21,796 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:44:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:21,884 INFO L93 Difference]: Finished difference Result 610 states and 1803 transitions. [2020-02-10 19:44:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:21,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:21,886 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:44:21,886 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:44:21,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:21,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:44:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 394. [2020-02-10 19:44:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:44:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1370 transitions. [2020-02-10 19:44:21,899 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1370 transitions. Word has length 22 [2020-02-10 19:44:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:21,899 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1370 transitions. [2020-02-10 19:44:21,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1370 transitions. [2020-02-10 19:44:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:21,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:21,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 19:44:21,900 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 19:44:21,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:21,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1031617130, now seen corresponding path program 76 times [2020-02-10 19:44:21,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:21,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701378955] [2020-02-10 19:44:21,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:22,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 19:44:22,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701378955] [2020-02-10 19:44:22,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:22,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:22,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134603180] [2020-02-10 19:44:22,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:22,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:22,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:22,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:22,233 INFO L87 Difference]: Start difference. First operand 394 states and 1370 transitions. Second operand 9 states. [2020-02-10 19:44:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:22,343 INFO L93 Difference]: Finished difference Result 604 states and 1789 transitions. [2020-02-10 19:44:22,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:22,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:22,345 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:44:22,345 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:44:22,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 19:44:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:44:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 391. [2020-02-10 19:44:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-02-10 19:44:22,356 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-02-10 19:44:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:22,356 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-02-10 19:44:22,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-02-10 19:44:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:22,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:22,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 19:44:22,357 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 19:44:22,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:22,357 INFO L82 PathProgramCache]: Analyzing trace with hash -14691242, now seen corresponding path program 77 times [2020-02-10 19:44:22,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:22,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077683374] [2020-02-10 19:44:22,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:22,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077683374] [2020-02-10 19:44:22,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:22,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:22,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53141196] [2020-02-10 19:44:22,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:22,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:22,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:22,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:22,680 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:44:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:22,784 INFO L93 Difference]: Finished difference Result 594 states and 1770 transitions. [2020-02-10 19:44:22,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:22,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:22,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:22,787 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:44:22,787 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:44:22,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 19:44:22,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:44:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 392. [2020-02-10 19:44:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:44:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1365 transitions. [2020-02-10 19:44:22,807 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1365 transitions. Word has length 22 [2020-02-10 19:44:22,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:22,807 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1365 transitions. [2020-02-10 19:44:22,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1365 transitions. [2020-02-10 19:44:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:22,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:22,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 19:44:22,813 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 19:44:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1596249716, now seen corresponding path program 78 times [2020-02-10 19:44:22,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:22,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54554337] [2020-02-10 19:44:22,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:23,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 19:44:23,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54554337] [2020-02-10 19:44:23,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:23,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:23,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176100772] [2020-02-10 19:44:23,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:23,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:23,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:23,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:23,165 INFO L87 Difference]: Start difference. First operand 392 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:44:23,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:23,277 INFO L93 Difference]: Finished difference Result 595 states and 1771 transitions. [2020-02-10 19:44:23,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:23,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:23,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:23,279 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:44:23,279 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:44:23,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 19:44:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:44:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 389. [2020-02-10 19:44:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-02-10 19:44:23,290 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-02-10 19:44:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:23,290 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-02-10 19:44:23,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-02-10 19:44:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:23,291 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:23,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 19:44:23,292 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 19:44:23,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:23,292 INFO L82 PathProgramCache]: Analyzing trace with hash 933687728, now seen corresponding path program 79 times [2020-02-10 19:44:23,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:23,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085532614] [2020-02-10 19:44:23,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:23,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 19:44:23,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085532614] [2020-02-10 19:44:23,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:23,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:23,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229805284] [2020-02-10 19:44:23,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:23,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:23,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:23,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:23,602 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:44:23,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:23,684 INFO L93 Difference]: Finished difference Result 618 states and 1821 transitions. [2020-02-10 19:44:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:23,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:23,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:23,686 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:44:23,686 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:44:23,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 19:44:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:44:23,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 394. [2020-02-10 19:44:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:44:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1370 transitions. [2020-02-10 19:44:23,697 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1370 transitions. Word has length 22 [2020-02-10 19:44:23,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:23,698 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1370 transitions. [2020-02-10 19:44:23,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:23,698 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1370 transitions. [2020-02-10 19:44:23,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:23,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:23,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 19:44:23,699 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 19:44:23,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:23,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1494756220, now seen corresponding path program 80 times [2020-02-10 19:44:23,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:23,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233017777] [2020-02-10 19:44:23,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:23,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 19:44:23,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233017777] [2020-02-10 19:44:23,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:23,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:23,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140956287] [2020-02-10 19:44:23,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:23,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:23,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:23,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:23,994 INFO L87 Difference]: Start difference. First operand 394 states and 1370 transitions. Second operand 9 states. [2020-02-10 19:44:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:24,079 INFO L93 Difference]: Finished difference Result 611 states and 1806 transitions. [2020-02-10 19:44:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:24,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:24,081 INFO L225 Difference]: With dead ends: 611 [2020-02-10 19:44:24,081 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:44:24,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 19:44:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:44:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 392. [2020-02-10 19:44:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:44:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1366 transitions. [2020-02-10 19:44:24,092 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1366 transitions. Word has length 22 [2020-02-10 19:44:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:24,092 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1366 transitions. [2020-02-10 19:44:24,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1366 transitions. [2020-02-10 19:44:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:24,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:24,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 19:44:24,094 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 19:44:24,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:24,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1946380260, now seen corresponding path program 81 times [2020-02-10 19:44:24,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:24,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981695198] [2020-02-10 19:44:24,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:24,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 19:44:24,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981695198] [2020-02-10 19:44:24,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:24,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:24,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762452133] [2020-02-10 19:44:24,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:24,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:24,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:24,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:24,398 INFO L87 Difference]: Start difference. First operand 392 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:44:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:24,478 INFO L93 Difference]: Finished difference Result 629 states and 1845 transitions. [2020-02-10 19:44:24,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:24,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:24,480 INFO L225 Difference]: With dead ends: 629 [2020-02-10 19:44:24,480 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 19:44:24,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 19:44:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 19:44:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 400. [2020-02-10 19:44:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 19:44:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1379 transitions. [2020-02-10 19:44:24,492 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1379 transitions. Word has length 22 [2020-02-10 19:44:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:24,492 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1379 transitions. [2020-02-10 19:44:24,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1379 transitions. [2020-02-10 19:44:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:24,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:24,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 19:44:24,493 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 19:44:24,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:24,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1816409814, now seen corresponding path program 82 times [2020-02-10 19:44:24,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:24,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734045934] [2020-02-10 19:44:24,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:24,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 19:44:24,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734045934] [2020-02-10 19:44:24,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:24,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:24,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807501894] [2020-02-10 19:44:24,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:24,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:24,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:24,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:24,804 INFO L87 Difference]: Start difference. First operand 400 states and 1379 transitions. Second operand 9 states. [2020-02-10 19:44:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:24,912 INFO L93 Difference]: Finished difference Result 627 states and 1835 transitions. [2020-02-10 19:44:24,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:24,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:24,914 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:44:24,914 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 19:44:24,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:24,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 19:44:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 392. [2020-02-10 19:44:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:44:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1363 transitions. [2020-02-10 19:44:24,924 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1363 transitions. Word has length 22 [2020-02-10 19:44:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:24,924 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1363 transitions. [2020-02-10 19:44:24,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1363 transitions. [2020-02-10 19:44:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:24,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:24,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 19:44:24,925 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 19:44:24,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:24,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2001102486, now seen corresponding path program 83 times [2020-02-10 19:44:24,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:24,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33742781] [2020-02-10 19:44:24,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:25,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 19:44:25,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33742781] [2020-02-10 19:44:25,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:25,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:25,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837013258] [2020-02-10 19:44:25,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:25,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:25,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:25,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:25,221 INFO L87 Difference]: Start difference. First operand 392 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:44:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:25,305 INFO L93 Difference]: Finished difference Result 608 states and 1798 transitions. [2020-02-10 19:44:25,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:25,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:25,306 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:44:25,307 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:44:25,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 19:44:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:44:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 393. [2020-02-10 19:44:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:44:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1364 transitions. [2020-02-10 19:44:25,319 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1364 transitions. Word has length 22 [2020-02-10 19:44:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:25,319 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1364 transitions. [2020-02-10 19:44:25,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1364 transitions. [2020-02-10 19:44:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:25,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:25,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 19:44:25,320 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 19:44:25,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:25,321 INFO L82 PathProgramCache]: Analyzing trace with hash 925391330, now seen corresponding path program 84 times [2020-02-10 19:44:25,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:25,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279771198] [2020-02-10 19:44:25,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:25,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279771198] [2020-02-10 19:44:25,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:25,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:25,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277939892] [2020-02-10 19:44:25,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:25,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:25,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:25,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:25,631 INFO L87 Difference]: Start difference. First operand 393 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:44:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:25,760 INFO L93 Difference]: Finished difference Result 613 states and 1807 transitions. [2020-02-10 19:44:25,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:25,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:25,762 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:44:25,762 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 19:44:25,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 19:44:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 389. [2020-02-10 19:44:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1357 transitions. [2020-02-10 19:44:25,772 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1357 transitions. Word has length 22 [2020-02-10 19:44:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:25,773 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1357 transitions. [2020-02-10 19:44:25,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1357 transitions. [2020-02-10 19:44:25,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:25,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:25,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 19:44:25,774 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 19:44:25,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1259283952, now seen corresponding path program 85 times [2020-02-10 19:44:25,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:25,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260091466] [2020-02-10 19:44:25,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:26,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 19:44:26,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260091466] [2020-02-10 19:44:26,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:26,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:26,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761046868] [2020-02-10 19:44:26,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:26,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:26,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:26,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:26,075 INFO L87 Difference]: Start difference. First operand 389 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:44:26,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:26,179 INFO L93 Difference]: Finished difference Result 624 states and 1835 transitions. [2020-02-10 19:44:26,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:26,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:26,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:26,181 INFO L225 Difference]: With dead ends: 624 [2020-02-10 19:44:26,181 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 19:44:26,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 19:44:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 19:44:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 396. [2020-02-10 19:44:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:44:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1373 transitions. [2020-02-10 19:44:26,192 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1373 transitions. Word has length 22 [2020-02-10 19:44:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:26,192 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1373 transitions. [2020-02-10 19:44:26,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1373 transitions. [2020-02-10 19:44:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:26,193 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:26,193 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:26,193 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 19:44:26,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:26,193 INFO L82 PathProgramCache]: Analyzing trace with hash 297080290, now seen corresponding path program 86 times [2020-02-10 19:44:26,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:26,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89421562] [2020-02-10 19:44:26,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:26,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 19:44:26,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89421562] [2020-02-10 19:44:26,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:26,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:26,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951372012] [2020-02-10 19:44:26,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:26,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:26,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:26,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:26,497 INFO L87 Difference]: Start difference. First operand 396 states and 1373 transitions. Second operand 9 states. [2020-02-10 19:44:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:26,600 INFO L93 Difference]: Finished difference Result 618 states and 1821 transitions. [2020-02-10 19:44:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:26,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:26,602 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:44:26,602 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 19:44:26,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:26,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 19:44:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 393. [2020-02-10 19:44:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:44:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-02-10 19:44:26,613 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-02-10 19:44:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:26,613 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-02-10 19:44:26,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-02-10 19:44:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:26,614 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:26,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 19:44:26,614 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 19:44:26,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:26,615 INFO L82 PathProgramCache]: Analyzing trace with hash -422552958, now seen corresponding path program 87 times [2020-02-10 19:44:26,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:26,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549588929] [2020-02-10 19:44:26,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:26,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 19:44:26,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549588929] [2020-02-10 19:44:26,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:26,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:26,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759018138] [2020-02-10 19:44:26,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:26,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:26,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:26,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:26,926 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:44:27,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:27,033 INFO L93 Difference]: Finished difference Result 633 states and 1853 transitions. [2020-02-10 19:44:27,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:27,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:27,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:27,035 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:44:27,035 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:44:27,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 19:44:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:44:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 401. [2020-02-10 19:44:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 19:44:27,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1379 transitions. [2020-02-10 19:44:27,046 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1379 transitions. Word has length 22 [2020-02-10 19:44:27,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:27,047 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1379 transitions. [2020-02-10 19:44:27,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1379 transitions. [2020-02-10 19:44:27,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:27,047 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:27,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 19:44:27,048 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 19:44:27,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:27,048 INFO L82 PathProgramCache]: Analyzing trace with hash -552523404, now seen corresponding path program 88 times [2020-02-10 19:44:27,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:27,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370307784] [2020-02-10 19:44:27,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:27,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 19:44:27,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370307784] [2020-02-10 19:44:27,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:27,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:27,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867911687] [2020-02-10 19:44:27,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:27,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:27,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:27,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:27,376 INFO L87 Difference]: Start difference. First operand 401 states and 1379 transitions. Second operand 9 states. [2020-02-10 19:44:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:27,509 INFO L93 Difference]: Finished difference Result 631 states and 1843 transitions. [2020-02-10 19:44:27,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:27,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:27,512 INFO L225 Difference]: With dead ends: 631 [2020-02-10 19:44:27,512 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 19:44:27,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 19:44:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 19:44:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 393. [2020-02-10 19:44:27,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:44:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-02-10 19:44:27,523 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-02-10 19:44:27,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:27,524 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-02-10 19:44:27,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-02-10 19:44:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:27,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:27,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 19:44:27,525 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 19:44:27,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:27,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1316914946, now seen corresponding path program 89 times [2020-02-10 19:44:27,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:27,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842822599] [2020-02-10 19:44:27,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:27,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 19:44:27,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842822599] [2020-02-10 19:44:27,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:27,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:27,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972284012] [2020-02-10 19:44:27,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:27,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:27,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:27,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:27,813 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:44:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:27,925 INFO L93 Difference]: Finished difference Result 615 states and 1812 transitions. [2020-02-10 19:44:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:27,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:27,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:27,927 INFO L225 Difference]: With dead ends: 615 [2020-02-10 19:44:27,928 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 19:44:27,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 19:44:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 395. [2020-02-10 19:44:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:44:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1365 transitions. [2020-02-10 19:44:27,938 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1365 transitions. Word has length 22 [2020-02-10 19:44:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:27,938 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1365 transitions. [2020-02-10 19:44:27,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1365 transitions. [2020-02-10 19:44:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:27,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:27,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 19:44:27,939 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 19:44:27,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:27,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2060102160, now seen corresponding path program 90 times [2020-02-10 19:44:27,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:27,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815962403] [2020-02-10 19:44:27,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:28,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 19:44:28,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815962403] [2020-02-10 19:44:28,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:28,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:28,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117664324] [2020-02-10 19:44:28,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:28,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:28,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:28,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:28,227 INFO L87 Difference]: Start difference. First operand 395 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:44:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:28,348 INFO L93 Difference]: Finished difference Result 619 states and 1818 transitions. [2020-02-10 19:44:28,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:28,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:28,350 INFO L225 Difference]: With dead ends: 619 [2020-02-10 19:44:28,350 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:44:28,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 19:44:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:44:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 389. [2020-02-10 19:44:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1354 transitions. [2020-02-10 19:44:28,361 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1354 transitions. Word has length 22 [2020-02-10 19:44:28,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:28,361 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1354 transitions. [2020-02-10 19:44:28,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:28,361 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1354 transitions. [2020-02-10 19:44:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:28,362 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:28,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 19:44:28,362 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 19:44:28,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:28,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1497826180, now seen corresponding path program 91 times [2020-02-10 19:44:28,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:28,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038914532] [2020-02-10 19:44:28,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:28,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 19:44:28,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038914532] [2020-02-10 19:44:28,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:28,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:28,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876195110] [2020-02-10 19:44:28,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:28,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:28,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:28,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:28,670 INFO L87 Difference]: Start difference. First operand 389 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:44:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:28,759 INFO L93 Difference]: Finished difference Result 589 states and 1756 transitions. [2020-02-10 19:44:28,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:28,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:28,761 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:44:28,761 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:44:28,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:28,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:44:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 391. [2020-02-10 19:44:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-02-10 19:44:28,774 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-02-10 19:44:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:28,775 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-02-10 19:44:28,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-02-10 19:44:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:28,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:28,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 19:44:28,776 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 19:44:28,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:28,776 INFO L82 PathProgramCache]: Analyzing trace with hash 113114778, now seen corresponding path program 92 times [2020-02-10 19:44:28,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:28,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65350234] [2020-02-10 19:44:28,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:29,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 19:44:29,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65350234] [2020-02-10 19:44:29,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:29,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:29,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087580038] [2020-02-10 19:44:29,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:29,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:29,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:29,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:29,108 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:44:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:29,233 INFO L93 Difference]: Finished difference Result 590 states and 1757 transitions. [2020-02-10 19:44:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:29,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:29,236 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:44:29,236 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:44:29,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 19:44:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:44:29,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 390. [2020-02-10 19:44:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1356 transitions. [2020-02-10 19:44:29,246 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1356 transitions. Word has length 22 [2020-02-10 19:44:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:29,247 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1356 transitions. [2020-02-10 19:44:29,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1356 transitions. [2020-02-10 19:44:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:29,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:29,248 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:29,248 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 19:44:29,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:29,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1115304206, now seen corresponding path program 93 times [2020-02-10 19:44:29,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:29,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990265552] [2020-02-10 19:44:29,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:29,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 19:44:29,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990265552] [2020-02-10 19:44:29,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:29,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:29,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232183886] [2020-02-10 19:44:29,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:29,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:29,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:29,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:29,542 INFO L87 Difference]: Start difference. First operand 390 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:44:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:29,635 INFO L93 Difference]: Finished difference Result 593 states and 1763 transitions. [2020-02-10 19:44:29,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:29,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:29,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:29,637 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:44:29,637 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:44:29,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 19:44:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:44:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 391. [2020-02-10 19:44:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1357 transitions. [2020-02-10 19:44:29,648 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1357 transitions. Word has length 22 [2020-02-10 19:44:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:29,648 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1357 transitions. [2020-02-10 19:44:29,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1357 transitions. [2020-02-10 19:44:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:29,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:29,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 19:44:29,649 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 19:44:29,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:29,649 INFO L82 PathProgramCache]: Analyzing trace with hash 39593050, now seen corresponding path program 94 times [2020-02-10 19:44:29,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:29,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744763878] [2020-02-10 19:44:29,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44: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 19:44:29,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744763878] [2020-02-10 19:44:29,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:29,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:29,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480049892] [2020-02-10 19:44:29,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:29,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:29,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:29,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:29,969 INFO L87 Difference]: Start difference. First operand 391 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:44:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:30,092 INFO L93 Difference]: Finished difference Result 598 states and 1772 transitions. [2020-02-10 19:44:30,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:30,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:30,094 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:44:30,094 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:44:30,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 19:44:30,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:44:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 390. [2020-02-10 19:44:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1355 transitions. [2020-02-10 19:44:30,103 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1355 transitions. Word has length 22 [2020-02-10 19:44:30,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:30,103 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1355 transitions. [2020-02-10 19:44:30,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1355 transitions. [2020-02-10 19:44:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:30,104 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:30,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 19:44:30,105 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 19:44:30,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:30,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1125807310, now seen corresponding path program 95 times [2020-02-10 19:44:30,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:30,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466943016] [2020-02-10 19:44:30,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:30,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 19:44:30,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466943016] [2020-02-10 19:44:30,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:30,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:30,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834037896] [2020-02-10 19:44:30,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:30,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:30,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:30,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:30,414 INFO L87 Difference]: Start difference. First operand 390 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:44:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:30,541 INFO L93 Difference]: Finished difference Result 596 states and 1769 transitions. [2020-02-10 19:44:30,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:30,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:30,543 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:44:30,544 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:44:30,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 19:44:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:44:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 392. [2020-02-10 19:44:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:44:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1358 transitions. [2020-02-10 19:44:30,555 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1358 transitions. Word has length 22 [2020-02-10 19:44:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:30,556 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1358 transitions. [2020-02-10 19:44:30,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1358 transitions. [2020-02-10 19:44:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:30,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:30,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 19:44:30,557 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 19:44:30,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:30,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1560844804, now seen corresponding path program 96 times [2020-02-10 19:44:30,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:30,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207196597] [2020-02-10 19:44:30,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:30,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 19:44:30,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207196597] [2020-02-10 19:44:30,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:30,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:30,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31989352] [2020-02-10 19:44:30,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:30,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:30,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:30,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:30,840 INFO L87 Difference]: Start difference. First operand 392 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:44:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:30,955 INFO L93 Difference]: Finished difference Result 600 states and 1775 transitions. [2020-02-10 19:44:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:30,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:30,957 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:44:30,958 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:44:30,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 19:44:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:44:30,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 386. [2020-02-10 19:44:30,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:44:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1348 transitions. [2020-02-10 19:44:30,968 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1348 transitions. Word has length 22 [2020-02-10 19:44:30,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:30,968 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1348 transitions. [2020-02-10 19:44:30,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1348 transitions. [2020-02-10 19:44:30,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:30,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:30,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:30,969 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 19:44:30,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:30,970 INFO L82 PathProgramCache]: Analyzing trace with hash -951136412, now seen corresponding path program 97 times [2020-02-10 19:44:30,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:30,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005233909] [2020-02-10 19:44:30,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:31,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 19:44:31,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005233909] [2020-02-10 19:44:31,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:31,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:31,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287958553] [2020-02-10 19:44:31,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:31,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:31,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:31,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:31,305 INFO L87 Difference]: Start difference. First operand 386 states and 1348 transitions. Second operand 9 states. [2020-02-10 19:44:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:31,422 INFO L93 Difference]: Finished difference Result 570 states and 1716 transitions. [2020-02-10 19:44:31,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:31,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:31,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:31,424 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:44:31,424 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:44:31,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 19:44:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:44:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 389. [2020-02-10 19:44:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-02-10 19:44:31,437 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-02-10 19:44:31,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:31,437 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-02-10 19:44:31,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-02-10 19:44:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:31,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:31,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 19:44:31,438 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 19:44:31,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:31,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1898313874, now seen corresponding path program 98 times [2020-02-10 19:44:31,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:31,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833506961] [2020-02-10 19:44:31,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:31,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 19:44:31,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833506961] [2020-02-10 19:44:31,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:31,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:31,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497349271] [2020-02-10 19:44:31,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:31,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:31,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:31,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:31,778 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:44:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:31,862 INFO L93 Difference]: Finished difference Result 568 states and 1711 transitions. [2020-02-10 19:44:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:31,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:31,864 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:44:31,864 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:44:31,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 19:44:31,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:44:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 388. [2020-02-10 19:44:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:44:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1354 transitions. [2020-02-10 19:44:31,874 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1354 transitions. Word has length 22 [2020-02-10 19:44:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:31,874 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1354 transitions. [2020-02-10 19:44:31,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1354 transitions. [2020-02-10 19:44:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:31,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:31,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 19:44:31,875 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 19:44:31,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:31,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1743393030, now seen corresponding path program 99 times [2020-02-10 19:44:31,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:31,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549868716] [2020-02-10 19:44:31,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:32,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 19:44:32,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549868716] [2020-02-10 19:44:32,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:32,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:32,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786032920] [2020-02-10 19:44:32,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:32,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:32,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:32,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:32,189 INFO L87 Difference]: Start difference. First operand 388 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:44:32,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:32,348 INFO L93 Difference]: Finished difference Result 572 states and 1720 transitions. [2020-02-10 19:44:32,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:32,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:32,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:32,350 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:44:32,350 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:44:32,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 19:44:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:44:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 390. [2020-02-10 19:44:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-02-10 19:44:32,361 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-02-10 19:44:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:32,362 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-02-10 19:44:32,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:32,362 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-02-10 19:44:32,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:32,362 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:32,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 19:44:32,363 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 19:44:32,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:32,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1996485782, now seen corresponding path program 100 times [2020-02-10 19:44:32,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:32,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988614146] [2020-02-10 19:44:32,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:32,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 19:44:32,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988614146] [2020-02-10 19:44:32,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:32,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:32,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374295690] [2020-02-10 19:44:32,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:32,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:32,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:32,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:32,681 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:44:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:32,813 INFO L93 Difference]: Finished difference Result 571 states and 1716 transitions. [2020-02-10 19:44:32,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:32,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:32,815 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:44:32,815 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:44:32,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 19:44:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:44:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 388. [2020-02-10 19:44:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:44:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1353 transitions. [2020-02-10 19:44:32,828 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1353 transitions. Word has length 22 [2020-02-10 19:44:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:32,829 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1353 transitions. [2020-02-10 19:44:32,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1353 transitions. [2020-02-10 19:44:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:32,830 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:32,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 19:44:32,830 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 19:44:32,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:32,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1302561834, now seen corresponding path program 101 times [2020-02-10 19:44:32,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:32,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756750731] [2020-02-10 19:44:32,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:33,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 19:44:33,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756750731] [2020-02-10 19:44:33,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:33,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:33,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993025342] [2020-02-10 19:44:33,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:33,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:33,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:33,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:33,178 INFO L87 Difference]: Start difference. First operand 388 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:44:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:33,274 INFO L93 Difference]: Finished difference Result 567 states and 1708 transitions. [2020-02-10 19:44:33,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:33,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:33,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:33,276 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:44:33,276 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:44:33,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 19:44:33,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:44:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 389. [2020-02-10 19:44:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1354 transitions. [2020-02-10 19:44:33,286 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1354 transitions. Word has length 22 [2020-02-10 19:44:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:33,286 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1354 transitions. [2020-02-10 19:44:33,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1354 transitions. [2020-02-10 19:44:33,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:33,287 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:33,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 19:44:33,287 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 19:44:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:33,288 INFO L82 PathProgramCache]: Analyzing trace with hash 308379124, now seen corresponding path program 102 times [2020-02-10 19:44:33,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:33,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428410763] [2020-02-10 19:44:33,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:33,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 19:44:33,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428410763] [2020-02-10 19:44:33,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:33,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:33,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503847350] [2020-02-10 19:44:33,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:33,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:33,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:33,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:33,619 INFO L87 Difference]: Start difference. First operand 389 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:44:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:33,730 INFO L93 Difference]: Finished difference Result 568 states and 1709 transitions. [2020-02-10 19:44:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:33,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:33,732 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:44:33,733 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:44:33,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 19:44:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:44:33,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 387. [2020-02-10 19:44:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:44:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1351 transitions. [2020-02-10 19:44:33,743 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1351 transitions. Word has length 22 [2020-02-10 19:44:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:33,743 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1351 transitions. [2020-02-10 19:44:33,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1351 transitions. [2020-02-10 19:44:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:33,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:33,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 19:44:33,744 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 19:44:33,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:33,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1548473070, now seen corresponding path program 103 times [2020-02-10 19:44:33,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:33,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367266123] [2020-02-10 19:44:33,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:34,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 19:44:34,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367266123] [2020-02-10 19:44:34,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:34,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:34,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890911302] [2020-02-10 19:44:34,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:34,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:34,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:34,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:34,039 INFO L87 Difference]: Start difference. First operand 387 states and 1351 transitions. Second operand 9 states. [2020-02-10 19:44:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:34,148 INFO L93 Difference]: Finished difference Result 575 states and 1726 transitions. [2020-02-10 19:44:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:34,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:34,150 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:44:34,150 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:44:34,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 19:44:34,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:44:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 389. [2020-02-10 19:44:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1355 transitions. [2020-02-10 19:44:34,160 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1355 transitions. Word has length 22 [2020-02-10 19:44:34,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:34,160 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1355 transitions. [2020-02-10 19:44:34,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1355 transitions. [2020-02-10 19:44:34,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:34,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:34,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 19:44:34,161 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 19:44:34,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:34,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1300977216, now seen corresponding path program 104 times [2020-02-10 19:44:34,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:34,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958147563] [2020-02-10 19:44:34,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:34,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 19:44:34,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958147563] [2020-02-10 19:44:34,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:34,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:34,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767125448] [2020-02-10 19:44:34,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:34,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:34,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:34,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:34,460 INFO L87 Difference]: Start difference. First operand 389 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:44:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:34,545 INFO L93 Difference]: Finished difference Result 573 states and 1721 transitions. [2020-02-10 19:44:34,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:34,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:34,547 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:44:34,547 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:44:34,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 19:44:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:44:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 388. [2020-02-10 19:44:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:44:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1353 transitions. [2020-02-10 19:44:34,557 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1353 transitions. Word has length 22 [2020-02-10 19:44:34,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:34,557 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1353 transitions. [2020-02-10 19:44:34,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1353 transitions. [2020-02-10 19:44:34,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:34,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:34,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 19:44:34,558 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 19:44:34,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:34,559 INFO L82 PathProgramCache]: Analyzing trace with hash -535780538, now seen corresponding path program 105 times [2020-02-10 19:44:34,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:34,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460140352] [2020-02-10 19:44:34,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:34,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 19:44:34,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460140352] [2020-02-10 19:44:34,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:34,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:34,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801847177] [2020-02-10 19:44:34,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:34,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:34,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:34,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:34,846 INFO L87 Difference]: Start difference. First operand 388 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:44:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:34,958 INFO L93 Difference]: Finished difference Result 582 states and 1741 transitions. [2020-02-10 19:44:34,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:34,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:34,960 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:44:34,961 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 19:44:34,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 19:44:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 19:44:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 391. [2020-02-10 19:44:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-02-10 19:44:34,970 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-02-10 19:44:34,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:34,971 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-02-10 19:44:34,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-02-10 19:44:34,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:34,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:34,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 19:44:34,972 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 19:44:34,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:34,972 INFO L82 PathProgramCache]: Analyzing trace with hash 850254592, now seen corresponding path program 106 times [2020-02-10 19:44:34,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:34,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177638761] [2020-02-10 19:44:34,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:35,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 19:44:35,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177638761] [2020-02-10 19:44:35,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:35,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:35,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957015243] [2020-02-10 19:44:35,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:35,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:35,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:35,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:35,263 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:44:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:35,374 INFO L93 Difference]: Finished difference Result 585 states and 1744 transitions. [2020-02-10 19:44:35,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:35,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:35,376 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:44:35,376 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:44:35,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 19:44:35,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:44:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 388. [2020-02-10 19:44:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:44:35,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1352 transitions. [2020-02-10 19:44:35,396 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1352 transitions. Word has length 22 [2020-02-10 19:44:35,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:35,396 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1352 transitions. [2020-02-10 19:44:35,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1352 transitions. [2020-02-10 19:44:35,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:35,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:35,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 19:44:35,397 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 19:44:35,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:35,398 INFO L82 PathProgramCache]: Analyzing trace with hash 713231894, now seen corresponding path program 107 times [2020-02-10 19:44:35,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:35,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645733472] [2020-02-10 19:44:35,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:35,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645733472] [2020-02-10 19:44:35,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:35,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:35,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612694811] [2020-02-10 19:44:35,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:35,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:35,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:35,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:35,688 INFO L87 Difference]: Start difference. First operand 388 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:44:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:35,769 INFO L93 Difference]: Finished difference Result 576 states and 1726 transitions. [2020-02-10 19:44:35,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:35,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:35,771 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:44:35,771 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:44:35,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 19:44:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:44:35,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 389. [2020-02-10 19:44:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1353 transitions. [2020-02-10 19:44:35,782 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1353 transitions. Word has length 22 [2020-02-10 19:44:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:35,782 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1353 transitions. [2020-02-10 19:44:35,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1353 transitions. [2020-02-10 19:44:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:35,783 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:35,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 19:44:35,783 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 19:44:35,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:35,783 INFO L82 PathProgramCache]: Analyzing trace with hash -362479262, now seen corresponding path program 108 times [2020-02-10 19:44:35,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:35,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336455231] [2020-02-10 19:44:35,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:36,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 19:44:36,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336455231] [2020-02-10 19:44:36,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:36,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:36,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901472928] [2020-02-10 19:44:36,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:36,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:36,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:36,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:36,065 INFO L87 Difference]: Start difference. First operand 389 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:44:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:36,180 INFO L93 Difference]: Finished difference Result 581 states and 1735 transitions. [2020-02-10 19:44:36,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:36,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:36,182 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:44:36,182 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:44:36,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 19:44:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:44:36,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 387. [2020-02-10 19:44:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:44:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1350 transitions. [2020-02-10 19:44:36,194 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1350 transitions. Word has length 22 [2020-02-10 19:44:36,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:36,194 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1350 transitions. [2020-02-10 19:44:36,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:36,195 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1350 transitions. [2020-02-10 19:44:36,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:36,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:36,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 19:44:36,196 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 19:44:36,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:36,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1222876846, now seen corresponding path program 109 times [2020-02-10 19:44:36,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:36,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984000020] [2020-02-10 19:44:36,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:36,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 19:44:36,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984000020] [2020-02-10 19:44:36,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:36,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:36,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656420770] [2020-02-10 19:44:36,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:36,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:36,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:36,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:36,506 INFO L87 Difference]: Start difference. First operand 387 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:44:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:36,636 INFO L93 Difference]: Finished difference Result 581 states and 1742 transitions. [2020-02-10 19:44:36,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:36,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:36,638 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:44:36,638 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:44:36,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 19:44:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:44:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 391. [2020-02-10 19:44:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1360 transitions. [2020-02-10 19:44:36,649 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1360 transitions. Word has length 22 [2020-02-10 19:44:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:36,649 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1360 transitions. [2020-02-10 19:44:36,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1360 transitions. [2020-02-10 19:44:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:36,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:36,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 19:44:36,650 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 19:44:36,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:36,650 INFO L82 PathProgramCache]: Analyzing trace with hash -969784094, now seen corresponding path program 110 times [2020-02-10 19:44:36,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:36,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245078083] [2020-02-10 19:44:36,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:36,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 19:44:36,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245078083] [2020-02-10 19:44:36,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:36,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:36,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142498815] [2020-02-10 19:44:36,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:36,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:36,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:36,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:36,953 INFO L87 Difference]: Start difference. First operand 391 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:44:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:37,064 INFO L93 Difference]: Finished difference Result 580 states and 1738 transitions. [2020-02-10 19:44:37,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:37,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:37,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:37,066 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:44:37,066 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:44:37,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 19:44:37,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:44:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 389. [2020-02-10 19:44:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1355 transitions. [2020-02-10 19:44:37,076 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1355 transitions. Word has length 22 [2020-02-10 19:44:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:37,076 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1355 transitions. [2020-02-10 19:44:37,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1355 transitions. [2020-02-10 19:44:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:37,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:37,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 19:44:37,077 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 19:44:37,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:37,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1390253540, now seen corresponding path program 111 times [2020-02-10 19:44:37,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:37,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313294110] [2020-02-10 19:44:37,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:37,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 19:44:37,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313294110] [2020-02-10 19:44:37,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:37,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:37,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065644838] [2020-02-10 19:44:37,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:37,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:37,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:37,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:37,404 INFO L87 Difference]: Start difference. First operand 389 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:44:37,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:37,515 INFO L93 Difference]: Finished difference Result 586 states and 1751 transitions. [2020-02-10 19:44:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:37,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:37,517 INFO L225 Difference]: With dead ends: 586 [2020-02-10 19:44:37,517 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:44:37,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:44:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 392. [2020-02-10 19:44:37,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:44:37,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1360 transitions. [2020-02-10 19:44:37,528 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1360 transitions. Word has length 22 [2020-02-10 19:44:37,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:37,528 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1360 transitions. [2020-02-10 19:44:37,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:37,528 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1360 transitions. [2020-02-10 19:44:37,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:37,529 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:37,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 19:44:37,529 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 19:44:37,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:37,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1518678626, now seen corresponding path program 112 times [2020-02-10 19:44:37,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:37,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520227682] [2020-02-10 19:44:37,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44: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 19:44:37,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520227682] [2020-02-10 19:44:37,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:37,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:37,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715840154] [2020-02-10 19:44:37,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:37,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:37,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:37,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:37,832 INFO L87 Difference]: Start difference. First operand 392 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:44:37,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:37,941 INFO L93 Difference]: Finished difference Result 589 states and 1754 transitions. [2020-02-10 19:44:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:37,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:37,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:37,944 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:44:37,944 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:44:37,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 19:44:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:44:37,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 389. [2020-02-10 19:44:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1353 transitions. [2020-02-10 19:44:37,953 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1353 transitions. Word has length 22 [2020-02-10 19:44:37,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:37,953 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1353 transitions. [2020-02-10 19:44:37,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1353 transitions. [2020-02-10 19:44:37,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:37,954 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:37,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 19:44:37,954 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 19:44:37,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:37,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1510693950, now seen corresponding path program 113 times [2020-02-10 19:44:37,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:37,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714443113] [2020-02-10 19:44:37,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:38,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 19:44:38,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714443113] [2020-02-10 19:44:38,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:38,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:38,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395044694] [2020-02-10 19:44:38,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:38,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:38,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:38,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:38,249 INFO L87 Difference]: Start difference. First operand 389 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:44:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:38,359 INFO L93 Difference]: Finished difference Result 583 states and 1742 transitions. [2020-02-10 19:44:38,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:38,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:38,361 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:44:38,361 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 19:44:38,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 19:44:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 391. [2020-02-10 19:44:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-02-10 19:44:38,371 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-02-10 19:44:38,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:38,371 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-02-10 19:44:38,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-02-10 19:44:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:38,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:38,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:38,372 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 19:44:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:38,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1866323156, now seen corresponding path program 114 times [2020-02-10 19:44:38,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:38,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528751938] [2020-02-10 19:44:38,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:38,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 19:44:38,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528751938] [2020-02-10 19:44:38,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:38,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:38,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748732775] [2020-02-10 19:44:38,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:38,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:38,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:38,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:38,681 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:44:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:38,795 INFO L93 Difference]: Finished difference Result 587 states and 1748 transitions. [2020-02-10 19:44:38,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:38,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:38,797 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:44:38,797 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 19:44:38,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 19:44:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 19:44:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 387. [2020-02-10 19:44:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:44:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1349 transitions. [2020-02-10 19:44:38,808 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1349 transitions. Word has length 22 [2020-02-10 19:44:38,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:38,808 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1349 transitions. [2020-02-10 19:44:38,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1349 transitions. [2020-02-10 19:44:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:38,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:38,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 19:44:38,809 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 19:44:38,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:38,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1952169664, now seen corresponding path program 115 times [2020-02-10 19:44:38,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:38,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631348001] [2020-02-10 19:44:38,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:39,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 19:44:39,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631348001] [2020-02-10 19:44:39,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:39,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:39,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439794269] [2020-02-10 19:44:39,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:39,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:39,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:39,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:39,120 INFO L87 Difference]: Start difference. First operand 387 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:44:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:39,203 INFO L93 Difference]: Finished difference Result 570 states and 1713 transitions. [2020-02-10 19:44:39,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:39,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:39,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:39,205 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:44:39,205 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:44:39,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 19:44:39,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:44:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 389. [2020-02-10 19:44:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1353 transitions. [2020-02-10 19:44:39,215 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1353 transitions. Word has length 22 [2020-02-10 19:44:39,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:39,215 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1353 transitions. [2020-02-10 19:44:39,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:39,216 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1353 transitions. [2020-02-10 19:44:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:39,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:39,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 19:44:39,216 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 19:44:39,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:39,217 INFO L82 PathProgramCache]: Analyzing trace with hash -731856674, now seen corresponding path program 116 times [2020-02-10 19:44:39,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:39,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879130237] [2020-02-10 19:44:39,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:39,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 19:44:39,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879130237] [2020-02-10 19:44:39,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:39,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:39,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348823540] [2020-02-10 19:44:39,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:39,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:39,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:39,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:39,523 INFO L87 Difference]: Start difference. First operand 389 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:44:39,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:39,629 INFO L93 Difference]: Finished difference Result 571 states and 1714 transitions. [2020-02-10 19:44:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:39,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:39,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:39,631 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:44:39,631 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:44:39,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 19:44:39,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:44:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 388. [2020-02-10 19:44:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:44:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1351 transitions. [2020-02-10 19:44:39,641 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1351 transitions. Word has length 22 [2020-02-10 19:44:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:39,641 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1351 transitions. [2020-02-10 19:44:39,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1351 transitions. [2020-02-10 19:44:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:39,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:39,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 19:44:39,642 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 19:44:39,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:39,642 INFO L82 PathProgramCache]: Analyzing trace with hash 270332754, now seen corresponding path program 117 times [2020-02-10 19:44:39,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:39,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863523135] [2020-02-10 19:44:39,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:39,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 19:44:39,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863523135] [2020-02-10 19:44:39,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:39,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:39,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151710515] [2020-02-10 19:44:39,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:39,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:39,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:39,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:39,944 INFO L87 Difference]: Start difference. First operand 388 states and 1351 transitions. Second operand 9 states. [2020-02-10 19:44:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:40,028 INFO L93 Difference]: Finished difference Result 574 states and 1720 transitions. [2020-02-10 19:44:40,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:40,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:40,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:40,030 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:44:40,030 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:44:40,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 19:44:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:44:40,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 389. [2020-02-10 19:44:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1352 transitions. [2020-02-10 19:44:40,040 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1352 transitions. Word has length 22 [2020-02-10 19:44:40,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:40,040 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1352 transitions. [2020-02-10 19:44:40,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1352 transitions. [2020-02-10 19:44:40,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:40,041 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:40,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 19:44:40,041 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 19:44:40,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:40,042 INFO L82 PathProgramCache]: Analyzing trace with hash -805378402, now seen corresponding path program 118 times [2020-02-10 19:44:40,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:40,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009389920] [2020-02-10 19:44:40,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:40,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 19:44:40,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009389920] [2020-02-10 19:44:40,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:40,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:40,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218839264] [2020-02-10 19:44:40,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:40,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:40,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:40,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:40,332 INFO L87 Difference]: Start difference. First operand 389 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:44:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:40,453 INFO L93 Difference]: Finished difference Result 579 states and 1729 transitions. [2020-02-10 19:44:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:40,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:40,455 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:44:40,455 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:44:40,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 19:44:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:44:40,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 388. [2020-02-10 19:44:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:44:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1350 transitions. [2020-02-10 19:44:40,468 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1350 transitions. Word has length 22 [2020-02-10 19:44:40,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:40,468 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1350 transitions. [2020-02-10 19:44:40,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:40,468 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1350 transitions. [2020-02-10 19:44:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:40,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:40,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 19:44:40,469 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 19:44:40,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:40,470 INFO L82 PathProgramCache]: Analyzing trace with hash 280835858, now seen corresponding path program 119 times [2020-02-10 19:44:40,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:40,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003488061] [2020-02-10 19:44:40,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:40,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 19:44:40,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003488061] [2020-02-10 19:44:40,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:40,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:40,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982482258] [2020-02-10 19:44:40,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:40,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:40,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:40,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:40,808 INFO L87 Difference]: Start difference. First operand 388 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:44:40,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:40,937 INFO L93 Difference]: Finished difference Result 577 states and 1726 transitions. [2020-02-10 19:44:40,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:40,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:40,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:40,939 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:44:40,939 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:44:40,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 19:44:40,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:44:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 390. [2020-02-10 19:44:40,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1353 transitions. [2020-02-10 19:44:40,949 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1353 transitions. Word has length 22 [2020-02-10 19:44:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:40,949 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1353 transitions. [2020-02-10 19:44:40,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1353 transitions. [2020-02-10 19:44:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:40,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:40,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 19:44:40,950 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 19:44:40,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:40,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1889151040, now seen corresponding path program 120 times [2020-02-10 19:44:40,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:40,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292753597] [2020-02-10 19:44:40,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:41,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 19:44:41,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292753597] [2020-02-10 19:44:41,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:41,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:41,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789993968] [2020-02-10 19:44:41,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:41,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:41,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:41,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:41,250 INFO L87 Difference]: Start difference. First operand 390 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:44:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:41,364 INFO L93 Difference]: Finished difference Result 581 states and 1732 transitions. [2020-02-10 19:44:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:41,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:41,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:41,366 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:44:41,366 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:44:41,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 19:44:41,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:44:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 383. [2020-02-10 19:44:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:44:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1342 transitions. [2020-02-10 19:44:41,375 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1342 transitions. Word has length 22 [2020-02-10 19:44:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:41,376 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1342 transitions. [2020-02-10 19:44:41,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1342 transitions. [2020-02-10 19:44:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:41,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:41,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 19:44:41,377 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 19:44:41,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:41,377 INFO L82 PathProgramCache]: Analyzing trace with hash -317402012, now seen corresponding path program 121 times [2020-02-10 19:44:41,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:41,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104673070] [2020-02-10 19:44:41,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:41,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 19:44:41,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104673070] [2020-02-10 19:44:41,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:41,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:41,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793209922] [2020-02-10 19:44:41,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:41,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:41,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:41,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:41,666 INFO L87 Difference]: Start difference. First operand 383 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:44:41,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:41,752 INFO L93 Difference]: Finished difference Result 594 states and 1772 transitions. [2020-02-10 19:44:41,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:41,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:41,754 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:44:41,754 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:44:41,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 19:44:41,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:44:41,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 393. [2020-02-10 19:44:41,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:44:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1372 transitions. [2020-02-10 19:44:41,764 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1372 transitions. Word has length 22 [2020-02-10 19:44:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:41,764 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1372 transitions. [2020-02-10 19:44:41,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1372 transitions. [2020-02-10 19:44:41,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:41,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:41,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 19:44:41,765 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 19:44:41,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:41,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1272863874, now seen corresponding path program 122 times [2020-02-10 19:44:41,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:41,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542057399] [2020-02-10 19:44:41,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:42,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 19:44:42,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542057399] [2020-02-10 19:44:42,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:42,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:42,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441841037] [2020-02-10 19:44:42,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:42,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:42,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:42,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:42,046 INFO L87 Difference]: Start difference. First operand 393 states and 1372 transitions. Second operand 9 states. [2020-02-10 19:44:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:42,153 INFO L93 Difference]: Finished difference Result 589 states and 1759 transitions. [2020-02-10 19:44:42,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:42,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:42,156 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:44:42,156 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:44:42,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 19:44:42,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:44:42,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 389. [2020-02-10 19:44:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1364 transitions. [2020-02-10 19:44:42,168 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1364 transitions. Word has length 22 [2020-02-10 19:44:42,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:42,168 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1364 transitions. [2020-02-10 19:44:42,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:42,168 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1364 transitions. [2020-02-10 19:44:42,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:42,169 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:42,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 19:44:42,170 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 19:44:42,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:42,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1035148308, now seen corresponding path program 123 times [2020-02-10 19:44:42,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:42,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316823651] [2020-02-10 19:44:42,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:42,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 19:44:42,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316823651] [2020-02-10 19:44:42,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:42,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:42,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412009890] [2020-02-10 19:44:42,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:42,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:42,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:42,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:42,447 INFO L87 Difference]: Start difference. First operand 389 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:44:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:42,527 INFO L93 Difference]: Finished difference Result 590 states and 1760 transitions. [2020-02-10 19:44:42,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:42,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:42,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:42,529 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:44:42,530 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:44:42,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 19:44:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:44:42,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 391. [2020-02-10 19:44:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-02-10 19:44:42,540 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-02-10 19:44:42,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:42,541 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-02-10 19:44:42,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-02-10 19:44:42,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:42,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:42,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:42,542 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 19:44:42,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:42,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1596216800, now seen corresponding path program 124 times [2020-02-10 19:44:42,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:42,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002202222] [2020-02-10 19:44:42,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:42,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 19:44:42,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002202222] [2020-02-10 19:44:42,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:42,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:42,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884398720] [2020-02-10 19:44:42,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:42,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:42,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:42,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:42,829 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:44:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:42,918 INFO L93 Difference]: Finished difference Result 583 states and 1745 transitions. [2020-02-10 19:44:42,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:42,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:42,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:42,920 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:44:42,920 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:44:42,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 19:44:42,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:44:42,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 389. [2020-02-10 19:44:42,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1362 transitions. [2020-02-10 19:44:42,930 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1362 transitions. Word has length 22 [2020-02-10 19:44:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:42,930 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1362 transitions. [2020-02-10 19:44:42,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1362 transitions. [2020-02-10 19:44:42,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:42,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:42,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 19:44:42,931 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 19:44:42,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:42,931 INFO L82 PathProgramCache]: Analyzing trace with hash -159141898, now seen corresponding path program 125 times [2020-02-10 19:44:42,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:42,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48083827] [2020-02-10 19:44:42,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:43,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 19:44:43,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48083827] [2020-02-10 19:44:43,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:43,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:43,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739837721] [2020-02-10 19:44:43,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:43,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:43,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:43,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:43,219 INFO L87 Difference]: Start difference. First operand 389 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:44:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:43,327 INFO L93 Difference]: Finished difference Result 579 states and 1738 transitions. [2020-02-10 19:44:43,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:43,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:43,330 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:44:43,330 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:44:43,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:43,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:44:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 390. [2020-02-10 19:44:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1363 transitions. [2020-02-10 19:44:43,341 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1363 transitions. Word has length 22 [2020-02-10 19:44:43,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:43,341 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1363 transitions. [2020-02-10 19:44:43,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1363 transitions. [2020-02-10 19:44:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:43,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:43,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 19:44:43,342 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 19:44:43,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:43,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1604658908, now seen corresponding path program 126 times [2020-02-10 19:44:43,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:43,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105149568] [2020-02-10 19:44:43,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:43,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 19:44:43,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105149568] [2020-02-10 19:44:43,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:43,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:43,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540759980] [2020-02-10 19:44:43,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:43,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:43,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:43,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:43,646 INFO L87 Difference]: Start difference. First operand 390 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:44:43,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:43,746 INFO L93 Difference]: Finished difference Result 577 states and 1733 transitions. [2020-02-10 19:44:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:43,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:43,748 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:44:43,748 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:44:43,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:43,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:44:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 387. [2020-02-10 19:44:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:44:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1358 transitions. [2020-02-10 19:44:43,760 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1358 transitions. Word has length 22 [2020-02-10 19:44:43,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:43,761 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1358 transitions. [2020-02-10 19:44:43,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1358 transitions. [2020-02-10 19:44:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:43,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:43,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 19:44:43,762 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 19:44:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:43,762 INFO L82 PathProgramCache]: Analyzing trace with hash -739887738, now seen corresponding path program 127 times [2020-02-10 19:44:43,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:43,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87055837] [2020-02-10 19:44:43,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:44,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 19:44:44,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87055837] [2020-02-10 19:44:44,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:44,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:44,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739206824] [2020-02-10 19:44:44,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:44,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:44,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:44,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:44,053 INFO L87 Difference]: Start difference. First operand 387 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:44:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:44,143 INFO L93 Difference]: Finished difference Result 598 states and 1782 transitions. [2020-02-10 19:44:44,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:44,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:44,145 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:44:44,145 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:44:44,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:44:44,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 394. [2020-02-10 19:44:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:44:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1374 transitions. [2020-02-10 19:44:44,155 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1374 transitions. Word has length 22 [2020-02-10 19:44:44,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:44,155 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1374 transitions. [2020-02-10 19:44:44,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:44,155 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1374 transitions. [2020-02-10 19:44:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:44,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:44,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 19:44:44,156 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 19:44:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:44,156 INFO L82 PathProgramCache]: Analyzing trace with hash 850378148, now seen corresponding path program 128 times [2020-02-10 19:44:44,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:44,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970220180] [2020-02-10 19:44:44,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44: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 19:44:44,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970220180] [2020-02-10 19:44:44,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:44,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:44,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096316627] [2020-02-10 19:44:44,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:44,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:44,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:44,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:44,443 INFO L87 Difference]: Start difference. First operand 394 states and 1374 transitions. Second operand 9 states. [2020-02-10 19:44:44,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:44,562 INFO L93 Difference]: Finished difference Result 593 states and 1769 transitions. [2020-02-10 19:44:44,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:44,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:44,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:44,564 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:44:44,564 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:44:44,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:44,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:44:44,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 390. [2020-02-10 19:44:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1365 transitions. [2020-02-10 19:44:44,573 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1365 transitions. Word has length 22 [2020-02-10 19:44:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:44,574 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1365 transitions. [2020-02-10 19:44:44,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1365 transitions. [2020-02-10 19:44:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:44,574 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:44,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 19:44:44,574 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 19:44:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:44,575 INFO L82 PathProgramCache]: Analyzing trace with hash -638975566, now seen corresponding path program 129 times [2020-02-10 19:44:44,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:44,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119774592] [2020-02-10 19:44:44,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:44,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 19:44:44,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119774592] [2020-02-10 19:44:44,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:44,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:44,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215582843] [2020-02-10 19:44:44,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:44,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:44,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:44,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:44,852 INFO L87 Difference]: Start difference. First operand 390 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:44:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:44,967 INFO L93 Difference]: Finished difference Result 596 states and 1774 transitions. [2020-02-10 19:44:44,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:44,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:44,969 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:44:44,969 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:44:44,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 19:44:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:44:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2020-02-10 19:44:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:44:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1369 transitions. [2020-02-10 19:44:44,979 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1369 transitions. Word has length 22 [2020-02-10 19:44:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:44,979 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1369 transitions. [2020-02-10 19:44:44,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1369 transitions. [2020-02-10 19:44:44,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:44,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:44,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 19:44:44,980 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 19:44:44,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:44,981 INFO L82 PathProgramCache]: Analyzing trace with hash -512339192, now seen corresponding path program 130 times [2020-02-10 19:44:44,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:44,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673025643] [2020-02-10 19:44:44,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:45,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 19:44:45,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673025643] [2020-02-10 19:44:45,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:45,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:45,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364423232] [2020-02-10 19:44:45,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:45,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:45,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:45,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:45,256 INFO L87 Difference]: Start difference. First operand 393 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:44:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:45,383 INFO L93 Difference]: Finished difference Result 590 states and 1760 transitions. [2020-02-10 19:44:45,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:45,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:45,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:45,385 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:44:45,385 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:44:45,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 19:44:45,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:44:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 390. [2020-02-10 19:44:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1362 transitions. [2020-02-10 19:44:45,396 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1362 transitions. Word has length 22 [2020-02-10 19:44:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:45,396 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1362 transitions. [2020-02-10 19:44:45,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1362 transitions. [2020-02-10 19:44:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:45,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:45,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 19:44:45,397 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 19:44:45,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:45,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1367609936, now seen corresponding path program 131 times [2020-02-10 19:44:45,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:45,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047826788] [2020-02-10 19:44:45,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:45,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 19:44:45,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047826788] [2020-02-10 19:44:45,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:45,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:45,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750433198] [2020-02-10 19:44:45,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:45,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:45,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:45,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:45,701 INFO L87 Difference]: Start difference. First operand 390 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:44:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:45,818 INFO L93 Difference]: Finished difference Result 585 states and 1751 transitions. [2020-02-10 19:44:45,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:45,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:45,820 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:44:45,821 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:44:45,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 19:44:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:44:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 392. [2020-02-10 19:44:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:44:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1365 transitions. [2020-02-10 19:44:45,830 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1365 transitions. Word has length 22 [2020-02-10 19:44:45,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:45,830 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1365 transitions. [2020-02-10 19:44:45,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1365 transitions. [2020-02-10 19:44:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:45,831 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:45,831 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:45,831 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 19:44:45,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:45,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1585424572, now seen corresponding path program 132 times [2020-02-10 19:44:45,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:45,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757718642] [2020-02-10 19:44:45,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:46,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 19:44:46,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757718642] [2020-02-10 19:44:46,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:46,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:46,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331592328] [2020-02-10 19:44:46,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:46,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:46,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:46,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:46,116 INFO L87 Difference]: Start difference. First operand 392 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:44:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:46,236 INFO L93 Difference]: Finished difference Result 584 states and 1747 transitions. [2020-02-10 19:44:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:46,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:46,238 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:44:46,239 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 19:44:46,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 19:44:46,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 19:44:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 387. [2020-02-10 19:44:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:44:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1356 transitions. [2020-02-10 19:44:46,249 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1356 transitions. Word has length 22 [2020-02-10 19:44:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:46,249 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1356 transitions. [2020-02-10 19:44:46,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1356 transitions. [2020-02-10 19:44:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:46,250 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:46,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 19:44:46,250 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 19:44:46,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:46,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1016560404, now seen corresponding path program 133 times [2020-02-10 19:44:46,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:46,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696309167] [2020-02-10 19:44:46,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:46,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 19:44:46,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696309167] [2020-02-10 19:44:46,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:46,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:46,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475404847] [2020-02-10 19:44:46,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:46,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:46,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:46,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:46,540 INFO L87 Difference]: Start difference. First operand 387 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:44:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:46,630 INFO L93 Difference]: Finished difference Result 588 states and 1753 transitions. [2020-02-10 19:44:46,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:46,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:46,631 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:44:46,632 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:44:46,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 19:44:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:44:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 391. [2020-02-10 19:44:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:46,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-02-10 19:44:46,649 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-02-10 19:44:46,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:46,649 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-02-10 19:44:46,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-02-10 19:44:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:46,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:46,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 19:44:46,650 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 19:44:46,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:46,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1577628896, now seen corresponding path program 134 times [2020-02-10 19:44:46,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:46,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629590395] [2020-02-10 19:44:46,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:46,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629590395] [2020-02-10 19:44:46,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:46,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:46,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486074161] [2020-02-10 19:44:46,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:46,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:46,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:46,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:46,937 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:44:47,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:47,027 INFO L93 Difference]: Finished difference Result 581 states and 1738 transitions. [2020-02-10 19:44:47,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:47,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:47,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:47,029 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:44:47,029 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:44:47,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 19:44:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:44:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 389. [2020-02-10 19:44:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-02-10 19:44:47,039 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-02-10 19:44:47,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:47,039 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-02-10 19:44:47,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-02-10 19:44:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:47,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:47,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 19:44:47,040 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 19:44:47,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:47,040 INFO L82 PathProgramCache]: Analyzing trace with hash -583877450, now seen corresponding path program 135 times [2020-02-10 19:44:47,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:47,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215425121] [2020-02-10 19:44:47,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:47,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 19:44:47,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215425121] [2020-02-10 19:44:47,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:47,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:47,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862007226] [2020-02-10 19:44:47,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:47,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:47,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:47,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:47,329 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:44:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:47,430 INFO L93 Difference]: Finished difference Result 590 states and 1756 transitions. [2020-02-10 19:44:47,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:47,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:47,432 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:44:47,432 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:44:47,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:47,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:44:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 392. [2020-02-10 19:44:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:44:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-02-10 19:44:47,442 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-02-10 19:44:47,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:47,442 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-02-10 19:44:47,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-02-10 19:44:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:47,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:47,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:47,443 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 19:44:47,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:47,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1546081112, now seen corresponding path program 136 times [2020-02-10 19:44:47,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:47,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712991735] [2020-02-10 19:44:47,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:47,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712991735] [2020-02-10 19:44:47,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:47,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:47,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339348443] [2020-02-10 19:44:47,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:47,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:47,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:47,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:47,722 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:44:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:47,840 INFO L93 Difference]: Finished difference Result 584 states and 1742 transitions. [2020-02-10 19:44:47,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:47,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:47,842 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:44:47,842 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 19:44:47,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 19:44:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 19:44:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 389. [2020-02-10 19:44:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-02-10 19:44:47,852 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-02-10 19:44:47,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:47,852 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-02-10 19:44:47,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-02-10 19:44:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:47,853 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:47,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 19:44:47,853 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 19:44:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash -529155224, now seen corresponding path program 137 times [2020-02-10 19:44:47,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:47,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152381716] [2020-02-10 19:44:47,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:48,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 19:44:48,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152381716] [2020-02-10 19:44:48,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:48,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:48,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956630097] [2020-02-10 19:44:48,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:48,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:48,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:48,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:48,154 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:44:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:48,253 INFO L93 Difference]: Finished difference Result 574 states and 1723 transitions. [2020-02-10 19:44:48,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:48,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:48,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:48,257 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:44:48,258 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:44:48,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 19:44:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:44:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 390. [2020-02-10 19:44:48,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1359 transitions. [2020-02-10 19:44:48,267 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1359 transitions. Word has length 22 [2020-02-10 19:44:48,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:48,267 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1359 transitions. [2020-02-10 19:44:48,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1359 transitions. [2020-02-10 19:44:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:48,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:48,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 19:44:48,268 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 19:44:48,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:48,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1081785734, now seen corresponding path program 138 times [2020-02-10 19:44:48,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:48,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979408365] [2020-02-10 19:44:48,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:48,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 19:44:48,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979408365] [2020-02-10 19:44:48,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:48,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:48,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458849582] [2020-02-10 19:44:48,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:48,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:48,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:48,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:48,556 INFO L87 Difference]: Start difference. First operand 390 states and 1359 transitions. Second operand 9 states. [2020-02-10 19:44:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:48,715 INFO L93 Difference]: Finished difference Result 575 states and 1724 transitions. [2020-02-10 19:44:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:48,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:48,717 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:44:48,717 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:44:48,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 19:44:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:44:48,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 387. [2020-02-10 19:44:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:44:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1354 transitions. [2020-02-10 19:44:48,728 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1354 transitions. Word has length 22 [2020-02-10 19:44:48,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:48,728 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1354 transitions. [2020-02-10 19:44:48,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1354 transitions. [2020-02-10 19:44:48,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:48,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:48,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 19:44:48,729 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 19:44:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:48,729 INFO L82 PathProgramCache]: Analyzing trace with hash -620628942, now seen corresponding path program 139 times [2020-02-10 19:44:48,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:48,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238524348] [2020-02-10 19:44:48,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:49,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 19:44:49,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238524348] [2020-02-10 19:44:49,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:49,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:49,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573529551] [2020-02-10 19:44:49,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:49,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:49,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:49,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:49,026 INFO L87 Difference]: Start difference. First operand 387 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:44:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:49,162 INFO L93 Difference]: Finished difference Result 569 states and 1715 transitions. [2020-02-10 19:44:49,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:49,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:49,169 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:44:49,170 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:44:49,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 19:44:49,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:44:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 389. [2020-02-10 19:44:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-02-10 19:44:49,180 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-02-10 19:44:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:49,180 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-02-10 19:44:49,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-02-10 19:44:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:49,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44: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 19:44:49,181 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 19:44:49,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:49,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2066145952, now seen corresponding path program 140 times [2020-02-10 19:44:49,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:49,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374654532] [2020-02-10 19:44:49,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:49,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 19:44:49,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374654532] [2020-02-10 19:44:49,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:49,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:49,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199008994] [2020-02-10 19:44:49,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:49,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:49,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:49,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:49,487 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:44:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:49,581 INFO L93 Difference]: Finished difference Result 567 states and 1710 transitions. [2020-02-10 19:44:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:49,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:49,584 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:44:49,584 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:44:49,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 19:44:49,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:44:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 388. [2020-02-10 19:44:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:44:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1356 transitions. [2020-02-10 19:44:49,599 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1356 transitions. Word has length 22 [2020-02-10 19:44:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:49,599 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1356 transitions. [2020-02-10 19:44:49,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1356 transitions. [2020-02-10 19:44:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:49,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:49,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 19:44:49,600 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 19:44:49,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:49,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2073900500, now seen corresponding path program 141 times [2020-02-10 19:44:49,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:49,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566633102] [2020-02-10 19:44:49,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44: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 19:44:49,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566633102] [2020-02-10 19:44:49,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:49,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:49,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820710722] [2020-02-10 19:44:49,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:49,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:49,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:49,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:49,898 INFO L87 Difference]: Start difference. First operand 388 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:44:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:50,016 INFO L93 Difference]: Finished difference Result 571 states and 1719 transitions. [2020-02-10 19:44:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:50,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:50,018 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:44:50,018 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:44:50,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 19:44:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:44:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 390. [2020-02-10 19:44:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1359 transitions. [2020-02-10 19:44:50,028 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1359 transitions. Word has length 22 [2020-02-10 19:44:50,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:50,028 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1359 transitions. [2020-02-10 19:44:50,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:50,028 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1359 transitions. [2020-02-10 19:44:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:50,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:50,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 19:44:50,029 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 19:44:50,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:50,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1967974044, now seen corresponding path program 142 times [2020-02-10 19:44:50,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:50,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460657255] [2020-02-10 19:44:50,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:50,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 19:44:50,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460657255] [2020-02-10 19:44:50,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:50,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:50,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107994417] [2020-02-10 19:44:50,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:50,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:50,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:50,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:50,322 INFO L87 Difference]: Start difference. First operand 390 states and 1359 transitions. Second operand 9 states. [2020-02-10 19:44:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:50,437 INFO L93 Difference]: Finished difference Result 570 states and 1715 transitions. [2020-02-10 19:44:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:50,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:50,440 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:44:50,440 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:44:50,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 19:44:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:44:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 388. [2020-02-10 19:44:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:44:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1355 transitions. [2020-02-10 19:44:50,454 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1355 transitions. Word has length 22 [2020-02-10 19:44:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:50,454 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1355 transitions. [2020-02-10 19:44:50,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1355 transitions. [2020-02-10 19:44:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:50,455 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:50,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 19:44:50,455 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 19:44:50,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:50,455 INFO L82 PathProgramCache]: Analyzing trace with hash -972054364, now seen corresponding path program 143 times [2020-02-10 19:44:50,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:50,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121636355] [2020-02-10 19:44:50,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:50,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121636355] [2020-02-10 19:44:50,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:50,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:50,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109415638] [2020-02-10 19:44:50,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:50,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:50,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:50,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:50,805 INFO L87 Difference]: Start difference. First operand 388 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:44:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:50,899 INFO L93 Difference]: Finished difference Result 566 states and 1707 transitions. [2020-02-10 19:44:50,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:50,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:50,901 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:44:50,901 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:44:50,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:50,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:44:50,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 389. [2020-02-10 19:44:50,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:50,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-02-10 19:44:50,912 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-02-10 19:44:50,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:50,912 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-02-10 19:44:50,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-02-10 19:44:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:50,913 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:50,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 19:44:50,913 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 19:44:50,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:50,914 INFO L82 PathProgramCache]: Analyzing trace with hash 638886594, now seen corresponding path program 144 times [2020-02-10 19:44:50,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:50,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118977927] [2020-02-10 19:44:50,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:51,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 19:44:51,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118977927] [2020-02-10 19:44:51,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:51,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:51,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558737376] [2020-02-10 19:44:51,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:51,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:51,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:51,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:51,221 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:44:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:51,367 INFO L93 Difference]: Finished difference Result 567 states and 1708 transitions. [2020-02-10 19:44:51,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:51,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:51,369 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:44:51,369 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:44:51,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 19:44:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:44:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 385. [2020-02-10 19:44:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:44:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1350 transitions. [2020-02-10 19:44:51,380 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1350 transitions. Word has length 22 [2020-02-10 19:44:51,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:51,380 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1350 transitions. [2020-02-10 19:44:51,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1350 transitions. [2020-02-10 19:44:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:51,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:51,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:51,381 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 19:44:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:51,381 INFO L82 PathProgramCache]: Analyzing trace with hash 743376078, now seen corresponding path program 145 times [2020-02-10 19:44:51,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:51,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881714470] [2020-02-10 19:44:51,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:51,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 19:44:51,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881714470] [2020-02-10 19:44:51,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:51,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:51,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031064047] [2020-02-10 19:44:51,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:51,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:51,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:51,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:51,655 INFO L87 Difference]: Start difference. First operand 385 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:44:51,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:51,744 INFO L93 Difference]: Finished difference Result 602 states and 1792 transitions. [2020-02-10 19:44:51,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:51,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:51,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:51,746 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:44:51,746 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:44:51,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 19:44:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:44:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 393. [2020-02-10 19:44:51,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:44:51,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1370 transitions. [2020-02-10 19:44:51,756 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1370 transitions. Word has length 22 [2020-02-10 19:44:51,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:51,756 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1370 transitions. [2020-02-10 19:44:51,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1370 transitions. [2020-02-10 19:44:51,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:51,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:51,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 19:44:51,757 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 19:44:51,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:51,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1961325332, now seen corresponding path program 146 times [2020-02-10 19:44:51,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:51,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081500454] [2020-02-10 19:44:51,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:52,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 19:44:52,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081500454] [2020-02-10 19:44:52,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:52,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:52,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538319413] [2020-02-10 19:44:52,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:52,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:52,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:52,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:52,108 INFO L87 Difference]: Start difference. First operand 393 states and 1370 transitions. Second operand 9 states. [2020-02-10 19:44:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:52,225 INFO L93 Difference]: Finished difference Result 597 states and 1779 transitions. [2020-02-10 19:44:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:52,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:52,227 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:44:52,227 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:44:52,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 19:44:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:44:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 389. [2020-02-10 19:44:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1362 transitions. [2020-02-10 19:44:52,237 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1362 transitions. Word has length 22 [2020-02-10 19:44:52,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:52,237 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1362 transitions. [2020-02-10 19:44:52,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1362 transitions. [2020-02-10 19:44:52,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:52,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:52,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 19:44:52,238 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 19:44:52,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:52,238 INFO L82 PathProgramCache]: Analyzing trace with hash 2095926398, now seen corresponding path program 147 times [2020-02-10 19:44:52,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:52,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124467121] [2020-02-10 19:44:52,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:52,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 19:44:52,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124467121] [2020-02-10 19:44:52,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:52,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:52,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713429334] [2020-02-10 19:44:52,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:52,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:52,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:52,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:52,616 INFO L87 Difference]: Start difference. First operand 389 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:44:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:52,743 INFO L93 Difference]: Finished difference Result 598 states and 1780 transitions. [2020-02-10 19:44:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:52,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:52,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:52,746 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:44:52,746 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:44:52,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:52,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:44:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 391. [2020-02-10 19:44:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-02-10 19:44:52,783 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-02-10 19:44:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:52,784 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-02-10 19:44:52,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-02-10 19:44:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:52,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:52,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 19:44:52,786 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 19:44:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:52,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1637972406, now seen corresponding path program 148 times [2020-02-10 19:44:52,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:52,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080829400] [2020-02-10 19:44:52,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:53,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 19:44:53,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080829400] [2020-02-10 19:44:53,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:53,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:53,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764969045] [2020-02-10 19:44:53,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:53,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:53,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:53,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:53,066 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:44:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:53,158 INFO L93 Difference]: Finished difference Result 591 states and 1765 transitions. [2020-02-10 19:44:53,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:53,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:53,160 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:44:53,161 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:44:53,161 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:53,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:44:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 389. [2020-02-10 19:44:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-02-10 19:44:53,170 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-02-10 19:44:53,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:53,170 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-02-10 19:44:53,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-02-10 19:44:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:53,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:53,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 19:44:53,171 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 19:44:53,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:53,171 INFO L82 PathProgramCache]: Analyzing trace with hash 901636192, now seen corresponding path program 149 times [2020-02-10 19:44:53,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:53,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344123615] [2020-02-10 19:44:53,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:53,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344123615] [2020-02-10 19:44:53,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:53,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:53,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898448339] [2020-02-10 19:44:53,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:53,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:53,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:53,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:53,445 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:44:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:53,560 INFO L93 Difference]: Finished difference Result 587 states and 1758 transitions. [2020-02-10 19:44:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:53,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:53,562 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:44:53,562 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:44:53,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 19:44:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:44:53,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 390. [2020-02-10 19:44:53,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1361 transitions. [2020-02-10 19:44:53,572 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1361 transitions. Word has length 22 [2020-02-10 19:44:53,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:53,572 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1361 transitions. [2020-02-10 19:44:53,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:53,573 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1361 transitions. [2020-02-10 19:44:53,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:53,573 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:53,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 19:44:53,573 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 19:44:53,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:53,574 INFO L82 PathProgramCache]: Analyzing trace with hash -543880818, now seen corresponding path program 150 times [2020-02-10 19:44:53,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:53,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676983873] [2020-02-10 19:44:53,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:53,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 19:44:53,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676983873] [2020-02-10 19:44:53,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:53,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:53,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967892584] [2020-02-10 19:44:53,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:53,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:53,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:53,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:53,857 INFO L87 Difference]: Start difference. First operand 390 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:44:53,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:53,954 INFO L93 Difference]: Finished difference Result 585 states and 1753 transitions. [2020-02-10 19:44:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:53,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:53,956 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:44:53,957 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 19:44:53,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 19:44:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 19:44:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 387. [2020-02-10 19:44:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:44:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1356 transitions. [2020-02-10 19:44:53,969 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1356 transitions. Word has length 22 [2020-02-10 19:44:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:53,970 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1356 transitions. [2020-02-10 19:44:53,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1356 transitions. [2020-02-10 19:44:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:53,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:53,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 19:44:53,971 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 19:44:53,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:53,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1861648314, now seen corresponding path program 151 times [2020-02-10 19:44:53,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:53,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770701673] [2020-02-10 19:44:53,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:54,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 19:44:54,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770701673] [2020-02-10 19:44:54,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:54,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:54,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179395099] [2020-02-10 19:44:54,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:54,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:54,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:54,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:54,291 INFO L87 Difference]: Start difference. First operand 387 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:44:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:54,382 INFO L93 Difference]: Finished difference Result 614 states and 1824 transitions. [2020-02-10 19:44:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:54,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:54,384 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:44:54,384 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:44:54,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 19:44:54,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:44:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 395. [2020-02-10 19:44:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:44:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1376 transitions. [2020-02-10 19:44:54,395 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1376 transitions. Word has length 22 [2020-02-10 19:44:54,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:54,395 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1376 transitions. [2020-02-10 19:44:54,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:54,395 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1376 transitions. [2020-02-10 19:44:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:54,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:54,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 19:44:54,396 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 19:44:54,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:54,396 INFO L82 PathProgramCache]: Analyzing trace with hash -271382428, now seen corresponding path program 152 times [2020-02-10 19:44:54,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:54,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532445747] [2020-02-10 19:44:54,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:54,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532445747] [2020-02-10 19:44:54,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:54,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:54,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440489931] [2020-02-10 19:44:54,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:54,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:54,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:54,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:54,689 INFO L87 Difference]: Start difference. First operand 395 states and 1376 transitions. Second operand 9 states. [2020-02-10 19:44:54,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:54,804 INFO L93 Difference]: Finished difference Result 609 states and 1811 transitions. [2020-02-10 19:44:54,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:54,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:54,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:54,806 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:44:54,806 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:44:54,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 19:44:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:44:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 391. [2020-02-10 19:44:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-02-10 19:44:54,816 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-02-10 19:44:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:54,816 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-02-10 19:44:54,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-02-10 19:44:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:54,817 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:54,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 19:44:54,817 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 19:44:54,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash -529085386, now seen corresponding path program 153 times [2020-02-10 19:44:54,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:54,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940367517] [2020-02-10 19:44:54,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:55,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 19:44:55,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940367517] [2020-02-10 19:44:55,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:55,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:55,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482565198] [2020-02-10 19:44:55,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:55,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:55,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:55,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:55,125 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:44:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:55,223 INFO L93 Difference]: Finished difference Result 618 states and 1830 transitions. [2020-02-10 19:44:55,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:55,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:55,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:55,225 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:44:55,225 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:44:55,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 19:44:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:44:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 397. [2020-02-10 19:44:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:44:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1376 transitions. [2020-02-10 19:44:55,237 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1376 transitions. Word has length 22 [2020-02-10 19:44:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:55,237 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1376 transitions. [2020-02-10 19:44:55,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1376 transitions. [2020-02-10 19:44:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:55,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:55,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 19:44:55,238 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 19:44:55,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:55,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2120185414, now seen corresponding path program 154 times [2020-02-10 19:44:55,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:55,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651991985] [2020-02-10 19:44:55,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:55,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 19:44:55,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651991985] [2020-02-10 19:44:55,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:55,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:55,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19655894] [2020-02-10 19:44:55,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:55,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:55,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:55,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:55,506 INFO L87 Difference]: Start difference. First operand 397 states and 1376 transitions. Second operand 9 states. [2020-02-10 19:44:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:55,629 INFO L93 Difference]: Finished difference Result 615 states and 1819 transitions. [2020-02-10 19:44:55,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:55,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:55,631 INFO L225 Difference]: With dead ends: 615 [2020-02-10 19:44:55,631 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:44:55,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 19:44:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:44:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 391. [2020-02-10 19:44:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 19:44:55,641 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 19:44:55,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:55,641 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 19:44:55,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:55,642 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 19:44:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:55,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:55,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 19:44:55,642 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 19:44:55,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:55,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1744381800, now seen corresponding path program 155 times [2020-02-10 19:44:55,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:55,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934199555] [2020-02-10 19:44:55,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:55,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934199555] [2020-02-10 19:44:55,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:55,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:55,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689693124] [2020-02-10 19:44:55,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:55,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:55,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:55,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:55,931 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:44:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:56,048 INFO L93 Difference]: Finished difference Result 605 states and 1800 transitions. [2020-02-10 19:44:56,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:56,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:56,050 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:44:56,050 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:44:56,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:56,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:44:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 394. [2020-02-10 19:44:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:44:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-02-10 19:44:56,060 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-02-10 19:44:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:56,060 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-02-10 19:44:56,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-02-10 19:44:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:56,061 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:56,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 19:44:56,061 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 19:44:56,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:56,061 INFO L82 PathProgramCache]: Analyzing trace with hash -15334466, now seen corresponding path program 156 times [2020-02-10 19:44:56,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:56,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324213773] [2020-02-10 19:44:56,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:56,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 19:44:56,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324213773] [2020-02-10 19:44:56,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:56,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:56,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436139946] [2020-02-10 19:44:56,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:56,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:56,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:56,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:56,328 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-02-10 19:44:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:56,469 INFO L93 Difference]: Finished difference Result 607 states and 1801 transitions. [2020-02-10 19:44:56,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:56,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:56,471 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:44:56,471 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:44:56,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 19:44:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:44:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 387. [2020-02-10 19:44:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:44:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1354 transitions. [2020-02-10 19:44:56,481 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1354 transitions. Word has length 22 [2020-02-10 19:44:56,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:56,481 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1354 transitions. [2020-02-10 19:44:56,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:56,481 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1354 transitions. [2020-02-10 19:44:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:56,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:56,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 19:44:56,482 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 19:44:56,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:56,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1145435970, now seen corresponding path program 157 times [2020-02-10 19:44:56,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:56,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352665919] [2020-02-10 19:44:56,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:56,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 19:44:56,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352665919] [2020-02-10 19:44:56,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:56,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:56,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857271443] [2020-02-10 19:44:56,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:56,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:56,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:56,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:56,737 INFO L87 Difference]: Start difference. First operand 387 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:44:56,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:56,852 INFO L93 Difference]: Finished difference Result 602 states and 1788 transitions. [2020-02-10 19:44:56,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:56,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:56,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:56,854 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:44:56,854 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:44:56,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 19:44:56,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:44:56,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 391. [2020-02-10 19:44:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:44:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 19:44:56,865 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 19:44:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:56,865 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 19:44:56,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 19:44:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:56,866 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:56,866 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:56,866 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 19:44:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash -584367478, now seen corresponding path program 158 times [2020-02-10 19:44:56,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:56,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656079490] [2020-02-10 19:44:56,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:57,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 19:44:57,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656079490] [2020-02-10 19:44:57,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:57,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:57,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374075528] [2020-02-10 19:44:57,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:57,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:57,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:57,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:57,310 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:44:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:57,400 INFO L93 Difference]: Finished difference Result 595 states and 1773 transitions. [2020-02-10 19:44:57,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:57,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:57,401 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:44:57,401 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:44:57,402 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 19:44:57,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:44:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 389. [2020-02-10 19:44:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-02-10 19:44:57,414 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-02-10 19:44:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:57,415 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-02-10 19:44:57,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-02-10 19:44:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:57,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:57,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 19:44:57,416 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 19:44:57,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:57,416 INFO L82 PathProgramCache]: Analyzing trace with hash 961348150, now seen corresponding path program 159 times [2020-02-10 19:44:57,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:57,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350999070] [2020-02-10 19:44:57,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:57,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 19:44:57,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350999070] [2020-02-10 19:44:57,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:57,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:57,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570567856] [2020-02-10 19:44:57,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:57,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:57,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:57,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:57,688 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:44:57,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:57,778 INFO L93 Difference]: Finished difference Result 610 states and 1806 transitions. [2020-02-10 19:44:57,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:57,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:57,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:57,780 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:44:57,780 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:44:57,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 19:44:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:44:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 395. [2020-02-10 19:44:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:44:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1368 transitions. [2020-02-10 19:44:57,793 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1368 transitions. Word has length 22 [2020-02-10 19:44:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:57,793 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1368 transitions. [2020-02-10 19:44:57,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1368 transitions. [2020-02-10 19:44:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:57,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:57,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 19:44:57,795 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 19:44:57,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1154168842, now seen corresponding path program 160 times [2020-02-10 19:44:57,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:57,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013244512] [2020-02-10 19:44:57,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:58,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 19:44:58,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013244512] [2020-02-10 19:44:58,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:58,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:58,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551998008] [2020-02-10 19:44:58,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:58,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:58,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:58,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:58,078 INFO L87 Difference]: Start difference. First operand 395 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:44:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:58,211 INFO L93 Difference]: Finished difference Result 607 states and 1795 transitions. [2020-02-10 19:44:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:58,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:58,213 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:44:58,213 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:44:58,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:44:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 389. [2020-02-10 19:44:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-02-10 19:44:58,222 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-02-10 19:44:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:58,223 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-02-10 19:44:58,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-02-10 19:44:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:58,223 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:58,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 19:44:58,223 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 19:44:58,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:58,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1016070376, now seen corresponding path program 161 times [2020-02-10 19:44:58,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:58,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814822940] [2020-02-10 19:44:58,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:58,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 19:44:58,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814822940] [2020-02-10 19:44:58,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:58,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:58,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239321301] [2020-02-10 19:44:58,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:58,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:58,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:58,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:58,495 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:44:58,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:58,599 INFO L93 Difference]: Finished difference Result 591 states and 1764 transitions. [2020-02-10 19:44:58,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:58,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:58,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:58,601 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:44:58,602 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:44:58,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 19:44:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:44:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 390. [2020-02-10 19:44:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:44:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-02-10 19:44:58,611 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-02-10 19:44:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:58,611 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-02-10 19:44:58,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-02-10 19:44:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:58,612 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:58,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 19:44:58,612 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 19:44:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1132726160, now seen corresponding path program 162 times [2020-02-10 19:44:58,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:58,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013779330] [2020-02-10 19:44:58,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:58,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013779330] [2020-02-10 19:44:58,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:58,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:58,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224096673] [2020-02-10 19:44:58,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:58,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:58,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:58,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:58,895 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:44:59,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:59,021 INFO L93 Difference]: Finished difference Result 595 states and 1771 transitions. [2020-02-10 19:44:59,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:59,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:59,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:59,023 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:44:59,023 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:44:59,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 19:44:59,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:44:59,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 387. [2020-02-10 19:44:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:44:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1352 transitions. [2020-02-10 19:44:59,032 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1352 transitions. Word has length 22 [2020-02-10 19:44:59,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:59,033 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1352 transitions. [2020-02-10 19:44:59,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:59,033 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1352 transitions. [2020-02-10 19:44:59,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:59,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:59,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 19:44:59,034 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 19:44:59,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:59,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1512341980, now seen corresponding path program 163 times [2020-02-10 19:44:59,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:59,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697517291] [2020-02-10 19:44:59,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:59,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 19:44:59,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697517291] [2020-02-10 19:44:59,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:59,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:59,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334490031] [2020-02-10 19:44:59,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:59,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:59,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:59,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:59,321 INFO L87 Difference]: Start difference. First operand 387 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:44:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:59,434 INFO L93 Difference]: Finished difference Result 581 states and 1744 transitions. [2020-02-10 19:44:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:59,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:59,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:59,436 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:44:59,436 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:44:59,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:44:59,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 389. [2020-02-10 19:44:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:44:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-02-10 19:44:59,447 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-02-10 19:44:59,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:59,447 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-02-10 19:44:59,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:59,447 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-02-10 19:44:59,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:59,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:59,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 19:44:59,448 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 19:44:59,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:59,448 INFO L82 PathProgramCache]: Analyzing trace with hash 66824970, now seen corresponding path program 164 times [2020-02-10 19:44:59,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:59,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399443755] [2020-02-10 19:44:59,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:59,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 19:44:59,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399443755] [2020-02-10 19:44:59,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:59,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:44:59,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925623533] [2020-02-10 19:44:59,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:44:59,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:59,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:44:59,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:59,727 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:44:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:59,823 INFO L93 Difference]: Finished difference Result 579 states and 1739 transitions. [2020-02-10 19:44:59,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:44:59,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:44:59,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:59,826 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:44:59,826 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 19:44:59,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 19:44:59,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 19:44:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 388. [2020-02-10 19:44:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:44:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1354 transitions. [2020-02-10 19:44:59,836 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1354 transitions. Word has length 22 [2020-02-10 19:44:59,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:59,836 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1354 transitions. [2020-02-10 19:44:59,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:44:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1354 transitions. [2020-02-10 19:44:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:44:59,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:59,837 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:59,837 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 19:44:59,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:59,838 INFO L82 PathProgramCache]: Analyzing trace with hash -675841196, now seen corresponding path program 165 times [2020-02-10 19:44:59,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:59,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687300079] [2020-02-10 19:44:59,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:00,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 19:45:00,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687300079] [2020-02-10 19:45:00,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:00,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:00,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799258299] [2020-02-10 19:45:00,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:00,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:00,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:00,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:00,107 INFO L87 Difference]: Start difference. First operand 388 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:45:00,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:00,222 INFO L93 Difference]: Finished difference Result 587 states and 1757 transitions. [2020-02-10 19:45:00,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:00,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:00,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:00,224 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:45:00,224 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:45:00,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 19:45:00,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:45:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 391. [2020-02-10 19:45:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1359 transitions. [2020-02-10 19:45:00,235 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1359 transitions. Word has length 22 [2020-02-10 19:45:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:00,235 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1359 transitions. [2020-02-10 19:45:00,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1359 transitions. [2020-02-10 19:45:00,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:00,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:00,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 19:45:00,237 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 19:45:00,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:00,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1457840438, now seen corresponding path program 166 times [2020-02-10 19:45:00,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:00,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141608509] [2020-02-10 19:45:00,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:00,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 19:45:00,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141608509] [2020-02-10 19:45:00,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:00,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:00,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566994667] [2020-02-10 19:45:00,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:00,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:00,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:00,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:00,500 INFO L87 Difference]: Start difference. First operand 391 states and 1359 transitions. Second operand 9 states. [2020-02-10 19:45:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:00,646 INFO L93 Difference]: Finished difference Result 589 states and 1758 transitions. [2020-02-10 19:45:00,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:00,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:00,648 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:45:00,648 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 19:45:00,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 19:45:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 19:45:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 388. [2020-02-10 19:45:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:45:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1353 transitions. [2020-02-10 19:45:00,658 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1353 transitions. Word has length 22 [2020-02-10 19:45:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:00,658 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1353 transitions. [2020-02-10 19:45:00,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1353 transitions. [2020-02-10 19:45:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:00,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:00,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 19:45:00,659 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 19:45:00,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:00,659 INFO L82 PathProgramCache]: Analyzing trace with hash 573171236, now seen corresponding path program 167 times [2020-02-10 19:45:00,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:00,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487620923] [2020-02-10 19:45:00,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:00,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 19:45:00,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487620923] [2020-02-10 19:45:00,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:00,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:00,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781105411] [2020-02-10 19:45:00,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:00,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:00,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:00,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:00,936 INFO L87 Difference]: Start difference. First operand 388 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:45:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:01,051 INFO L93 Difference]: Finished difference Result 581 states and 1742 transitions. [2020-02-10 19:45:01,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:01,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:01,053 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:45:01,053 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:45:01,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 19:45:01,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:45:01,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 389. [2020-02-10 19:45:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:45:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1354 transitions. [2020-02-10 19:45:01,064 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1354 transitions. Word has length 22 [2020-02-10 19:45:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:01,064 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1354 transitions. [2020-02-10 19:45:01,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1354 transitions. [2020-02-10 19:45:01,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:01,065 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:01,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 19:45:01,065 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 19:45:01,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:01,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1575625300, now seen corresponding path program 168 times [2020-02-10 19:45:01,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:01,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765554434] [2020-02-10 19:45:01,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:01,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 19:45:01,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765554434] [2020-02-10 19:45:01,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:01,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:01,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383239987] [2020-02-10 19:45:01,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:01,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:01,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:01,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:01,332 INFO L87 Difference]: Start difference. First operand 389 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:45:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:01,450 INFO L93 Difference]: Finished difference Result 585 states and 1749 transitions. [2020-02-10 19:45:01,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:01,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:01,452 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:45:01,452 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:45:01,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:01,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:45:01,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 385. [2020-02-10 19:45:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:45:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1348 transitions. [2020-02-10 19:45:01,463 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1348 transitions. Word has length 22 [2020-02-10 19:45:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:01,463 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1348 transitions. [2020-02-10 19:45:01,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1348 transitions. [2020-02-10 19:45:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:01,464 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:01,464 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:01,464 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 19:45:01,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:01,464 INFO L82 PathProgramCache]: Analyzing trace with hash 108734734, now seen corresponding path program 169 times [2020-02-10 19:45:01,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:01,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656517887] [2020-02-10 19:45:01,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:01,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 19:45:01,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656517887] [2020-02-10 19:45:01,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:01,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:01,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240193330] [2020-02-10 19:45:01,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:01,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:01,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:01,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:01,731 INFO L87 Difference]: Start difference. First operand 385 states and 1348 transitions. Second operand 9 states. [2020-02-10 19:45:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:01,843 INFO L93 Difference]: Finished difference Result 614 states and 1830 transitions. [2020-02-10 19:45:01,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:01,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:01,845 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:45:01,845 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:45:01,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:01,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:45:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 395. [2020-02-10 19:45:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:45:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1377 transitions. [2020-02-10 19:45:01,856 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1377 transitions. Word has length 22 [2020-02-10 19:45:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:01,856 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1377 transitions. [2020-02-10 19:45:01,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1377 transitions. [2020-02-10 19:45:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:01,857 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:01,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 19:45:01,858 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 19:45:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1699000620, now seen corresponding path program 170 times [2020-02-10 19:45:01,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:01,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087002733] [2020-02-10 19:45:01,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:02,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:02,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087002733] [2020-02-10 19:45:02,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:02,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:02,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197820995] [2020-02-10 19:45:02,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:02,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:02,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:02,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:02,123 INFO L87 Difference]: Start difference. First operand 395 states and 1377 transitions. Second operand 9 states. [2020-02-10 19:45:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:02,248 INFO L93 Difference]: Finished difference Result 609 states and 1817 transitions. [2020-02-10 19:45:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:02,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:02,250 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:45:02,251 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:45:02,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 19:45:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:45:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 391. [2020-02-10 19:45:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1368 transitions. [2020-02-10 19:45:02,264 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1368 transitions. Word has length 22 [2020-02-10 19:45:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:02,264 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1368 transitions. [2020-02-10 19:45:02,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1368 transitions. [2020-02-10 19:45:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:02,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:02,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 19:45:02,265 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 19:45:02,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:02,266 INFO L82 PathProgramCache]: Analyzing trace with hash 209646906, now seen corresponding path program 171 times [2020-02-10 19:45:02,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:02,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546812230] [2020-02-10 19:45:02,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:02,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546812230] [2020-02-10 19:45:02,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:02,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:02,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939022900] [2020-02-10 19:45:02,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:02,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:02,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:02,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:02,527 INFO L87 Difference]: Start difference. First operand 391 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:45:02,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:02,641 INFO L93 Difference]: Finished difference Result 612 states and 1822 transitions. [2020-02-10 19:45:02,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:02,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:02,643 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:45:02,643 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:45:02,644 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:02,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:45:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 394. [2020-02-10 19:45:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:45:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1372 transitions. [2020-02-10 19:45:02,654 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1372 transitions. Word has length 22 [2020-02-10 19:45:02,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:02,654 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1372 transitions. [2020-02-10 19:45:02,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1372 transitions. [2020-02-10 19:45:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:02,655 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:02,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 19:45:02,655 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 19:45:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:02,655 INFO L82 PathProgramCache]: Analyzing trace with hash 336283280, now seen corresponding path program 172 times [2020-02-10 19:45:02,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:02,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29366239] [2020-02-10 19:45:02,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45: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 19:45:02,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29366239] [2020-02-10 19:45:02,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:02,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:02,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362387402] [2020-02-10 19:45:02,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:02,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:02,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:02,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:02,920 INFO L87 Difference]: Start difference. First operand 394 states and 1372 transitions. Second operand 9 states. [2020-02-10 19:45:03,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:03,036 INFO L93 Difference]: Finished difference Result 606 states and 1808 transitions. [2020-02-10 19:45:03,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:03,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:03,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:03,039 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:45:03,039 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:45:03,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 19:45:03,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:45:03,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 391. [2020-02-10 19:45:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1365 transitions. [2020-02-10 19:45:03,049 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1365 transitions. Word has length 22 [2020-02-10 19:45:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:03,049 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1365 transitions. [2020-02-10 19:45:03,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1365 transitions. [2020-02-10 19:45:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:03,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:03,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 19:45:03,050 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 19:45:03,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:03,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2078734888, now seen corresponding path program 173 times [2020-02-10 19:45:03,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:03,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744015702] [2020-02-10 19:45:03,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:03,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 19:45:03,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744015702] [2020-02-10 19:45:03,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:03,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:03,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294835146] [2020-02-10 19:45:03,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:03,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:03,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:03,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:03,324 INFO L87 Difference]: Start difference. First operand 391 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:45:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:03,438 INFO L93 Difference]: Finished difference Result 601 states and 1799 transitions. [2020-02-10 19:45:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:03,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:03,440 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:45:03,440 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:45:03,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 19:45:03,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:45:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 393. [2020-02-10 19:45:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1368 transitions. [2020-02-10 19:45:03,451 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1368 transitions. Word has length 22 [2020-02-10 19:45:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:03,451 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1368 transitions. [2020-02-10 19:45:03,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1368 transitions. [2020-02-10 19:45:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:03,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:03,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 19:45:03,452 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 19:45:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash -736802100, now seen corresponding path program 174 times [2020-02-10 19:45:03,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:03,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248040286] [2020-02-10 19:45:03,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:03,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 19:45:03,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248040286] [2020-02-10 19:45:03,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:03,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:03,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672604823] [2020-02-10 19:45:03,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:03,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:03,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:03,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:03,724 INFO L87 Difference]: Start difference. First operand 393 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:45:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:03,834 INFO L93 Difference]: Finished difference Result 600 states and 1795 transitions. [2020-02-10 19:45:03,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:03,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:03,836 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:45:03,836 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:45:03,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 19:45:03,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:45:03,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 388. [2020-02-10 19:45:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:45:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1358 transitions. [2020-02-10 19:45:03,848 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1358 transitions. Word has length 22 [2020-02-10 19:45:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:03,848 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1358 transitions. [2020-02-10 19:45:03,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1358 transitions. [2020-02-10 19:45:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:03,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:03,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 19:45:03,849 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 19:45:03,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:03,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2073803932, now seen corresponding path program 175 times [2020-02-10 19:45:03,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:03,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787145996] [2020-02-10 19:45:03,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:04,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 19:45:04,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787145996] [2020-02-10 19:45:04,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:04,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:04,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727219611] [2020-02-10 19:45:04,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:04,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:04,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:04,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:04,124 INFO L87 Difference]: Start difference. First operand 388 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:45:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:04,212 INFO L93 Difference]: Finished difference Result 622 states and 1849 transitions. [2020-02-10 19:45:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:04,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:04,214 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:45:04,214 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:45:04,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:04,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:45:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 396. [2020-02-10 19:45:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:45:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1378 transitions. [2020-02-10 19:45:04,225 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1378 transitions. Word has length 22 [2020-02-10 19:45:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:04,226 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1378 transitions. [2020-02-10 19:45:04,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1378 transitions. [2020-02-10 19:45:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:04,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:04,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 19:45:04,226 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 19:45:04,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:04,227 INFO L82 PathProgramCache]: Analyzing trace with hash -483538046, now seen corresponding path program 176 times [2020-02-10 19:45:04,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:04,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544583039] [2020-02-10 19:45:04,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:04,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 19:45:04,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544583039] [2020-02-10 19:45:04,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:04,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:04,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143963915] [2020-02-10 19:45:04,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:04,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:04,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:04,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:04,493 INFO L87 Difference]: Start difference. First operand 396 states and 1378 transitions. Second operand 9 states. [2020-02-10 19:45:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:04,602 INFO L93 Difference]: Finished difference Result 617 states and 1836 transitions. [2020-02-10 19:45:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:04,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:04,604 INFO L225 Difference]: With dead ends: 617 [2020-02-10 19:45:04,604 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:45:04,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 19:45:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:45:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 392. [2020-02-10 19:45:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:45:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1368 transitions. [2020-02-10 19:45:04,614 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1368 transitions. Word has length 22 [2020-02-10 19:45:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:04,615 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1368 transitions. [2020-02-10 19:45:04,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1368 transitions. [2020-02-10 19:45:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:04,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:04,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 19:45:04,615 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 19:45:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:04,616 INFO L82 PathProgramCache]: Analyzing trace with hash -741241004, now seen corresponding path program 177 times [2020-02-10 19:45:04,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:04,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297046135] [2020-02-10 19:45:04,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:04,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 19:45:04,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297046135] [2020-02-10 19:45:04,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:04,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:04,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64853687] [2020-02-10 19:45:04,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:04,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:04,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:04,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:04,910 INFO L87 Difference]: Start difference. First operand 392 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:45:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:04,995 INFO L93 Difference]: Finished difference Result 626 states and 1855 transitions. [2020-02-10 19:45:04,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:04,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:04,998 INFO L225 Difference]: With dead ends: 626 [2020-02-10 19:45:04,998 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:45:04,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 19:45:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:45:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 398. [2020-02-10 19:45:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:45:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1378 transitions. [2020-02-10 19:45:05,015 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1378 transitions. Word has length 22 [2020-02-10 19:45:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:05,015 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1378 transitions. [2020-02-10 19:45:05,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1378 transitions. [2020-02-10 19:45:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:05,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:05,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 19:45:05,016 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 19:45:05,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1962626264, now seen corresponding path program 178 times [2020-02-10 19:45:05,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:05,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725205640] [2020-02-10 19:45:05,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:05,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 19:45:05,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725205640] [2020-02-10 19:45:05,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:05,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:05,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989308386] [2020-02-10 19:45:05,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:05,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:05,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:05,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:05,287 INFO L87 Difference]: Start difference. First operand 398 states and 1378 transitions. Second operand 9 states. [2020-02-10 19:45:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:05,405 INFO L93 Difference]: Finished difference Result 623 states and 1844 transitions. [2020-02-10 19:45:05,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:05,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:05,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:05,408 INFO L225 Difference]: With dead ends: 623 [2020-02-10 19:45:05,408 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 19:45:05,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 19:45:05,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 19:45:05,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 392. [2020-02-10 19:45:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:45:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-02-10 19:45:05,417 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-02-10 19:45:05,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:05,417 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-02-10 19:45:05,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-02-10 19:45:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:05,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:05,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 19:45:05,418 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 19:45:05,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:05,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1956537418, now seen corresponding path program 179 times [2020-02-10 19:45:05,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:05,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631730640] [2020-02-10 19:45:05,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:05,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 19:45:05,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631730640] [2020-02-10 19:45:05,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:05,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:05,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884982632] [2020-02-10 19:45:05,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:05,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:05,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:05,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:05,686 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:45:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:05,803 INFO L93 Difference]: Finished difference Result 613 states and 1825 transitions. [2020-02-10 19:45:05,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:05,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:05,806 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:45:05,806 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:45:05,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 19:45:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:45:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 395. [2020-02-10 19:45:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:45:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1369 transitions. [2020-02-10 19:45:05,816 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1369 transitions. Word has length 22 [2020-02-10 19:45:05,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:05,816 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1369 transitions. [2020-02-10 19:45:05,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:05,816 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1369 transitions. [2020-02-10 19:45:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:05,817 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45: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 19:45:05,817 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 19:45:05,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:05,817 INFO L82 PathProgramCache]: Analyzing trace with hash -227490084, now seen corresponding path program 180 times [2020-02-10 19:45:05,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:05,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527505194] [2020-02-10 19:45:05,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:06,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 19:45:06,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527505194] [2020-02-10 19:45:06,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:06,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:06,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639332199] [2020-02-10 19:45:06,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:06,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:06,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:06,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:06,084 INFO L87 Difference]: Start difference. First operand 395 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:45:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:06,205 INFO L93 Difference]: Finished difference Result 615 states and 1826 transitions. [2020-02-10 19:45:06,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:06,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:06,207 INFO L225 Difference]: With dead ends: 615 [2020-02-10 19:45:06,208 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 19:45:06,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 19:45:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 388. [2020-02-10 19:45:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:45:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1355 transitions. [2020-02-10 19:45:06,218 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1355 transitions. Word has length 22 [2020-02-10 19:45:06,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:06,219 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1355 transitions. [2020-02-10 19:45:06,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:06,219 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1355 transitions. [2020-02-10 19:45:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:06,219 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:06,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 19:45:06,219 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 19:45:06,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:06,220 INFO L82 PathProgramCache]: Analyzing trace with hash -485724428, now seen corresponding path program 181 times [2020-02-10 19:45:06,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:06,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622978000] [2020-02-10 19:45:06,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:06,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 19:45:06,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622978000] [2020-02-10 19:45:06,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:06,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:06,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031803534] [2020-02-10 19:45:06,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:06,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:06,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:06,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:06,495 INFO L87 Difference]: Start difference. First operand 388 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:45:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:06,577 INFO L93 Difference]: Finished difference Result 616 states and 1829 transitions. [2020-02-10 19:45:06,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:06,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:06,579 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:45:06,579 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:45:06,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 19:45:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:45:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 394. [2020-02-10 19:45:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:45:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1369 transitions. [2020-02-10 19:45:06,590 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1369 transitions. Word has length 22 [2020-02-10 19:45:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:06,590 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1369 transitions. [2020-02-10 19:45:06,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1369 transitions. [2020-02-10 19:45:06,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:06,591 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:06,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 19:45:06,591 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 19:45:06,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:06,591 INFO L82 PathProgramCache]: Analyzing trace with hash -359088054, now seen corresponding path program 182 times [2020-02-10 19:45:06,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:06,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559028714] [2020-02-10 19:45:06,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:06,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 19:45:06,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559028714] [2020-02-10 19:45:06,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:06,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:06,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26259311] [2020-02-10 19:45:06,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:06,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:06,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:06,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:06,864 INFO L87 Difference]: Start difference. First operand 394 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:45:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:06,978 INFO L93 Difference]: Finished difference Result 610 states and 1815 transitions. [2020-02-10 19:45:06,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:06,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:06,980 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:45:06,980 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 19:45:06,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 19:45:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 19:45:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 391. [2020-02-10 19:45:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 19:45:06,990 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 19:45:06,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:06,990 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 19:45:06,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 19:45:06,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:06,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:06,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 19:45:06,991 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 19:45:06,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:06,991 INFO L82 PathProgramCache]: Analyzing trace with hash 49505374, now seen corresponding path program 183 times [2020-02-10 19:45:06,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:06,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941321009] [2020-02-10 19:45:06,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:07,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 19:45:07,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941321009] [2020-02-10 19:45:07,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:07,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:07,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832854990] [2020-02-10 19:45:07,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:07,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:07,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:07,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:07,273 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:45:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:07,354 INFO L93 Difference]: Finished difference Result 622 states and 1841 transitions. [2020-02-10 19:45:07,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:07,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:07,356 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:45:07,356 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:45:07,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 19:45:07,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:45:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 397. [2020-02-10 19:45:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:45:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1372 transitions. [2020-02-10 19:45:07,366 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1372 transitions. Word has length 22 [2020-02-10 19:45:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:07,366 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1372 transitions. [2020-02-10 19:45:07,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1372 transitions. [2020-02-10 19:45:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:07,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:07,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 19:45:07,367 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 19:45:07,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:07,368 INFO L82 PathProgramCache]: Analyzing trace with hash 795936300, now seen corresponding path program 184 times [2020-02-10 19:45:07,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:07,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221927536] [2020-02-10 19:45:07,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:07,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221927536] [2020-02-10 19:45:07,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:07,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:07,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534212839] [2020-02-10 19:45:07,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:07,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:07,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:07,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:07,650 INFO L87 Difference]: Start difference. First operand 397 states and 1372 transitions. Second operand 9 states. [2020-02-10 19:45:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:07,785 INFO L93 Difference]: Finished difference Result 619 states and 1830 transitions. [2020-02-10 19:45:07,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:07,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:07,788 INFO L225 Difference]: With dead ends: 619 [2020-02-10 19:45:07,788 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:45:07,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:45:07,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 391. [2020-02-10 19:45:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1359 transitions. [2020-02-10 19:45:07,798 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1359 transitions. Word has length 22 [2020-02-10 19:45:07,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:07,798 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1359 transitions. [2020-02-10 19:45:07,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1359 transitions. [2020-02-10 19:45:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:07,799 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:07,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 19:45:07,799 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 19:45:07,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:07,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1970029012, now seen corresponding path program 185 times [2020-02-10 19:45:07,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:07,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546245643] [2020-02-10 19:45:07,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:08,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 19:45:08,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546245643] [2020-02-10 19:45:08,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:08,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:08,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977396011] [2020-02-10 19:45:08,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:08,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:08,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:08,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:08,076 INFO L87 Difference]: Start difference. First operand 391 states and 1359 transitions. Second operand 9 states. [2020-02-10 19:45:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:08,188 INFO L93 Difference]: Finished difference Result 606 states and 1805 transitions. [2020-02-10 19:45:08,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:08,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:08,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:08,190 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:45:08,190 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:45:08,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 19:45:08,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:45:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 393. [2020-02-10 19:45:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-02-10 19:45:08,201 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-02-10 19:45:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:08,201 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-02-10 19:45:08,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-02-10 19:45:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:08,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:08,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 19:45:08,203 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 19:45:08,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:08,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1398574206, now seen corresponding path program 186 times [2020-02-10 19:45:08,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:08,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631320212] [2020-02-10 19:45:08,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:08,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 19:45:08,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631320212] [2020-02-10 19:45:08,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:08,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:08,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420503457] [2020-02-10 19:45:08,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:08,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:08,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:08,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:08,468 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:45:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:08,583 INFO L93 Difference]: Finished difference Result 609 states and 1809 transitions. [2020-02-10 19:45:08,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:08,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:08,585 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:45:08,585 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:45:08,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 19:45:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:45:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 388. [2020-02-10 19:45:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:45:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1352 transitions. [2020-02-10 19:45:08,596 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1352 transitions. Word has length 22 [2020-02-10 19:45:08,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:08,596 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1352 transitions. [2020-02-10 19:45:08,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1352 transitions. [2020-02-10 19:45:08,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:08,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:08,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 19:45:08,597 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 19:45:08,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:08,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1680014634, now seen corresponding path program 187 times [2020-02-10 19:45:08,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:08,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877676879] [2020-02-10 19:45:08,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:08,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 19:45:08,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877676879] [2020-02-10 19:45:08,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:08,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:08,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708799290] [2020-02-10 19:45:08,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:08,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:08,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:08,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:08,868 INFO L87 Difference]: Start difference. First operand 388 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:45:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:08,985 INFO L93 Difference]: Finished difference Result 595 states and 1784 transitions. [2020-02-10 19:45:08,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:08,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:08,988 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:45:08,988 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:45:08,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 19:45:08,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:45:08,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 392. [2020-02-10 19:45:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:45:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-02-10 19:45:08,999 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-02-10 19:45:08,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:08,999 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-02-10 19:45:08,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-02-10 19:45:08,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:08,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:08,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 19:45:09,000 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 19:45:09,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:09,000 INFO L82 PathProgramCache]: Analyzing trace with hash -338081846, now seen corresponding path program 188 times [2020-02-10 19:45:09,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:09,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832187432] [2020-02-10 19:45:09,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:09,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 19:45:09,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832187432] [2020-02-10 19:45:09,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:09,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:09,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360023870] [2020-02-10 19:45:09,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:09,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:09,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:09,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:09,269 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:45:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:09,388 INFO L93 Difference]: Finished difference Result 594 states and 1780 transitions. [2020-02-10 19:45:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:09,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:09,390 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:45:09,390 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:45:09,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:45:09,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 390. [2020-02-10 19:45:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-02-10 19:45:09,401 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-02-10 19:45:09,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:09,401 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-02-10 19:45:09,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:09,401 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-02-10 19:45:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:09,402 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:09,402 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:09,402 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 19:45:09,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:09,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1144784832, now seen corresponding path program 189 times [2020-02-10 19:45:09,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:09,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85315572] [2020-02-10 19:45:09,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45: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 19:45:09,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85315572] [2020-02-10 19:45:09,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:09,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:09,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430423996] [2020-02-10 19:45:09,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:09,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:09,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:09,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:09,669 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:45:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:09,787 INFO L93 Difference]: Finished difference Result 599 states and 1791 transitions. [2020-02-10 19:45:09,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:09,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:09,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:09,789 INFO L225 Difference]: With dead ends: 599 [2020-02-10 19:45:09,789 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:45:09,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 19:45:09,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:45:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 393. [2020-02-10 19:45:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-02-10 19:45:09,799 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-02-10 19:45:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:09,799 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-02-10 19:45:09,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-02-10 19:45:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:09,800 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:09,800 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:09,800 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 19:45:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:09,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1373173840, now seen corresponding path program 190 times [2020-02-10 19:45:09,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:09,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963595046] [2020-02-10 19:45:09,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:10,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 19:45:10,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963595046] [2020-02-10 19:45:10,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:10,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:10,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585703578] [2020-02-10 19:45:10,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:10,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:10,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:10,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:10,061 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:45:10,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:10,175 INFO L93 Difference]: Finished difference Result 601 states and 1792 transitions. [2020-02-10 19:45:10,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:10,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:10,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:10,177 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:45:10,177 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:45:10,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:10,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:45:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 390. [2020-02-10 19:45:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1355 transitions. [2020-02-10 19:45:10,187 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1355 transitions. Word has length 22 [2020-02-10 19:45:10,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:10,187 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1355 transitions. [2020-02-10 19:45:10,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1355 transitions. [2020-02-10 19:45:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:10,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:10,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 19:45:10,188 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 19:45:10,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:10,188 INFO L82 PathProgramCache]: Analyzing trace with hash -875937424, now seen corresponding path program 191 times [2020-02-10 19:45:10,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:10,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085238767] [2020-02-10 19:45:10,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:10,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 19:45:10,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085238767] [2020-02-10 19:45:10,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:10,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:10,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282279260] [2020-02-10 19:45:10,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:10,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:10,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:10,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:10,456 INFO L87 Difference]: Start difference. First operand 390 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:45:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:10,555 INFO L93 Difference]: Finished difference Result 596 states and 1782 transitions. [2020-02-10 19:45:10,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:10,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:10,557 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:45:10,557 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:45:10,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 19:45:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:45:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 392. [2020-02-10 19:45:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:45:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1358 transitions. [2020-02-10 19:45:10,568 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1358 transitions. Word has length 22 [2020-02-10 19:45:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:10,568 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1358 transitions. [2020-02-10 19:45:10,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1358 transitions. [2020-02-10 19:45:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:10,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:10,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 19:45:10,569 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 19:45:10,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:10,569 INFO L82 PathProgramCache]: Analyzing trace with hash -304482618, now seen corresponding path program 192 times [2020-02-10 19:45:10,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:10,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530863754] [2020-02-10 19:45:10,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:10,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:10,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530863754] [2020-02-10 19:45:10,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:10,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:10,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753148503] [2020-02-10 19:45:10,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:10,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:10,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:10,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:10,828 INFO L87 Difference]: Start difference. First operand 392 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:45:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:10,937 INFO L93 Difference]: Finished difference Result 599 states and 1786 transitions. [2020-02-10 19:45:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:10,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:10,939 INFO L225 Difference]: With dead ends: 599 [2020-02-10 19:45:10,939 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:45:10,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 19:45:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:45:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 385. [2020-02-10 19:45:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:45:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1346 transitions. [2020-02-10 19:45:10,949 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1346 transitions. Word has length 22 [2020-02-10 19:45:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:10,949 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1346 transitions. [2020-02-10 19:45:10,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1346 transitions. [2020-02-10 19:45:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:10,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:10,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 19:45:10,950 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 19:45:10,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:10,950 INFO L82 PathProgramCache]: Analyzing trace with hash -681425196, now seen corresponding path program 193 times [2020-02-10 19:45:10,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:10,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380274707] [2020-02-10 19:45:10,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:11,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 19:45:11,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380274707] [2020-02-10 19:45:11,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:11,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:11,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266310609] [2020-02-10 19:45:11,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:11,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:11,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:11,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:11,246 INFO L87 Difference]: Start difference. First operand 385 states and 1346 transitions. Second operand 9 states. [2020-02-10 19:45:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:11,333 INFO L93 Difference]: Finished difference Result 592 states and 1761 transitions. [2020-02-10 19:45:11,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:11,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:11,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:11,335 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:45:11,335 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:45:11,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:45:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 391. [2020-02-10 19:45:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 19:45:11,346 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 19:45:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:11,346 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 19:45:11,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 19:45:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:11,346 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:11,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 19:45:11,347 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 19:45:11,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:11,347 INFO L82 PathProgramCache]: Analyzing trace with hash -120356704, now seen corresponding path program 194 times [2020-02-10 19:45:11,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:11,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674365098] [2020-02-10 19:45:11,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:11,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 19:45:11,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674365098] [2020-02-10 19:45:11,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:11,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:11,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950778323] [2020-02-10 19:45:11,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:11,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:11,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:11,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:11,640 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:45:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:11,722 INFO L93 Difference]: Finished difference Result 585 states and 1746 transitions. [2020-02-10 19:45:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:11,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:11,724 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:45:11,724 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:45:11,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 19:45:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:45:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 389. [2020-02-10 19:45:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:45:11,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-02-10 19:45:11,734 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-02-10 19:45:11,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:11,734 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-02-10 19:45:11,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-02-10 19:45:11,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:11,735 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:11,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 19:45:11,735 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 19:45:11,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2013104246, now seen corresponding path program 195 times [2020-02-10 19:45:11,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:11,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187358302] [2020-02-10 19:45:11,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:12,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187358302] [2020-02-10 19:45:12,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:12,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:12,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408728868] [2020-02-10 19:45:12,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:12,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:12,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:12,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:12,016 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:45:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:12,097 INFO L93 Difference]: Finished difference Result 594 states and 1764 transitions. [2020-02-10 19:45:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:12,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:12,099 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:45:12,099 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:45:12,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:45:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 392. [2020-02-10 19:45:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:45:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-02-10 19:45:12,109 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-02-10 19:45:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:12,109 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-02-10 19:45:12,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-02-10 19:45:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:12,110 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:12,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 19:45:12,110 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 19:45:12,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:12,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1050900584, now seen corresponding path program 196 times [2020-02-10 19:45:12,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:12,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067067862] [2020-02-10 19:45:12,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:12,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 19:45:12,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067067862] [2020-02-10 19:45:12,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:12,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:12,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077895209] [2020-02-10 19:45:12,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:12,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:12,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:12,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:12,394 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:45:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:12,525 INFO L93 Difference]: Finished difference Result 588 states and 1750 transitions. [2020-02-10 19:45:12,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:12,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:12,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:12,527 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:45:12,527 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:45:12,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:45:12,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 389. [2020-02-10 19:45:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:45:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-02-10 19:45:12,538 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-02-10 19:45:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:12,538 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-02-10 19:45:12,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-02-10 19:45:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:12,538 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:12,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 19:45:12,539 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 19:45:12,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:12,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2067826472, now seen corresponding path program 197 times [2020-02-10 19:45:12,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:12,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656785698] [2020-02-10 19:45:12,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:12,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 19:45:12,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656785698] [2020-02-10 19:45:12,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:12,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:12,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344844560] [2020-02-10 19:45:12,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:12,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:12,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:12,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:12,841 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:45:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:12,926 INFO L93 Difference]: Finished difference Result 578 states and 1731 transitions. [2020-02-10 19:45:12,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:12,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:12,928 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:45:12,928 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 19:45:12,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 19:45:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 390. [2020-02-10 19:45:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-02-10 19:45:12,937 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-02-10 19:45:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:12,938 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-02-10 19:45:12,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-02-10 19:45:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:12,938 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:12,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 19:45:12,938 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 19:45:12,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:12,939 INFO L82 PathProgramCache]: Analyzing trace with hash -616199866, now seen corresponding path program 198 times [2020-02-10 19:45:12,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:12,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870867401] [2020-02-10 19:45:12,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:13,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 19:45:13,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870867401] [2020-02-10 19:45:13,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:13,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:13,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210937547] [2020-02-10 19:45:13,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:13,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:13,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:13,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:13,233 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:45:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:13,338 INFO L93 Difference]: Finished difference Result 579 states and 1732 transitions. [2020-02-10 19:45:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:13,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:13,340 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:45:13,340 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:45:13,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:45:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 387. [2020-02-10 19:45:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:45:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1352 transitions. [2020-02-10 19:45:13,349 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1352 transitions. Word has length 22 [2020-02-10 19:45:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:13,349 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1352 transitions. [2020-02-10 19:45:13,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1352 transitions. [2020-02-10 19:45:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:13,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:13,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 19:45:13,350 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 19:45:13,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:13,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1721660994, now seen corresponding path program 199 times [2020-02-10 19:45:13,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:13,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724795871] [2020-02-10 19:45:13,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:13,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 19:45:13,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724795871] [2020-02-10 19:45:13,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:13,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:13,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23057366] [2020-02-10 19:45:13,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:13,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:13,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:13,637 INFO L87 Difference]: Start difference. First operand 387 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:45:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:13,725 INFO L93 Difference]: Finished difference Result 598 states and 1774 transitions. [2020-02-10 19:45:13,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:13,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:13,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:13,727 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:45:13,727 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:45:13,728 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:45:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 391. [2020-02-10 19:45:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1360 transitions. [2020-02-10 19:45:13,738 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1360 transitions. Word has length 22 [2020-02-10 19:45:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:13,738 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1360 transitions. [2020-02-10 19:45:13,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1360 transitions. [2020-02-10 19:45:13,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:13,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:13,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 19:45:13,739 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 19:45:13,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:13,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1160592502, now seen corresponding path program 200 times [2020-02-10 19:45:13,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:13,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96814829] [2020-02-10 19:45:13,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:14,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 19:45:14,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96814829] [2020-02-10 19:45:14,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:14,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:14,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950836629] [2020-02-10 19:45:14,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:14,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:14,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:14,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:14,057 INFO L87 Difference]: Start difference. First operand 391 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:45:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:14,146 INFO L93 Difference]: Finished difference Result 591 states and 1759 transitions. [2020-02-10 19:45:14,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:14,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:14,148 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:45:14,148 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:45:14,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:14,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:45:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 389. [2020-02-10 19:45:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:45:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-02-10 19:45:14,159 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-02-10 19:45:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:14,159 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-02-10 19:45:14,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-02-10 19:45:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:14,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:14,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 19:45:14,160 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 19:45:14,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:14,161 INFO L82 PathProgramCache]: Analyzing trace with hash 385123126, now seen corresponding path program 201 times [2020-02-10 19:45:14,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:14,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95894301] [2020-02-10 19:45:14,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:14,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 19:45:14,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95894301] [2020-02-10 19:45:14,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:14,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:14,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231163248] [2020-02-10 19:45:14,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:14,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:14,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:14,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:14,470 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:45:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:14,555 INFO L93 Difference]: Finished difference Result 606 states and 1792 transitions. [2020-02-10 19:45:14,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:14,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:14,557 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:45:14,557 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:45:14,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:45:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 395. [2020-02-10 19:45:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:45:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1366 transitions. [2020-02-10 19:45:14,566 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1366 transitions. Word has length 22 [2020-02-10 19:45:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:14,566 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1366 transitions. [2020-02-10 19:45:14,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1366 transitions. [2020-02-10 19:45:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:14,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:14,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:14,567 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 19:45:14,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash 577943818, now seen corresponding path program 202 times [2020-02-10 19:45:14,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:14,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110690889] [2020-02-10 19:45:14,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:14,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 19:45:14,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110690889] [2020-02-10 19:45:14,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:14,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:14,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71706663] [2020-02-10 19:45:14,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:14,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:14,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:14,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:14,851 INFO L87 Difference]: Start difference. First operand 395 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:45:14,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:14,969 INFO L93 Difference]: Finished difference Result 603 states and 1781 transitions. [2020-02-10 19:45:14,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:14,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:14,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:14,971 INFO L225 Difference]: With dead ends: 603 [2020-02-10 19:45:14,972 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:45:14,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 19:45:14,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:45:14,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 389. [2020-02-10 19:45:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:45:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1354 transitions. [2020-02-10 19:45:14,982 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1354 transitions. Word has length 22 [2020-02-10 19:45:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:14,983 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1354 transitions. [2020-02-10 19:45:14,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1354 transitions. [2020-02-10 19:45:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:14,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:14,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 19:45:14,984 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 19:45:14,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:14,984 INFO L82 PathProgramCache]: Analyzing trace with hash 439845352, now seen corresponding path program 203 times [2020-02-10 19:45:14,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:14,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207136217] [2020-02-10 19:45:14,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:15,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207136217] [2020-02-10 19:45:15,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:15,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:15,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870978151] [2020-02-10 19:45:15,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:15,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:15,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:15,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:15,283 INFO L87 Difference]: Start difference. First operand 389 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:45:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:15,380 INFO L93 Difference]: Finished difference Result 587 states and 1750 transitions. [2020-02-10 19:45:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:15,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:15,382 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:45:15,383 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:45:15,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:15,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:45:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 390. [2020-02-10 19:45:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1355 transitions. [2020-02-10 19:45:15,393 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1355 transitions. Word has length 22 [2020-02-10 19:45:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:15,393 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1355 transitions. [2020-02-10 19:45:15,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1355 transitions. [2020-02-10 19:45:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:15,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:15,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 19:45:15,394 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 19:45:15,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:15,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1708951184, now seen corresponding path program 204 times [2020-02-10 19:45:15,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:15,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586042672] [2020-02-10 19:45:15,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:15,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 19:45:15,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586042672] [2020-02-10 19:45:15,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:15,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:15,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925460036] [2020-02-10 19:45:15,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:15,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:15,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:15,684 INFO L87 Difference]: Start difference. First operand 390 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:45:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:15,793 INFO L93 Difference]: Finished difference Result 591 states and 1757 transitions. [2020-02-10 19:45:15,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:15,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:15,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:15,795 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:45:15,796 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:45:15,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:45:15,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 387. [2020-02-10 19:45:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:45:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1350 transitions. [2020-02-10 19:45:15,807 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1350 transitions. Word has length 22 [2020-02-10 19:45:15,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:15,808 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1350 transitions. [2020-02-10 19:45:15,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1350 transitions. [2020-02-10 19:45:15,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:15,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:15,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 19:45:15,809 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 19:45:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:15,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1396064770, now seen corresponding path program 205 times [2020-02-10 19:45:15,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:15,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409119212] [2020-02-10 19:45:15,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:16,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 19:45:16,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409119212] [2020-02-10 19:45:16,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:16,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:16,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201999044] [2020-02-10 19:45:16,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:16,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:16,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:16,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:16,104 INFO L87 Difference]: Start difference. First operand 387 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:45:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:16,188 INFO L93 Difference]: Finished difference Result 604 states and 1789 transitions. [2020-02-10 19:45:16,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:16,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:16,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:16,190 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:45:16,190 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:45:16,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 19:45:16,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:45:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 393. [2020-02-10 19:45:16,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1364 transitions. [2020-02-10 19:45:16,200 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1364 transitions. Word has length 22 [2020-02-10 19:45:16,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:16,200 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1364 transitions. [2020-02-10 19:45:16,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1364 transitions. [2020-02-10 19:45:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:16,201 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:16,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 19:45:16,201 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 19:45:16,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:16,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1936698864, now seen corresponding path program 206 times [2020-02-10 19:45:16,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:16,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730402415] [2020-02-10 19:45:16,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:16,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 19:45:16,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730402415] [2020-02-10 19:45:16,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:16,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:16,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950771145] [2020-02-10 19:45:16,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:16,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:16,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:16,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:16,485 INFO L87 Difference]: Start difference. First operand 393 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:45:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:16,587 INFO L93 Difference]: Finished difference Result 598 states and 1775 transitions. [2020-02-10 19:45:16,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:16,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:16,589 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:45:16,589 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:45:16,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 19:45:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:45:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 390. [2020-02-10 19:45:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-02-10 19:45:16,600 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-02-10 19:45:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:16,600 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-02-10 19:45:16,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-02-10 19:45:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:16,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:16,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 19:45:16,601 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 19:45:16,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:16,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1983810092, now seen corresponding path program 207 times [2020-02-10 19:45:16,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:16,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728680015] [2020-02-10 19:45:16,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:16,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 19:45:16,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728680015] [2020-02-10 19:45:16,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:16,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:16,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336264007] [2020-02-10 19:45:16,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:16,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:16,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:16,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:16,894 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:45:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:16,975 INFO L93 Difference]: Finished difference Result 610 states and 1801 transitions. [2020-02-10 19:45:16,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:16,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:16,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:16,977 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:45:16,977 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:45:16,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 19:45:16,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:45:16,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 396. [2020-02-10 19:45:16,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:45:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1367 transitions. [2020-02-10 19:45:16,988 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1367 transitions. Word has length 22 [2020-02-10 19:45:16,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:16,988 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1367 transitions. [2020-02-10 19:45:16,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:16,988 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1367 transitions. [2020-02-10 19:45:16,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:16,989 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:16,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 19:45:16,989 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 19:45:16,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:16,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1790989400, now seen corresponding path program 208 times [2020-02-10 19:45:16,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:16,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433937108] [2020-02-10 19:45:16,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:17,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 19:45:17,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433937108] [2020-02-10 19:45:17,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:17,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:17,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224146717] [2020-02-10 19:45:17,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:17,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:17,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:17,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:17,270 INFO L87 Difference]: Start difference. First operand 396 states and 1367 transitions. Second operand 9 states. [2020-02-10 19:45:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:17,383 INFO L93 Difference]: Finished difference Result 607 states and 1790 transitions. [2020-02-10 19:45:17,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:17,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:17,385 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:45:17,385 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:45:17,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 19:45:17,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:45:17,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 390. [2020-02-10 19:45:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1354 transitions. [2020-02-10 19:45:17,395 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1354 transitions. Word has length 22 [2020-02-10 19:45:17,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:17,396 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1354 transitions. [2020-02-10 19:45:17,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1354 transitions. [2020-02-10 19:45:17,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:17,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:17,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 19:45:17,403 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 19:45:17,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:17,404 INFO L82 PathProgramCache]: Analyzing trace with hash 343709836, now seen corresponding path program 209 times [2020-02-10 19:45:17,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:17,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851303019] [2020-02-10 19:45:17,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:17,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 19:45:17,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851303019] [2020-02-10 19:45:17,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:17,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:17,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745815205] [2020-02-10 19:45:17,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:17,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:17,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:17,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:17,687 INFO L87 Difference]: Start difference. First operand 390 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:45:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:17,797 INFO L93 Difference]: Finished difference Result 594 states and 1765 transitions. [2020-02-10 19:45:17,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:17,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:17,799 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:45:17,799 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:45:17,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:45:17,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 392. [2020-02-10 19:45:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:45:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1357 transitions. [2020-02-10 19:45:17,808 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1357 transitions. Word has length 22 [2020-02-10 19:45:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:17,808 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1357 transitions. [2020-02-10 19:45:17,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1357 transitions. [2020-02-10 19:45:17,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:17,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:17,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 19:45:17,809 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 19:45:17,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:17,809 INFO L82 PathProgramCache]: Analyzing trace with hash 915164642, now seen corresponding path program 210 times [2020-02-10 19:45:17,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:17,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487347311] [2020-02-10 19:45:17,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:18,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 19:45:18,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487347311] [2020-02-10 19:45:18,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:18,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:18,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927623588] [2020-02-10 19:45:18,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:18,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:18,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:18,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:18,086 INFO L87 Difference]: Start difference. First operand 392 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:45:18,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:18,211 INFO L93 Difference]: Finished difference Result 597 states and 1769 transitions. [2020-02-10 19:45:18,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:18,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:18,213 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:45:18,214 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:45:18,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:45:18,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 387. [2020-02-10 19:45:18,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:45:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1348 transitions. [2020-02-10 19:45:18,223 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1348 transitions. Word has length 22 [2020-02-10 19:45:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:18,223 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1348 transitions. [2020-02-10 19:45:18,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:18,223 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1348 transitions. [2020-02-10 19:45:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:18,224 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:18,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 19:45:18,224 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 19:45:18,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:18,224 INFO L82 PathProgramCache]: Analyzing trace with hash 141792394, now seen corresponding path program 211 times [2020-02-10 19:45:18,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:18,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277040442] [2020-02-10 19:45:18,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:18,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277040442] [2020-02-10 19:45:18,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:18,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:18,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117322028] [2020-02-10 19:45:18,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:18,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:18,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:18,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:18,526 INFO L87 Difference]: Start difference. First operand 387 states and 1348 transitions. Second operand 9 states. [2020-02-10 19:45:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:18,615 INFO L93 Difference]: Finished difference Result 572 states and 1717 transitions. [2020-02-10 19:45:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:18,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:18,617 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:45:18,617 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:45:18,617 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:45:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 389. [2020-02-10 19:45:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:45:18,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1352 transitions. [2020-02-10 19:45:18,627 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1352 transitions. Word has length 22 [2020-02-10 19:45:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:18,627 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1352 transitions. [2020-02-10 19:45:18,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:18,628 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1352 transitions. [2020-02-10 19:45:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:18,628 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:18,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 19:45:18,629 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 19:45:18,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:18,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1752733352, now seen corresponding path program 212 times [2020-02-10 19:45:18,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:18,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899309297] [2020-02-10 19:45:18,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:18,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 19:45:18,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899309297] [2020-02-10 19:45:18,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:18,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:18,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283162240] [2020-02-10 19:45:18,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:18,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:18,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:18,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:18,932 INFO L87 Difference]: Start difference. First operand 389 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:45:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:19,047 INFO L93 Difference]: Finished difference Result 573 states and 1718 transitions. [2020-02-10 19:45:19,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:19,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:19,049 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:45:19,049 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:45:19,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:45:19,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 388. [2020-02-10 19:45:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:45:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1350 transitions. [2020-02-10 19:45:19,059 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1350 transitions. Word has length 22 [2020-02-10 19:45:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:19,060 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1350 transitions. [2020-02-10 19:45:19,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1350 transitions. [2020-02-10 19:45:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:19,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45: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 19:45:19,060 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 19:45:19,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash -445952928, now seen corresponding path program 213 times [2020-02-10 19:45:19,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:19,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135086371] [2020-02-10 19:45:19,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:19,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 19:45:19,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135086371] [2020-02-10 19:45:19,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:19,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:19,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260520812] [2020-02-10 19:45:19,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:19,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:19,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:19,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:19,355 INFO L87 Difference]: Start difference. First operand 388 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:45:19,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:19,440 INFO L93 Difference]: Finished difference Result 575 states and 1722 transitions. [2020-02-10 19:45:19,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:19,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:19,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:19,442 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:45:19,443 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:45:19,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 19:45:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:45:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 389. [2020-02-10 19:45:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:45:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1351 transitions. [2020-02-10 19:45:19,453 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1351 transitions. Word has length 22 [2020-02-10 19:45:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:19,453 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1351 transitions. [2020-02-10 19:45:19,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1351 transitions. [2020-02-10 19:45:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:19,454 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:19,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 19:45:19,454 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 19:45:19,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:19,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1700217832, now seen corresponding path program 214 times [2020-02-10 19:45:19,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:19,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797737368] [2020-02-10 19:45:19,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:19,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 19:45:19,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797737368] [2020-02-10 19:45:19,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:19,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:19,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765000704] [2020-02-10 19:45:19,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:19,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:19,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:19,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:19,739 INFO L87 Difference]: Start difference. First operand 389 states and 1351 transitions. Second operand 9 states. [2020-02-10 19:45:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:19,847 INFO L93 Difference]: Finished difference Result 579 states and 1729 transitions. [2020-02-10 19:45:19,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:19,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:19,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:19,849 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:45:19,849 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:45:19,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:19,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:45:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 388. [2020-02-10 19:45:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:45:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1349 transitions. [2020-02-10 19:45:19,859 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1349 transitions. Word has length 22 [2020-02-10 19:45:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:19,859 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1349 transitions. [2020-02-10 19:45:19,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1349 transitions. [2020-02-10 19:45:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:19,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:19,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 19:45:19,860 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 19:45:19,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:19,860 INFO L82 PathProgramCache]: Analyzing trace with hash -435449824, now seen corresponding path program 215 times [2020-02-10 19:45:19,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:19,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85011308] [2020-02-10 19:45:19,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:20,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 19:45:20,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85011308] [2020-02-10 19:45:20,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:20,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:20,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312371431] [2020-02-10 19:45:20,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:20,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:20,148 INFO L87 Difference]: Start difference. First operand 388 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:45:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:20,263 INFO L93 Difference]: Finished difference Result 578 states and 1728 transitions. [2020-02-10 19:45:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:20,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:20,265 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:45:20,266 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:45:20,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 19:45:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:45:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 390. [2020-02-10 19:45:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1352 transitions. [2020-02-10 19:45:20,275 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1352 transitions. Word has length 22 [2020-02-10 19:45:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:20,275 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1352 transitions. [2020-02-10 19:45:20,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1352 transitions. [2020-02-10 19:45:20,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:20,276 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:20,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 19:45:20,276 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 19:45:20,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:20,276 INFO L82 PathProgramCache]: Analyzing trace with hash 99779978, now seen corresponding path program 216 times [2020-02-10 19:45:20,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:20,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451054350] [2020-02-10 19:45:20,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:20,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 19:45:20,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451054350] [2020-02-10 19:45:20,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:20,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:20,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007790988] [2020-02-10 19:45:20,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:20,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:20,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:20,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:20,571 INFO L87 Difference]: Start difference. First operand 390 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:45:20,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:20,684 INFO L93 Difference]: Finished difference Result 581 states and 1732 transitions. [2020-02-10 19:45:20,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:20,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:20,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:20,686 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:45:20,686 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:45:20,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 19:45:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:45:20,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-02-10 19:45:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:45:20,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1344 transitions. [2020-02-10 19:45:20,697 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1344 transitions. Word has length 22 [2020-02-10 19:45:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:20,697 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1344 transitions. [2020-02-10 19:45:20,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1344 transitions. [2020-02-10 19:45:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:20,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:20,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 19:45:20,698 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 19:45:20,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:20,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1131381302, now seen corresponding path program 217 times [2020-02-10 19:45:20,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:20,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368321509] [2020-02-10 19:45:20,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:20,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 19:45:20,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368321509] [2020-02-10 19:45:20,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:20,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:20,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031460403] [2020-02-10 19:45:20,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:20,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:20,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:20,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:20,999 INFO L87 Difference]: Start difference. First operand 385 states and 1344 transitions. Second operand 9 states. [2020-02-10 19:45:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:21,112 INFO L93 Difference]: Finished difference Result 559 states and 1689 transitions. [2020-02-10 19:45:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:21,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:21,114 INFO L225 Difference]: With dead ends: 559 [2020-02-10 19:45:21,114 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:45:21,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:21,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:45:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 388. [2020-02-10 19:45:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:45:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1352 transitions. [2020-02-10 19:45:21,126 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1352 transitions. Word has length 22 [2020-02-10 19:45:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:21,126 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1352 transitions. [2020-02-10 19:45:21,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1352 transitions. [2020-02-10 19:45:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:21,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:21,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 19:45:21,127 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 19:45:21,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:21,127 INFO L82 PathProgramCache]: Analyzing trace with hash -314135708, now seen corresponding path program 218 times [2020-02-10 19:45:21,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:21,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085853262] [2020-02-10 19:45:21,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:21,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 19:45:21,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085853262] [2020-02-10 19:45:21,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:21,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:21,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175144340] [2020-02-10 19:45:21,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:21,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:21,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:21,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:21,426 INFO L87 Difference]: Start difference. First operand 388 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:45:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:21,515 INFO L93 Difference]: Finished difference Result 557 states and 1684 transitions. [2020-02-10 19:45:21,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:21,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:21,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:21,517 INFO L225 Difference]: With dead ends: 557 [2020-02-10 19:45:21,517 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:45:21,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:21,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:45:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 387. [2020-02-10 19:45:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:45:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1350 transitions. [2020-02-10 19:45:21,527 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1350 transitions. Word has length 22 [2020-02-10 19:45:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:21,527 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1350 transitions. [2020-02-10 19:45:21,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1350 transitions. [2020-02-10 19:45:21,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:21,528 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:21,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 19:45:21,528 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 19:45:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash -469056552, now seen corresponding path program 219 times [2020-02-10 19:45:21,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:21,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377445934] [2020-02-10 19:45:21,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:21,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377445934] [2020-02-10 19:45:21,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:21,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:21,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545467645] [2020-02-10 19:45:21,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:21,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:21,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:21,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:21,832 INFO L87 Difference]: Start difference. First operand 387 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:45:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:21,949 INFO L93 Difference]: Finished difference Result 561 states and 1693 transitions. [2020-02-10 19:45:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:21,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:21,951 INFO L225 Difference]: With dead ends: 561 [2020-02-10 19:45:21,951 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 19:45:21,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 19:45:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 389. [2020-02-10 19:45:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:45:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1353 transitions. [2020-02-10 19:45:21,962 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1353 transitions. Word has length 22 [2020-02-10 19:45:21,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:21,962 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1353 transitions. [2020-02-10 19:45:21,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1353 transitions. [2020-02-10 19:45:21,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:21,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:21,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 19:45:21,963 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 19:45:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:21,963 INFO L82 PathProgramCache]: Analyzing trace with hash -215963800, now seen corresponding path program 220 times [2020-02-10 19:45:21,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:21,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193726581] [2020-02-10 19:45:21,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45: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 19:45:22,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193726581] [2020-02-10 19:45:22,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:22,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:22,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033772260] [2020-02-10 19:45:22,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:22,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:22,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:22,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:22,285 INFO L87 Difference]: Start difference. First operand 389 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:45:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:22,411 INFO L93 Difference]: Finished difference Result 560 states and 1689 transitions. [2020-02-10 19:45:22,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:22,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:22,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:22,413 INFO L225 Difference]: With dead ends: 560 [2020-02-10 19:45:22,413 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:45:22,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 19:45:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:45:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 387. [2020-02-10 19:45:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:45:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1349 transitions. [2020-02-10 19:45:22,423 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1349 transitions. Word has length 22 [2020-02-10 19:45:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:22,423 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1349 transitions. [2020-02-10 19:45:22,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1349 transitions. [2020-02-10 19:45:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:22,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:22,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 19:45:22,424 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 19:45:22,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:22,424 INFO L82 PathProgramCache]: Analyzing trace with hash 779955880, now seen corresponding path program 221 times [2020-02-10 19:45:22,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:22,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556453252] [2020-02-10 19:45:22,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:22,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 19:45:22,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556453252] [2020-02-10 19:45:22,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:22,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:22,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424131497] [2020-02-10 19:45:22,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:22,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:22,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:22,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:22,734 INFO L87 Difference]: Start difference. First operand 387 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:45:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:22,825 INFO L93 Difference]: Finished difference Result 556 states and 1681 transitions. [2020-02-10 19:45:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:22,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:22,827 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:45:22,827 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:45:22,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 19:45:22,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:45:22,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 388. [2020-02-10 19:45:22,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:45:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1350 transitions. [2020-02-10 19:45:22,838 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1350 transitions. Word has length 22 [2020-02-10 19:45:22,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:22,838 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1350 transitions. [2020-02-10 19:45:22,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1350 transitions. [2020-02-10 19:45:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:22,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:22,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 19:45:22,839 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 19:45:22,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:22,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1904070458, now seen corresponding path program 222 times [2020-02-10 19:45:22,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:22,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135990115] [2020-02-10 19:45:22,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:23,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 19:45:23,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135990115] [2020-02-10 19:45:23,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:23,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:23,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848365724] [2020-02-10 19:45:23,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:23,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:23,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:23,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:23,139 INFO L87 Difference]: Start difference. First operand 388 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:45:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:23,263 INFO L93 Difference]: Finished difference Result 557 states and 1682 transitions. [2020-02-10 19:45:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:23,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:23,265 INFO L225 Difference]: With dead ends: 557 [2020-02-10 19:45:23,266 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:45:23,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 19:45:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:45:23,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 386. [2020-02-10 19:45:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:45:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1347 transitions. [2020-02-10 19:45:23,276 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1347 transitions. Word has length 22 [2020-02-10 19:45:23,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:23,276 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1347 transitions. [2020-02-10 19:45:23,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1347 transitions. [2020-02-10 19:45:23,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:23,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:23,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 19:45:23,277 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 19:45:23,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:23,277 INFO L82 PathProgramCache]: Analyzing trace with hash 91145504, now seen corresponding path program 223 times [2020-02-10 19:45:23,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:23,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250886322] [2020-02-10 19:45:23,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:23,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250886322] [2020-02-10 19:45:23,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:23,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:23,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426352245] [2020-02-10 19:45:23,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:23,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:23,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:23,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:23,563 INFO L87 Difference]: Start difference. First operand 386 states and 1347 transitions. Second operand 9 states. [2020-02-10 19:45:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:23,687 INFO L93 Difference]: Finished difference Result 563 states and 1697 transitions. [2020-02-10 19:45:23,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:23,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:23,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:23,688 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:45:23,688 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:45:23,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:23,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:45:23,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 388. [2020-02-10 19:45:23,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:45:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1351 transitions. [2020-02-10 19:45:23,699 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1351 transitions. Word has length 22 [2020-02-10 19:45:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:23,700 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1351 transitions. [2020-02-10 19:45:23,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1351 transitions. [2020-02-10 19:45:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:23,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:23,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 19:45:23,701 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 19:45:23,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:23,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1354371506, now seen corresponding path program 224 times [2020-02-10 19:45:23,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:23,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875769956] [2020-02-10 19:45:23,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:24,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 19:45:24,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875769956] [2020-02-10 19:45:24,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:24,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:24,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43125140] [2020-02-10 19:45:24,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:24,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:24,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:24,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:24,004 INFO L87 Difference]: Start difference. First operand 388 states and 1351 transitions. Second operand 9 states. [2020-02-10 19:45:24,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:24,105 INFO L93 Difference]: Finished difference Result 561 states and 1692 transitions. [2020-02-10 19:45:24,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:24,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:24,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:24,107 INFO L225 Difference]: With dead ends: 561 [2020-02-10 19:45:24,107 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:45:24,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:24,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:45:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 387. [2020-02-10 19:45:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:45:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1349 transitions. [2020-02-10 19:45:24,117 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1349 transitions. Word has length 22 [2020-02-10 19:45:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:24,117 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1349 transitions. [2020-02-10 19:45:24,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1349 transitions. [2020-02-10 19:45:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:24,117 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:24,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:24,118 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 19:45:24,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:24,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2097037672, now seen corresponding path program 225 times [2020-02-10 19:45:24,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:24,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732876498] [2020-02-10 19:45:24,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:24,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 19:45:24,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732876498] [2020-02-10 19:45:24,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:24,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:24,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458200527] [2020-02-10 19:45:24,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:24,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:24,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:24,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:24,402 INFO L87 Difference]: Start difference. First operand 387 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:45:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:24,525 INFO L93 Difference]: Finished difference Result 569 states and 1710 transitions. [2020-02-10 19:45:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:24,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:24,527 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:45:24,527 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:45:24,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:24,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:45:24,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 390. [2020-02-10 19:45:24,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1354 transitions. [2020-02-10 19:45:24,539 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1354 transitions. Word has length 22 [2020-02-10 19:45:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:24,540 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1354 transitions. [2020-02-10 19:45:24,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1354 transitions. [2020-02-10 19:45:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:24,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:24,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:24,541 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 19:45:24,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:24,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1415930382, now seen corresponding path program 226 times [2020-02-10 19:45:24,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:24,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395730481] [2020-02-10 19:45:24,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:24,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 19:45:24,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395730481] [2020-02-10 19:45:24,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:24,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:24,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864967082] [2020-02-10 19:45:24,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:24,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:24,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:24,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:24,831 INFO L87 Difference]: Start difference. First operand 390 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:45:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:24,957 INFO L93 Difference]: Finished difference Result 571 states and 1711 transitions. [2020-02-10 19:45:24,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:24,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:24,959 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:45:24,959 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 19:45:24,960 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 19:45:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 387. [2020-02-10 19:45:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:45:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1348 transitions. [2020-02-10 19:45:24,969 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1348 transitions. Word has length 22 [2020-02-10 19:45:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:24,969 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1348 transitions. [2020-02-10 19:45:24,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1348 transitions. [2020-02-10 19:45:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:24,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:24,970 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:24,970 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 19:45:24,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:24,971 INFO L82 PathProgramCache]: Analyzing trace with hash -848025240, now seen corresponding path program 227 times [2020-02-10 19:45:24,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:24,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376778029] [2020-02-10 19:45:24,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:25,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 19:45:25,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376778029] [2020-02-10 19:45:25,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:25,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:25,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026859543] [2020-02-10 19:45:25,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:25,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:25,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:25,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:25,257 INFO L87 Difference]: Start difference. First operand 387 states and 1348 transitions. Second operand 9 states. [2020-02-10 19:45:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:25,355 INFO L93 Difference]: Finished difference Result 563 states and 1695 transitions. [2020-02-10 19:45:25,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:25,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:25,357 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:45:25,357 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:45:25,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:45:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 388. [2020-02-10 19:45:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:45:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1349 transitions. [2020-02-10 19:45:25,368 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1349 transitions. Word has length 22 [2020-02-10 19:45:25,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:25,368 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1349 transitions. [2020-02-10 19:45:25,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1349 transitions. [2020-02-10 19:45:25,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:25,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:25,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 19:45:25,369 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 19:45:25,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:25,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1298145520, now seen corresponding path program 228 times [2020-02-10 19:45:25,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:25,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893760475] [2020-02-10 19:45:25,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:25,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 19:45:25,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893760475] [2020-02-10 19:45:25,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:25,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:25,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441262472] [2020-02-10 19:45:25,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:25,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:25,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:25,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:25,670 INFO L87 Difference]: Start difference. First operand 388 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:45:25,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:25,778 INFO L93 Difference]: Finished difference Result 567 states and 1702 transitions. [2020-02-10 19:45:25,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:25,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:25,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:25,780 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:45:25,780 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:45:25,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:45:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 386. [2020-02-10 19:45:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:45:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1346 transitions. [2020-02-10 19:45:25,790 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1346 transitions. Word has length 22 [2020-02-10 19:45:25,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:25,790 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1346 transitions. [2020-02-10 19:45:25,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:25,790 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1346 transitions. [2020-02-10 19:45:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:25,791 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:25,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 19:45:25,791 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 19:45:25,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:25,791 INFO L82 PathProgramCache]: Analyzing trace with hash 416741728, now seen corresponding path program 229 times [2020-02-10 19:45:25,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:25,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401872470] [2020-02-10 19:45:25,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:26,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 19:45:26,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401872470] [2020-02-10 19:45:26,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:26,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:26,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631512587] [2020-02-10 19:45:26,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:26,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:26,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:26,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:26,080 INFO L87 Difference]: Start difference. First operand 386 states and 1346 transitions. Second operand 9 states. [2020-02-10 19:45:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:26,204 INFO L93 Difference]: Finished difference Result 569 states and 1713 transitions. [2020-02-10 19:45:26,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:26,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:26,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:26,206 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:45:26,206 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:45:26,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 19:45:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:45:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 390. [2020-02-10 19:45:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1356 transitions. [2020-02-10 19:45:26,216 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1356 transitions. Word has length 22 [2020-02-10 19:45:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:26,216 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1356 transitions. [2020-02-10 19:45:26,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1356 transitions. [2020-02-10 19:45:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:26,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:26,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:26,217 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 19:45:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:26,217 INFO L82 PathProgramCache]: Analyzing trace with hash 669834480, now seen corresponding path program 230 times [2020-02-10 19:45:26,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:26,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609805814] [2020-02-10 19:45:26,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:26,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 19:45:26,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609805814] [2020-02-10 19:45:26,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:26,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:26,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507197102] [2020-02-10 19:45:26,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:26,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:26,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:26,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:26,512 INFO L87 Difference]: Start difference. First operand 390 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:45:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:26,636 INFO L93 Difference]: Finished difference Result 568 states and 1709 transitions. [2020-02-10 19:45:26,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:26,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:26,638 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:45:26,638 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:45:26,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 19:45:26,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:45:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 388. [2020-02-10 19:45:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:45:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1351 transitions. [2020-02-10 19:45:26,648 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1351 transitions. Word has length 22 [2020-02-10 19:45:26,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:26,648 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1351 transitions. [2020-02-10 19:45:26,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:26,648 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1351 transitions. [2020-02-10 19:45:26,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:26,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:26,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 19:45:26,649 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 19:45:26,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:26,649 INFO L82 PathProgramCache]: Analyzing trace with hash -171003594, now seen corresponding path program 231 times [2020-02-10 19:45:26,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:26,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404893085] [2020-02-10 19:45:26,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:26,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 19:45:26,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404893085] [2020-02-10 19:45:26,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:26,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:26,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775756335] [2020-02-10 19:45:26,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:26,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:26,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:26,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:26,929 INFO L87 Difference]: Start difference. First operand 388 states and 1351 transitions. Second operand 9 states. [2020-02-10 19:45:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:27,039 INFO L93 Difference]: Finished difference Result 573 states and 1720 transitions. [2020-02-10 19:45:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:27,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:27,041 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:45:27,041 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:45:27,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 19:45:27,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:45:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 391. [2020-02-10 19:45:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-02-10 19:45:27,054 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-02-10 19:45:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:27,054 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-02-10 19:45:27,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-02-10 19:45:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:27,055 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:27,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 19:45:27,055 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 19:45:27,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:27,056 INFO L82 PathProgramCache]: Analyzing trace with hash -953002836, now seen corresponding path program 232 times [2020-02-10 19:45:27,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:27,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344167910] [2020-02-10 19:45:27,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:27,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 19:45:27,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344167910] [2020-02-10 19:45:27,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:27,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:27,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102766862] [2020-02-10 19:45:27,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:27,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:27,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:27,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:27,345 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:45:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:27,463 INFO L93 Difference]: Finished difference Result 575 states and 1721 transitions. [2020-02-10 19:45:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:27,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:27,465 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:45:27,465 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:45:27,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 19:45:27,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:45:27,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 388. [2020-02-10 19:45:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:45:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1349 transitions. [2020-02-10 19:45:27,474 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1349 transitions. Word has length 22 [2020-02-10 19:45:27,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:27,474 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1349 transitions. [2020-02-10 19:45:27,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1349 transitions. [2020-02-10 19:45:27,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:27,475 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:27,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 19:45:27,475 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 19:45:27,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:27,475 INFO L82 PathProgramCache]: Analyzing trace with hash 149930832, now seen corresponding path program 233 times [2020-02-10 19:45:27,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:27,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36410045] [2020-02-10 19:45:27,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:27,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 19:45:27,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36410045] [2020-02-10 19:45:27,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:27,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:27,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282741738] [2020-02-10 19:45:27,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:27,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:27,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:27,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:27,751 INFO L87 Difference]: Start difference. First operand 388 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:45:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:27,883 INFO L93 Difference]: Finished difference Result 570 states and 1711 transitions. [2020-02-10 19:45:27,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:27,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:27,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:27,885 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:45:27,885 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:45:27,886 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:27,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:45:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 390. [2020-02-10 19:45:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1352 transitions. [2020-02-10 19:45:27,896 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1352 transitions. Word has length 22 [2020-02-10 19:45:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:27,896 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1352 transitions. [2020-02-10 19:45:27,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1352 transitions. [2020-02-10 19:45:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:27,897 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:27,897 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:27,897 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 19:45:27,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:27,897 INFO L82 PathProgramCache]: Analyzing trace with hash 721385638, now seen corresponding path program 234 times [2020-02-10 19:45:27,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:27,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474434552] [2020-02-10 19:45:27,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:28,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 19:45:28,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474434552] [2020-02-10 19:45:28,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:28,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:28,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061821042] [2020-02-10 19:45:28,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:28,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:28,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:28,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:28,204 INFO L87 Difference]: Start difference. First operand 390 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:45:28,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:28,328 INFO L93 Difference]: Finished difference Result 573 states and 1715 transitions. [2020-02-10 19:45:28,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:28,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:28,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:28,330 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:45:28,330 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:45:28,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:28,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:45:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 386. [2020-02-10 19:45:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:45:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1345 transitions. [2020-02-10 19:45:28,340 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1345 transitions. Word has length 22 [2020-02-10 19:45:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:28,340 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1345 transitions. [2020-02-10 19:45:28,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1345 transitions. [2020-02-10 19:45:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:28,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:28,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 19:45:28,341 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 19:45:28,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash -703179058, now seen corresponding path program 235 times [2020-02-10 19:45:28,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:28,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221268807] [2020-02-10 19:45:28,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:28,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 19:45:28,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221268807] [2020-02-10 19:45:28,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:28,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:28,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443376688] [2020-02-10 19:45:28,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:28,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:28,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:28,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:28,642 INFO L87 Difference]: Start difference. First operand 386 states and 1345 transitions. Second operand 9 states. [2020-02-10 19:45:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:28,737 INFO L93 Difference]: Finished difference Result 558 states and 1684 transitions. [2020-02-10 19:45:28,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:28,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:28,738 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:45:28,739 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 19:45:28,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 19:45:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 19:45:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 388. [2020-02-10 19:45:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:45:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1349 transitions. [2020-02-10 19:45:28,749 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1349 transitions. Word has length 22 [2020-02-10 19:45:28,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:28,749 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1349 transitions. [2020-02-10 19:45:28,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1349 transitions. [2020-02-10 19:45:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:28,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:28,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 19:45:28,750 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 19:45:28,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:28,750 INFO L82 PathProgramCache]: Analyzing trace with hash 907761900, now seen corresponding path program 236 times [2020-02-10 19:45:28,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:28,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153143971] [2020-02-10 19:45:28,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:29,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 19:45:29,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153143971] [2020-02-10 19:45:29,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:29,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:29,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809872145] [2020-02-10 19:45:29,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:29,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:29,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:29,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:29,041 INFO L87 Difference]: Start difference. First operand 388 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:45:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:29,157 INFO L93 Difference]: Finished difference Result 559 states and 1685 transitions. [2020-02-10 19:45:29,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:29,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:29,159 INFO L225 Difference]: With dead ends: 559 [2020-02-10 19:45:29,160 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:45:29,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 19:45:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:45:29,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 387. [2020-02-10 19:45:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:45:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1347 transitions. [2020-02-10 19:45:29,169 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1347 transitions. Word has length 22 [2020-02-10 19:45:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:29,170 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1347 transitions. [2020-02-10 19:45:29,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1347 transitions. [2020-02-10 19:45:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:29,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:29,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 19:45:29,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 19:45:29,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:29,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1290924380, now seen corresponding path program 237 times [2020-02-10 19:45:29,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:29,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449450510] [2020-02-10 19:45:29,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:29,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 19:45:29,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449450510] [2020-02-10 19:45:29,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:29,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:29,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870057371] [2020-02-10 19:45:29,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:29,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:29,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:29,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:29,451 INFO L87 Difference]: Start difference. First operand 387 states and 1347 transitions. Second operand 9 states. [2020-02-10 19:45:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:29,540 INFO L93 Difference]: Finished difference Result 561 states and 1689 transitions. [2020-02-10 19:45:29,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:29,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:29,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:29,542 INFO L225 Difference]: With dead ends: 561 [2020-02-10 19:45:29,542 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:45:29,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 19:45:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:45:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 388. [2020-02-10 19:45:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:45:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1348 transitions. [2020-02-10 19:45:29,552 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1348 transitions. Word has length 22 [2020-02-10 19:45:29,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:29,552 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1348 transitions. [2020-02-10 19:45:29,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1348 transitions. [2020-02-10 19:45:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:29,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:29,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 19:45:29,553 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 19:45:29,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:29,553 INFO L82 PathProgramCache]: Analyzing trace with hash 855246380, now seen corresponding path program 238 times [2020-02-10 19:45:29,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:29,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723264630] [2020-02-10 19:45:29,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:29,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 19:45:29,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723264630] [2020-02-10 19:45:29,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:29,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:29,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434271497] [2020-02-10 19:45:29,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:29,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:29,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:29,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:29,842 INFO L87 Difference]: Start difference. First operand 388 states and 1348 transitions. Second operand 9 states. [2020-02-10 19:45:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:29,958 INFO L93 Difference]: Finished difference Result 565 states and 1696 transitions. [2020-02-10 19:45:29,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:29,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:29,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:29,960 INFO L225 Difference]: With dead ends: 565 [2020-02-10 19:45:29,960 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:45:29,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 19:45:29,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:45:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 387. [2020-02-10 19:45:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:45:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1346 transitions. [2020-02-10 19:45:29,970 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1346 transitions. Word has length 22 [2020-02-10 19:45:29,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:29,970 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1346 transitions. [2020-02-10 19:45:29,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1346 transitions. [2020-02-10 19:45:29,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:29,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:29,970 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:29,971 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 19:45:29,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:29,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1280421276, now seen corresponding path program 239 times [2020-02-10 19:45:29,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:29,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897393538] [2020-02-10 19:45:29,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:30,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 19:45:30,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897393538] [2020-02-10 19:45:30,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:30,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:30,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293877828] [2020-02-10 19:45:30,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:30,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:30,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:30,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:30,269 INFO L87 Difference]: Start difference. First operand 387 states and 1346 transitions. Second operand 9 states. [2020-02-10 19:45:30,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:30,390 INFO L93 Difference]: Finished difference Result 564 states and 1695 transitions. [2020-02-10 19:45:30,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:30,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:30,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:30,392 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:45:30,392 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:45:30,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:45:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 389. [2020-02-10 19:45:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:45:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1349 transitions. [2020-02-10 19:45:30,409 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1349 transitions. Word has length 22 [2020-02-10 19:45:30,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:30,409 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1349 transitions. [2020-02-10 19:45:30,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1349 transitions. [2020-02-10 19:45:30,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:30,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:30,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 19:45:30,410 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 19:45:30,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash -745191474, now seen corresponding path program 240 times [2020-02-10 19:45:30,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:30,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036398190] [2020-02-10 19:45:30,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:30,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 19:45:30,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036398190] [2020-02-10 19:45:30,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:30,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:30,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504587858] [2020-02-10 19:45:30,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:30,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:30,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:30,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:30,710 INFO L87 Difference]: Start difference. First operand 389 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:45:30,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:30,839 INFO L93 Difference]: Finished difference Result 567 states and 1699 transitions. [2020-02-10 19:45:30,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:30,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:30,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:30,841 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:45:30,842 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:45:30,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 19:45:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:45:30,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 383. [2020-02-10 19:45:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:45:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1340 transitions. [2020-02-10 19:45:30,852 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1340 transitions. Word has length 22 [2020-02-10 19:45:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:30,852 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1340 transitions. [2020-02-10 19:45:30,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1340 transitions. [2020-02-10 19:45:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:30,853 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:30,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 19:45:30,853 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 19:45:30,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:30,853 INFO L82 PathProgramCache]: Analyzing trace with hash -39183836, now seen corresponding path program 241 times [2020-02-10 19:45:30,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:30,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552261919] [2020-02-10 19:45:30,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:31,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 19:45:31,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552261919] [2020-02-10 19:45:31,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:31,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:31,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737315888] [2020-02-10 19:45:31,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:31,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:31,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:31,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:31,142 INFO L87 Difference]: Start difference. First operand 383 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:45:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:31,248 INFO L93 Difference]: Finished difference Result 638 states and 1890 transitions. [2020-02-10 19:45:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:31,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:31,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:31,250 INFO L225 Difference]: With dead ends: 638 [2020-02-10 19:45:31,250 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 19:45:31,250 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 19:45:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 396. [2020-02-10 19:45:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:45:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1380 transitions. [2020-02-10 19:45:31,259 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1380 transitions. Word has length 22 [2020-02-10 19:45:31,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:31,260 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1380 transitions. [2020-02-10 19:45:31,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1380 transitions. [2020-02-10 19:45:31,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:31,260 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:31,260 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:31,260 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 19:45:31,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:31,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1551082050, now seen corresponding path program 242 times [2020-02-10 19:45:31,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:31,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101053076] [2020-02-10 19:45:31,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:31,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 19:45:31,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101053076] [2020-02-10 19:45:31,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:31,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:31,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554416223] [2020-02-10 19:45:31,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:31,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:31,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:31,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:31,546 INFO L87 Difference]: Start difference. First operand 396 states and 1380 transitions. Second operand 9 states. [2020-02-10 19:45:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:31,661 INFO L93 Difference]: Finished difference Result 633 states and 1877 transitions. [2020-02-10 19:45:31,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:31,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:31,663 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:45:31,663 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 19:45:31,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:31,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 19:45:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 392. [2020-02-10 19:45:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:45:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1372 transitions. [2020-02-10 19:45:31,674 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1372 transitions. Word has length 22 [2020-02-10 19:45:31,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:31,675 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1372 transitions. [2020-02-10 19:45:31,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1372 transitions. [2020-02-10 19:45:31,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:31,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:31,676 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:31,676 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 19:45:31,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:31,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1313366484, now seen corresponding path program 243 times [2020-02-10 19:45:31,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:31,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253339105] [2020-02-10 19:45:31,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:31,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 19:45:31,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253339105] [2020-02-10 19:45:31,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:31,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:31,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932981332] [2020-02-10 19:45:31,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:31,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:31,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:31,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:31,954 INFO L87 Difference]: Start difference. First operand 392 states and 1372 transitions. Second operand 9 states. [2020-02-10 19:45:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:32,044 INFO L93 Difference]: Finished difference Result 634 states and 1878 transitions. [2020-02-10 19:45:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:32,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:32,046 INFO L225 Difference]: With dead ends: 634 [2020-02-10 19:45:32,046 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 19:45:32,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:32,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 19:45:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 394. [2020-02-10 19:45:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:45:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1374 transitions. [2020-02-10 19:45:32,055 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1374 transitions. Word has length 22 [2020-02-10 19:45:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:32,055 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1374 transitions. [2020-02-10 19:45:32,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1374 transitions. [2020-02-10 19:45:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:32,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:32,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 19:45:32,056 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 19:45:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:32,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1874434976, now seen corresponding path program 244 times [2020-02-10 19:45:32,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:32,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732858141] [2020-02-10 19:45:32,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:32,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 19:45:32,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732858141] [2020-02-10 19:45:32,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:32,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:32,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865284772] [2020-02-10 19:45:32,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:32,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:32,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:32,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:32,336 INFO L87 Difference]: Start difference. First operand 394 states and 1374 transitions. Second operand 9 states. [2020-02-10 19:45:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:32,439 INFO L93 Difference]: Finished difference Result 627 states and 1863 transitions. [2020-02-10 19:45:32,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:32,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:32,441 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:45:32,441 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:45:32,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:32,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:45:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 392. [2020-02-10 19:45:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:45:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1370 transitions. [2020-02-10 19:45:32,452 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1370 transitions. Word has length 22 [2020-02-10 19:45:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:32,452 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1370 transitions. [2020-02-10 19:45:32,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:32,452 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1370 transitions. [2020-02-10 19:45:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:32,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:32,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 19:45:32,453 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 19:45:32,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:32,454 INFO L82 PathProgramCache]: Analyzing trace with hash 119076278, now seen corresponding path program 245 times [2020-02-10 19:45:32,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:32,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077274639] [2020-02-10 19:45:32,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:32,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 19:45:32,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077274639] [2020-02-10 19:45:32,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:32,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:32,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894170630] [2020-02-10 19:45:32,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:32,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:32,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:32,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:32,758 INFO L87 Difference]: Start difference. First operand 392 states and 1370 transitions. Second operand 9 states. [2020-02-10 19:45:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:32,878 INFO L93 Difference]: Finished difference Result 623 states and 1856 transitions. [2020-02-10 19:45:32,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:32,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:32,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:32,880 INFO L225 Difference]: With dead ends: 623 [2020-02-10 19:45:32,880 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 19:45:32,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 19:45:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 19:45:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 393. [2020-02-10 19:45:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1371 transitions. [2020-02-10 19:45:32,890 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1371 transitions. Word has length 22 [2020-02-10 19:45:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:32,890 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1371 transitions. [2020-02-10 19:45:32,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1371 transitions. [2020-02-10 19:45:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:32,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:32,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 19:45:32,891 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 19:45:32,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:32,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1326440732, now seen corresponding path program 246 times [2020-02-10 19:45:32,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:32,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642302804] [2020-02-10 19:45:32,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:33,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 19:45:33,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642302804] [2020-02-10 19:45:33,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:33,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:33,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505959827] [2020-02-10 19:45:33,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:33,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:33,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:33,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:33,192 INFO L87 Difference]: Start difference. First operand 393 states and 1371 transitions. Second operand 9 states. [2020-02-10 19:45:33,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:33,277 INFO L93 Difference]: Finished difference Result 621 states and 1851 transitions. [2020-02-10 19:45:33,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:33,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:33,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:33,280 INFO L225 Difference]: With dead ends: 621 [2020-02-10 19:45:33,280 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 19:45:33,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 19:45:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 19:45:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 390. [2020-02-10 19:45:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1366 transitions. [2020-02-10 19:45:33,290 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1366 transitions. Word has length 22 [2020-02-10 19:45:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:33,290 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1366 transitions. [2020-02-10 19:45:33,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:33,290 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1366 transitions. [2020-02-10 19:45:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:33,291 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:33,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 19:45:33,291 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 19:45:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1799236776, now seen corresponding path program 247 times [2020-02-10 19:45:33,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:33,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098001009] [2020-02-10 19:45:33,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:33,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098001009] [2020-02-10 19:45:33,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:33,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:33,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690664403] [2020-02-10 19:45:33,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:33,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:33,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:33,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:33,594 INFO L87 Difference]: Start difference. First operand 390 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:45:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:33,688 INFO L93 Difference]: Finished difference Result 654 states and 1930 transitions. [2020-02-10 19:45:33,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:33,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:33,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:33,690 INFO L225 Difference]: With dead ends: 654 [2020-02-10 19:45:33,690 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 19:45:33,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 19:45:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 399. [2020-02-10 19:45:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:45:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1388 transitions. [2020-02-10 19:45:33,703 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1388 transitions. Word has length 22 [2020-02-10 19:45:33,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:33,703 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1388 transitions. [2020-02-10 19:45:33,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1388 transitions. [2020-02-10 19:45:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:33,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:33,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 19:45:33,704 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 19:45:33,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:33,704 INFO L82 PathProgramCache]: Analyzing trace with hash -208970890, now seen corresponding path program 248 times [2020-02-10 19:45:33,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:33,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868204837] [2020-02-10 19:45:33,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:34,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868204837] [2020-02-10 19:45:34,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:34,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:34,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71393702] [2020-02-10 19:45:34,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:34,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:34,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:34,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:34,002 INFO L87 Difference]: Start difference. First operand 399 states and 1388 transitions. Second operand 9 states. [2020-02-10 19:45:34,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:34,137 INFO L93 Difference]: Finished difference Result 649 states and 1917 transitions. [2020-02-10 19:45:34,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:34,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:34,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:34,140 INFO L225 Difference]: With dead ends: 649 [2020-02-10 19:45:34,140 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 19:45:34,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 19:45:34,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 19:45:34,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 395. [2020-02-10 19:45:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:45:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1378 transitions. [2020-02-10 19:45:34,150 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1378 transitions. Word has length 22 [2020-02-10 19:45:34,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:34,150 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1378 transitions. [2020-02-10 19:45:34,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1378 transitions. [2020-02-10 19:45:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:34,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:34,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 19:45:34,151 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 19:45:34,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:34,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1534185912, now seen corresponding path program 249 times [2020-02-10 19:45:34,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:34,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351397755] [2020-02-10 19:45:34,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:34,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351397755] [2020-02-10 19:45:34,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:34,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:34,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146541340] [2020-02-10 19:45:34,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:34,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:34,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:34,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:34,455 INFO L87 Difference]: Start difference. First operand 395 states and 1378 transitions. Second operand 9 states. [2020-02-10 19:45:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:34,544 INFO L93 Difference]: Finished difference Result 661 states and 1942 transitions. [2020-02-10 19:45:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:34,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:34,546 INFO L225 Difference]: With dead ends: 661 [2020-02-10 19:45:34,546 INFO L226 Difference]: Without dead ends: 645 [2020-02-10 19:45:34,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 19:45:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-02-10 19:45:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 403. [2020-02-10 19:45:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-02-10 19:45:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1391 transitions. [2020-02-10 19:45:34,556 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1391 transitions. Word has length 22 [2020-02-10 19:45:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:34,556 INFO L479 AbstractCegarLoop]: Abstraction has 403 states and 1391 transitions. [2020-02-10 19:45:34,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1391 transitions. [2020-02-10 19:45:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:34,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:34,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 19:45:34,557 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 19:45:34,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:34,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1263209834, now seen corresponding path program 250 times [2020-02-10 19:45:34,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:34,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989857672] [2020-02-10 19:45:34,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:34,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 19:45:34,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989857672] [2020-02-10 19:45:34,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:34,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:34,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918121743] [2020-02-10 19:45:34,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:34,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:34,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:34,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:34,859 INFO L87 Difference]: Start difference. First operand 403 states and 1391 transitions. Second operand 9 states. [2020-02-10 19:45:34,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:34,996 INFO L93 Difference]: Finished difference Result 659 states and 1932 transitions. [2020-02-10 19:45:34,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:35,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:35,001 INFO L225 Difference]: With dead ends: 659 [2020-02-10 19:45:35,001 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 19:45:35,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 19:45:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 19:45:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 395. [2020-02-10 19:45:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:45:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1373 transitions. [2020-02-10 19:45:35,015 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1373 transitions. Word has length 22 [2020-02-10 19:45:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:35,015 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1373 transitions. [2020-02-10 19:45:35,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1373 transitions. [2020-02-10 19:45:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:35,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:35,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 19:45:35,016 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 19:45:35,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:35,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1545484970, now seen corresponding path program 251 times [2020-02-10 19:45:35,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:35,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060599921] [2020-02-10 19:45:35,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:35,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 19:45:35,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060599921] [2020-02-10 19:45:35,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:35,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:35,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406315807] [2020-02-10 19:45:35,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:35,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:35,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:35,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:35,298 INFO L87 Difference]: Start difference. First operand 395 states and 1373 transitions. Second operand 9 states. [2020-02-10 19:45:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:35,405 INFO L93 Difference]: Finished difference Result 646 states and 1907 transitions. [2020-02-10 19:45:35,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:35,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:35,407 INFO L225 Difference]: With dead ends: 646 [2020-02-10 19:45:35,408 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 19:45:35,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 19:45:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 19:45:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 398. [2020-02-10 19:45:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:45:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1378 transitions. [2020-02-10 19:45:35,419 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1378 transitions. Word has length 22 [2020-02-10 19:45:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:35,419 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1378 transitions. [2020-02-10 19:45:35,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1378 transitions. [2020-02-10 19:45:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:35,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:35,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 19:45:35,420 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 19:45:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:35,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1563918996, now seen corresponding path program 252 times [2020-02-10 19:45:35,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:35,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883020526] [2020-02-10 19:45:35,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:35,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 19:45:35,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883020526] [2020-02-10 19:45:35,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:35,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:35,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577546766] [2020-02-10 19:45:35,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:35,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:35,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:35,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:35,704 INFO L87 Difference]: Start difference. First operand 398 states and 1378 transitions. Second operand 9 states. [2020-02-10 19:45:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:35,824 INFO L93 Difference]: Finished difference Result 649 states and 1910 transitions. [2020-02-10 19:45:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:35,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:35,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:35,827 INFO L225 Difference]: With dead ends: 649 [2020-02-10 19:45:35,827 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 19:45:35,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:35,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 19:45:35,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 390. [2020-02-10 19:45:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1363 transitions. [2020-02-10 19:45:35,836 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1363 transitions. Word has length 22 [2020-02-10 19:45:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:35,837 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1363 transitions. [2020-02-10 19:45:35,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1363 transitions. [2020-02-10 19:45:35,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:35,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:35,837 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:35,837 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 19:45:35,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:35,838 INFO L82 PathProgramCache]: Analyzing trace with hash -640125292, now seen corresponding path program 253 times [2020-02-10 19:45:35,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:35,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542344458] [2020-02-10 19:45:35,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:36,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 19:45:36,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542344458] [2020-02-10 19:45:36,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:36,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:36,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275507220] [2020-02-10 19:45:36,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:36,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:36,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:36,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:36,112 INFO L87 Difference]: Start difference. First operand 390 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:45:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:36,206 INFO L93 Difference]: Finished difference Result 642 states and 1893 transitions. [2020-02-10 19:45:36,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:36,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:36,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:36,207 INFO L225 Difference]: With dead ends: 642 [2020-02-10 19:45:36,207 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 19:45:36,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 19:45:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 19:45:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 395. [2020-02-10 19:45:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:45:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1373 transitions. [2020-02-10 19:45:36,219 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1373 transitions. Word has length 22 [2020-02-10 19:45:36,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:36,219 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1373 transitions. [2020-02-10 19:45:36,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1373 transitions. [2020-02-10 19:45:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:36,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:36,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 19:45:36,220 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 19:45:36,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:36,220 INFO L82 PathProgramCache]: Analyzing trace with hash -79056800, now seen corresponding path program 254 times [2020-02-10 19:45:36,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:36,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382307834] [2020-02-10 19:45:36,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:36,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382307834] [2020-02-10 19:45:36,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:36,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:36,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916449974] [2020-02-10 19:45:36,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:36,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:36,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:36,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:36,491 INFO L87 Difference]: Start difference. First operand 395 states and 1373 transitions. Second operand 9 states. [2020-02-10 19:45:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:36,573 INFO L93 Difference]: Finished difference Result 635 states and 1878 transitions. [2020-02-10 19:45:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:36,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:36,575 INFO L225 Difference]: With dead ends: 635 [2020-02-10 19:45:36,575 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 19:45:36,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 19:45:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 19:45:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 393. [2020-02-10 19:45:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1369 transitions. [2020-02-10 19:45:36,586 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1369 transitions. Word has length 22 [2020-02-10 19:45:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:36,586 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1369 transitions. [2020-02-10 19:45:36,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1369 transitions. [2020-02-10 19:45:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:36,586 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:36,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 19:45:36,587 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 19:45:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:36,587 INFO L82 PathProgramCache]: Analyzing trace with hash 372567240, now seen corresponding path program 255 times [2020-02-10 19:45:36,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:36,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090774320] [2020-02-10 19:45:36,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:36,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 19:45:36,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090774320] [2020-02-10 19:45:36,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:36,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:36,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287135270] [2020-02-10 19:45:36,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:36,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:36,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:36,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:36,879 INFO L87 Difference]: Start difference. First operand 393 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:45:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:36,980 INFO L93 Difference]: Finished difference Result 653 states and 1917 transitions. [2020-02-10 19:45:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:36,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:36,982 INFO L225 Difference]: With dead ends: 653 [2020-02-10 19:45:36,982 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 19:45:36,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 19:45:36,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 19:45:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 401. [2020-02-10 19:45:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 19:45:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1382 transitions. [2020-02-10 19:45:36,992 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1382 transitions. Word has length 22 [2020-02-10 19:45:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:36,992 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1382 transitions. [2020-02-10 19:45:36,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:36,992 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1382 transitions. [2020-02-10 19:45:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:36,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:36,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 19:45:36,993 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 19:45:36,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:36,993 INFO L82 PathProgramCache]: Analyzing trace with hash 242596794, now seen corresponding path program 256 times [2020-02-10 19:45:36,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:36,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392574644] [2020-02-10 19:45:36,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:37,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 19:45:37,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392574644] [2020-02-10 19:45:37,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:37,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:37,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398563951] [2020-02-10 19:45:37,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:37,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:37,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:37,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:37,287 INFO L87 Difference]: Start difference. First operand 401 states and 1382 transitions. Second operand 9 states. [2020-02-10 19:45:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:37,395 INFO L93 Difference]: Finished difference Result 651 states and 1907 transitions. [2020-02-10 19:45:37,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:37,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:37,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:37,397 INFO L225 Difference]: With dead ends: 651 [2020-02-10 19:45:37,398 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 19:45:37,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 19:45:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 19:45:37,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 393. [2020-02-10 19:45:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-02-10 19:45:37,407 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-02-10 19:45:37,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:37,408 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-02-10 19:45:37,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-02-10 19:45:37,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:37,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:37,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 19:45:37,408 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 19:45:37,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:37,409 INFO L82 PathProgramCache]: Analyzing trace with hash 427289466, now seen corresponding path program 257 times [2020-02-10 19:45:37,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:37,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895323253] [2020-02-10 19:45:37,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:37,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 19:45:37,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895323253] [2020-02-10 19:45:37,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:37,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:37,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842629535] [2020-02-10 19:45:37,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:37,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:37,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:37,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:37,682 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:45:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:37,772 INFO L93 Difference]: Finished difference Result 632 states and 1870 transitions. [2020-02-10 19:45:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:37,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:37,774 INFO L225 Difference]: With dead ends: 632 [2020-02-10 19:45:37,774 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 19:45:37,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 19:45:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 19:45:37,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 394. [2020-02-10 19:45:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:45:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-02-10 19:45:37,784 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-02-10 19:45:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:37,784 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-02-10 19:45:37,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-02-10 19:45:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:37,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:37,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 19:45:37,785 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 19:45:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:37,786 INFO L82 PathProgramCache]: Analyzing trace with hash -648421690, now seen corresponding path program 258 times [2020-02-10 19:45:37,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:37,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255288768] [2020-02-10 19:45:37,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:38,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 19:45:38,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255288768] [2020-02-10 19:45:38,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:38,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:38,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267020674] [2020-02-10 19:45:38,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:38,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:38,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:38,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:38,053 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-02-10 19:45:38,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:38,162 INFO L93 Difference]: Finished difference Result 637 states and 1879 transitions. [2020-02-10 19:45:38,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:38,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:38,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:38,164 INFO L225 Difference]: With dead ends: 637 [2020-02-10 19:45:38,165 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 19:45:38,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 19:45:38,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 19:45:38,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 390. [2020-02-10 19:45:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1360 transitions. [2020-02-10 19:45:38,174 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1360 transitions. Word has length 22 [2020-02-10 19:45:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:38,174 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1360 transitions. [2020-02-10 19:45:38,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1360 transitions. [2020-02-10 19:45:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:38,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:38,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 19:45:38,175 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 19:45:38,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:38,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2017652658, now seen corresponding path program 259 times [2020-02-10 19:45:38,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:38,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716268818] [2020-02-10 19:45:38,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:38,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 19:45:38,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716268818] [2020-02-10 19:45:38,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:38,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:38,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564364288] [2020-02-10 19:45:38,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:38,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:38,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:38,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:38,461 INFO L87 Difference]: Start difference. First operand 390 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:45:38,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:38,584 INFO L93 Difference]: Finished difference Result 618 states and 1842 transitions. [2020-02-10 19:45:38,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:38,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:38,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:38,586 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:45:38,586 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 19:45:38,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 19:45:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 19:45:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 392. [2020-02-10 19:45:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:45:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-02-10 19:45:38,596 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-02-10 19:45:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:38,597 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-02-10 19:45:38,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-02-10 19:45:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:38,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:38,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 19:45:38,598 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 19:45:38,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:38,598 INFO L82 PathProgramCache]: Analyzing trace with hash 572135648, now seen corresponding path program 260 times [2020-02-10 19:45:38,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:38,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612405688] [2020-02-10 19:45:38,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:38,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 19:45:38,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612405688] [2020-02-10 19:45:38,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:38,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:38,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634890396] [2020-02-10 19:45:38,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:38,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:38,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:38,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:38,898 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:45:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:38,988 INFO L93 Difference]: Finished difference Result 616 states and 1837 transitions. [2020-02-10 19:45:38,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:38,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:38,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:38,990 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:45:38,990 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:45:38,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 19:45:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:45:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 391. [2020-02-10 19:45:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 19:45:39,001 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 19:45:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:39,001 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 19:45:39,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 19:45:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:39,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:39,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 19:45:39,002 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 19:45:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1264622106, now seen corresponding path program 261 times [2020-02-10 19:45:39,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:39,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314945695] [2020-02-10 19:45:39,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:39,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 19:45:39,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314945695] [2020-02-10 19:45:39,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:39,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:39,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783807684] [2020-02-10 19:45:39,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:39,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:39,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:39,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:39,283 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:45:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:39,405 INFO L93 Difference]: Finished difference Result 625 states and 1857 transitions. [2020-02-10 19:45:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:39,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:39,407 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:45:39,407 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 19:45:39,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 19:45:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 19:45:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 394. [2020-02-10 19:45:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:45:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-02-10 19:45:39,416 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-02-10 19:45:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:39,416 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-02-10 19:45:39,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-02-10 19:45:39,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:39,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:39,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 19:45:39,417 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 19:45:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:39,417 INFO L82 PathProgramCache]: Analyzing trace with hash 121413024, now seen corresponding path program 262 times [2020-02-10 19:45:39,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:39,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233138751] [2020-02-10 19:45:39,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:39,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 19:45:39,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233138751] [2020-02-10 19:45:39,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:39,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:39,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784229147] [2020-02-10 19:45:39,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:39,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:39,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:39,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:39,712 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-02-10 19:45:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:39,840 INFO L93 Difference]: Finished difference Result 628 states and 1860 transitions. [2020-02-10 19:45:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:39,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:39,842 INFO L225 Difference]: With dead ends: 628 [2020-02-10 19:45:39,842 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 19:45:39,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 19:45:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 19:45:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 391. [2020-02-10 19:45:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1361 transitions. [2020-02-10 19:45:39,852 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1361 transitions. Word has length 22 [2020-02-10 19:45:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:39,852 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1361 transitions. [2020-02-10 19:45:39,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1361 transitions. [2020-02-10 19:45:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:39,853 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:39,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 19:45:39,853 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 19:45:39,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:39,853 INFO L82 PathProgramCache]: Analyzing trace with hash -15609674, now seen corresponding path program 263 times [2020-02-10 19:45:39,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:39,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076395534] [2020-02-10 19:45:39,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:40,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076395534] [2020-02-10 19:45:40,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:40,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:40,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265949302] [2020-02-10 19:45:40,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:40,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:40,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:40,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:40,138 INFO L87 Difference]: Start difference. First operand 391 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:45:40,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:40,245 INFO L93 Difference]: Finished difference Result 619 states and 1842 transitions. [2020-02-10 19:45:40,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:40,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:40,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:40,247 INFO L225 Difference]: With dead ends: 619 [2020-02-10 19:45:40,247 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:45:40,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 19:45:40,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:45:40,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 392. [2020-02-10 19:45:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:45:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-02-10 19:45:40,258 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-02-10 19:45:40,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:40,258 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-02-10 19:45:40,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-02-10 19:45:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:40,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:40,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 19:45:40,259 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 19:45:40,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:40,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1091320830, now seen corresponding path program 264 times [2020-02-10 19:45:40,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:40,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634247254] [2020-02-10 19:45:40,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45: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 19:45:40,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634247254] [2020-02-10 19:45:40,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:40,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:40,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032949157] [2020-02-10 19:45:40,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:40,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:40,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:40,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:40,551 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:45:40,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:40,669 INFO L93 Difference]: Finished difference Result 624 states and 1851 transitions. [2020-02-10 19:45:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:40,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:40,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:40,671 INFO L225 Difference]: With dead ends: 624 [2020-02-10 19:45:40,671 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 19:45: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 19:45:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 19:45:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 387. [2020-02-10 19:45:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:45:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1354 transitions. [2020-02-10 19:45:40,682 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1354 transitions. Word has length 22 [2020-02-10 19:45:40,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:40,682 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1354 transitions. [2020-02-10 19:45:40,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1354 transitions. [2020-02-10 19:45:40,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:40,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:40,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 19:45:40,683 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 19:45:40,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:40,683 INFO L82 PathProgramCache]: Analyzing trace with hash -463495072, now seen corresponding path program 265 times [2020-02-10 19:45:40,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:40,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655018484] [2020-02-10 19:45:40,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:40,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 19:45:40,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655018484] [2020-02-10 19:45:40,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:40,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:40,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206793008] [2020-02-10 19:45:40,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:40,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:40,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:40,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:40,955 INFO L87 Difference]: Start difference. First operand 387 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:45:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:41,039 INFO L93 Difference]: Finished difference Result 632 states and 1874 transitions. [2020-02-10 19:45:41,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:41,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:41,041 INFO L225 Difference]: With dead ends: 632 [2020-02-10 19:45:41,042 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:45:41,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 19:45:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:45:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 395. [2020-02-10 19:45:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:45:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1374 transitions. [2020-02-10 19:45:41,051 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1374 transitions. Word has length 22 [2020-02-10 19:45:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:41,052 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1374 transitions. [2020-02-10 19:45:41,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1374 transitions. [2020-02-10 19:45:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:41,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:41,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:41,053 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 19:45:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:41,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1126770814, now seen corresponding path program 266 times [2020-02-10 19:45:41,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:41,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662214005] [2020-02-10 19:45:41,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:41,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662214005] [2020-02-10 19:45:41,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:41,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:41,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413417054] [2020-02-10 19:45:41,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:41,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:41,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:41,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:41,317 INFO L87 Difference]: Start difference. First operand 395 states and 1374 transitions. Second operand 9 states. [2020-02-10 19:45:41,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:41,450 INFO L93 Difference]: Finished difference Result 627 states and 1861 transitions. [2020-02-10 19:45:41,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:41,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:41,452 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:45:41,452 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 19:45:41,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 19:45:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 19:45:41,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 391. [2020-02-10 19:45:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-02-10 19:45:41,461 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-02-10 19:45:41,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:41,461 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-02-10 19:45:41,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-02-10 19:45:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:41,462 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:41,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:41,462 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 19:45:41,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:41,463 INFO L82 PathProgramCache]: Analyzing trace with hash 889055248, now seen corresponding path program 267 times [2020-02-10 19:45:41,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:41,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121153108] [2020-02-10 19:45:41,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:41,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 19:45:41,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121153108] [2020-02-10 19:45:41,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:41,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:41,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022445108] [2020-02-10 19:45:41,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:41,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:41,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:41,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:41,724 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:45:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:41,818 INFO L93 Difference]: Finished difference Result 628 states and 1862 transitions. [2020-02-10 19:45:41,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:41,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:41,820 INFO L225 Difference]: With dead ends: 628 [2020-02-10 19:45:41,820 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 19:45:41,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:41,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 19:45:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 393. [2020-02-10 19:45:41,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1368 transitions. [2020-02-10 19:45:41,833 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1368 transitions. Word has length 22 [2020-02-10 19:45:41,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:41,833 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1368 transitions. [2020-02-10 19:45:41,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:41,833 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1368 transitions. [2020-02-10 19:45:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:41,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:41,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 19:45:41,834 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 19:45:41,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:41,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1450123740, now seen corresponding path program 268 times [2020-02-10 19:45:41,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:41,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917081538] [2020-02-10 19:45:41,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:42,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 19:45:42,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917081538] [2020-02-10 19:45:42,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:42,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:42,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262246239] [2020-02-10 19:45:42,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:42,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:42,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:42,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:42,103 INFO L87 Difference]: Start difference. First operand 393 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:45:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:42,208 INFO L93 Difference]: Finished difference Result 621 states and 1847 transitions. [2020-02-10 19:45:42,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:42,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:42,210 INFO L225 Difference]: With dead ends: 621 [2020-02-10 19:45:42,210 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:45:42,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:45:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 391. [2020-02-10 19:45:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-02-10 19:45:42,220 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-02-10 19:45:42,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:42,220 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-02-10 19:45:42,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:42,220 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-02-10 19:45:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:42,221 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:42,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 19:45:42,221 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 19:45:42,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:42,221 INFO L82 PathProgramCache]: Analyzing trace with hash -305234958, now seen corresponding path program 269 times [2020-02-10 19:45:42,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:42,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389651463] [2020-02-10 19:45:42,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:42,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 19:45:42,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389651463] [2020-02-10 19:45:42,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:42,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:42,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011126059] [2020-02-10 19:45:42,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:42,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:42,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:42,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:42,500 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:45:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:42,625 INFO L93 Difference]: Finished difference Result 617 states and 1840 transitions. [2020-02-10 19:45:42,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:42,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:42,627 INFO L225 Difference]: With dead ends: 617 [2020-02-10 19:45:42,627 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:45:42,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:45:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 392. [2020-02-10 19:45:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:45:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1365 transitions. [2020-02-10 19:45:42,637 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1365 transitions. Word has length 22 [2020-02-10 19:45:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:42,637 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1365 transitions. [2020-02-10 19:45:42,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1365 transitions. [2020-02-10 19:45:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:42,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45: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 19:45:42,638 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 19:45:42,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:42,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1750751968, now seen corresponding path program 270 times [2020-02-10 19:45:42,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:42,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351632874] [2020-02-10 19:45:42,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:42,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 19:45:42,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351632874] [2020-02-10 19:45:42,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:42,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:42,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023802538] [2020-02-10 19:45:42,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:42,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:42,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:42,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:42,914 INFO L87 Difference]: Start difference. First operand 392 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:45:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:43,001 INFO L93 Difference]: Finished difference Result 615 states and 1835 transitions. [2020-02-10 19:45:43,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:43,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:43,003 INFO L225 Difference]: With dead ends: 615 [2020-02-10 19:45:43,003 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 19:45:43,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 19:45:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 19:45:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 389. [2020-02-10 19:45:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:45:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-02-10 19:45:43,014 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-02-10 19:45:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:43,014 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-02-10 19:45:43,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-02-10 19:45:43,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:43,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:43,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 19:45:43,015 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 19:45:43,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:43,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1226447832, now seen corresponding path program 271 times [2020-02-10 19:45:43,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:43,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852912124] [2020-02-10 19:45:43,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:43,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 19:45:43,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852912124] [2020-02-10 19:45:43,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:43,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:43,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116638888] [2020-02-10 19:45:43,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:43,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:43,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:43,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:43,284 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:45:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:43,385 INFO L93 Difference]: Finished difference Result 644 states and 1906 transitions. [2020-02-10 19:45:43,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:43,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:43,387 INFO L225 Difference]: With dead ends: 644 [2020-02-10 19:45:43,388 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 19:45:43,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 19:45:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 397. [2020-02-10 19:45:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:45:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1380 transitions. [2020-02-10 19:45:43,399 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1380 transitions. Word has length 22 [2020-02-10 19:45:43,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:43,399 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1380 transitions. [2020-02-10 19:45:43,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1380 transitions. [2020-02-10 19:45:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:43,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:43,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 19:45:43,400 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 19:45:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:43,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1478253578, now seen corresponding path program 272 times [2020-02-10 19:45:43,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:43,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480977866] [2020-02-10 19:45:43,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:43,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 19:45:43,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480977866] [2020-02-10 19:45:43,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:43,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:43,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521682090] [2020-02-10 19:45:43,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:43,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:43,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:43,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:43,674 INFO L87 Difference]: Start difference. First operand 397 states and 1380 transitions. Second operand 9 states. [2020-02-10 19:45:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:43,801 INFO L93 Difference]: Finished difference Result 639 states and 1893 transitions. [2020-02-10 19:45:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:43,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:43,803 INFO L225 Difference]: With dead ends: 639 [2020-02-10 19:45:43,803 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 19:45:43,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 19:45:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 393. [2020-02-10 19:45:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1370 transitions. [2020-02-10 19:45:43,812 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1370 transitions. Word has length 22 [2020-02-10 19:45:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:43,812 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1370 transitions. [2020-02-10 19:45:43,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1370 transitions. [2020-02-10 19:45:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:43,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:43,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 19:45:43,813 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 19:45:43,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:43,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1735956536, now seen corresponding path program 273 times [2020-02-10 19:45:43,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:43,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083998447] [2020-02-10 19:45:43,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:44,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 19:45:44,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083998447] [2020-02-10 19:45:44,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:44,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:44,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192605738] [2020-02-10 19:45:44,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:44,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:44,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:44,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:44,086 INFO L87 Difference]: Start difference. First operand 393 states and 1370 transitions. Second operand 9 states. [2020-02-10 19:45:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:44,170 INFO L93 Difference]: Finished difference Result 648 states and 1912 transitions. [2020-02-10 19:45:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:44,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:44,172 INFO L225 Difference]: With dead ends: 648 [2020-02-10 19:45:44,172 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 19:45:44,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 19:45:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 399. [2020-02-10 19:45:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:45:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1380 transitions. [2020-02-10 19:45:44,186 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1380 transitions. Word has length 22 [2020-02-10 19:45:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:44,186 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1380 transitions. [2020-02-10 19:45:44,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1380 transitions. [2020-02-10 19:45:44,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:44,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:44,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:44,188 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 19:45:44,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:44,188 INFO L82 PathProgramCache]: Analyzing trace with hash 967910732, now seen corresponding path program 274 times [2020-02-10 19:45:44,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:44,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096730621] [2020-02-10 19:45:44,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:44,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096730621] [2020-02-10 19:45:44,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:44,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:44,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883220964] [2020-02-10 19:45:44,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:44,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:44,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:44,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:44,429 INFO L87 Difference]: Start difference. First operand 399 states and 1380 transitions. Second operand 9 states. [2020-02-10 19:45:44,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:44,561 INFO L93 Difference]: Finished difference Result 645 states and 1901 transitions. [2020-02-10 19:45:44,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:44,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:44,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:44,563 INFO L225 Difference]: With dead ends: 645 [2020-02-10 19:45:44,564 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 19:45:44,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:44,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 19:45:44,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 393. [2020-02-10 19:45:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-02-10 19:45:44,574 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-02-10 19:45:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:44,574 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-02-10 19:45:44,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-02-10 19:45:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:44,574 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:44,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 19:45:44,575 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 19:45:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:44,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1343714346, now seen corresponding path program 275 times [2020-02-10 19:45:44,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:44,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525809525] [2020-02-10 19:45:44,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:44,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 19:45:44,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525809525] [2020-02-10 19:45:44,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:44,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:44,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475541410] [2020-02-10 19:45:44,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:44,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:44,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:44,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:44,847 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:45:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:44,963 INFO L93 Difference]: Finished difference Result 635 states and 1882 transitions. [2020-02-10 19:45:44,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:44,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:44,965 INFO L225 Difference]: With dead ends: 635 [2020-02-10 19:45:44,965 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 19:45:44,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 19:45:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 19:45:44,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 396. [2020-02-10 19:45:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:45:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1371 transitions. [2020-02-10 19:45:44,975 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1371 transitions. Word has length 22 [2020-02-10 19:45:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:44,975 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1371 transitions. [2020-02-10 19:45:44,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1371 transitions. [2020-02-10 19:45:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:44,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:44,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 19:45:44,976 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 19:45:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:44,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1222205616, now seen corresponding path program 276 times [2020-02-10 19:45:44,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:44,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89845609] [2020-02-10 19:45:44,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:45,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 19:45:45,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89845609] [2020-02-10 19:45:45,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:45,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:45,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258696159] [2020-02-10 19:45:45,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:45,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:45,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:45,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:45,247 INFO L87 Difference]: Start difference. First operand 396 states and 1371 transitions. Second operand 9 states. [2020-02-10 19:45:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:45,360 INFO L93 Difference]: Finished difference Result 637 states and 1883 transitions. [2020-02-10 19:45:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:45,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:45,362 INFO L225 Difference]: With dead ends: 637 [2020-02-10 19:45:45,362 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:45: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 19:45:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:45:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 389. [2020-02-10 19:45:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:45:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-02-10 19:45:45,372 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-02-10 19:45:45,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:45,372 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-02-10 19:45:45,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-02-10 19:45:45,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:45,373 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:45,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 19:45:45,373 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 19:45:45,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:45,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1942660176, now seen corresponding path program 277 times [2020-02-10 19:45:45,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:45,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467048178] [2020-02-10 19:45:45,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:45,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 19:45:45,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467048178] [2020-02-10 19:45:45,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:45,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:45,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757132372] [2020-02-10 19:45:45,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:45,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:45,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:45,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:45,639 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:45:45,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:45,726 INFO L93 Difference]: Finished difference Result 632 states and 1870 transitions. [2020-02-10 19:45:45,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:45,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:45,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:45,728 INFO L225 Difference]: With dead ends: 632 [2020-02-10 19:45:45,729 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:45:45,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 19:45:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:45:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 393. [2020-02-10 19:45:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-02-10 19:45:45,738 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-02-10 19:45:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:45,739 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-02-10 19:45:45,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-02-10 19:45:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:45,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:45,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 19:45:45,739 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 19:45:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:45,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1791238628, now seen corresponding path program 278 times [2020-02-10 19:45:45,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:45,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066431641] [2020-02-10 19:45:45,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:46,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 19:45:46,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066431641] [2020-02-10 19:45:46,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:46,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:46,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152036314] [2020-02-10 19:45:46,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:46,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:46,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:46,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:46,020 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:45:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:46,109 INFO L93 Difference]: Finished difference Result 625 states and 1855 transitions. [2020-02-10 19:45:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:46,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:46,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:46,111 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:45:46,111 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 19:45:46,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 19:45:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 19:45:46,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 391. [2020-02-10 19:45:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 19:45:46,120 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 19:45:46,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:46,121 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 19:45:46,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:46,121 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 19:45:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:46,121 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:46,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 19:45:46,121 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 19:45:46,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:46,122 INFO L82 PathProgramCache]: Analyzing trace with hash -245523000, now seen corresponding path program 279 times [2020-02-10 19:45:46,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:46,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882542689] [2020-02-10 19:45:46,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:46,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 19:45:46,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882542689] [2020-02-10 19:45:46,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:46,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:46,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206378682] [2020-02-10 19:45:46,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:46,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:46,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:46,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:46,397 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:45:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:46,479 INFO L93 Difference]: Finished difference Result 640 states and 1888 transitions. [2020-02-10 19:45:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:46,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:46,482 INFO L225 Difference]: With dead ends: 640 [2020-02-10 19:45:46,482 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 19:45:46,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 19:45:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 19:45:46,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 397. [2020-02-10 19:45:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:45:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1372 transitions. [2020-02-10 19:45:46,492 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1372 transitions. Word has length 22 [2020-02-10 19:45:46,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:46,492 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1372 transitions. [2020-02-10 19:45:46,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:46,492 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1372 transitions. [2020-02-10 19:45:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:46,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:46,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 19:45:46,493 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 19:45:46,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:46,493 INFO L82 PathProgramCache]: Analyzing trace with hash -52702308, now seen corresponding path program 280 times [2020-02-10 19:45:46,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:46,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203908801] [2020-02-10 19:45:46,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:46,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 19:45:46,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203908801] [2020-02-10 19:45:46,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:46,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:46,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573896149] [2020-02-10 19:45:46,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:46,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:46,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:46,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:46,761 INFO L87 Difference]: Start difference. First operand 397 states and 1372 transitions. Second operand 9 states. [2020-02-10 19:45:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:46,921 INFO L93 Difference]: Finished difference Result 637 states and 1877 transitions. [2020-02-10 19:45:46,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:46,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:46,923 INFO L225 Difference]: With dead ends: 637 [2020-02-10 19:45:46,924 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 19:45:46,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 19:45:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 19:45:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 391. [2020-02-10 19:45:46,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1360 transitions. [2020-02-10 19:45:46,939 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1360 transitions. Word has length 22 [2020-02-10 19:45:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:46,939 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1360 transitions. [2020-02-10 19:45:46,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1360 transitions. [2020-02-10 19:45:46,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:46,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:46,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 19:45:46,941 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 19:45:46,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:46,942 INFO L82 PathProgramCache]: Analyzing trace with hash -190800774, now seen corresponding path program 281 times [2020-02-10 19:45:46,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:46,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113593704] [2020-02-10 19:45:46,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:47,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 19:45:47,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113593704] [2020-02-10 19:45:47,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:47,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:47,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135207106] [2020-02-10 19:45:47,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:47,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:47,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:47,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:47,288 INFO L87 Difference]: Start difference. First operand 391 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:45:47,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:47,386 INFO L93 Difference]: Finished difference Result 621 states and 1846 transitions. [2020-02-10 19:45:47,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:47,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:47,388 INFO L225 Difference]: With dead ends: 621 [2020-02-10 19:45:47,388 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 19:45:47,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 19:45:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 19:45:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 392. [2020-02-10 19:45:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:45:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1361 transitions. [2020-02-10 19:45:47,398 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1361 transitions. Word has length 22 [2020-02-10 19:45:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:47,398 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1361 transitions. [2020-02-10 19:45:47,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1361 transitions. [2020-02-10 19:45:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:47,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:47,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 19:45:47,399 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 19:45:47,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:47,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1955369986, now seen corresponding path program 282 times [2020-02-10 19:45:47,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:47,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472529999] [2020-02-10 19:45:47,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:47,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 19:45:47,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472529999] [2020-02-10 19:45:47,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:47,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:47,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388222043] [2020-02-10 19:45:47,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:47,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:47,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:47,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:47,667 INFO L87 Difference]: Start difference. First operand 392 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:45:47,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:47,797 INFO L93 Difference]: Finished difference Result 625 states and 1853 transitions. [2020-02-10 19:45:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:47,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:47,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:47,799 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:45:47,799 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 19:45:47,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 19:45:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 389. [2020-02-10 19:45:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:45:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-02-10 19:45:47,808 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-02-10 19:45:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:47,808 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-02-10 19:45:47,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-02-10 19:45:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:47,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:47,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 19:45:47,809 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 19:45:47,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:47,809 INFO L82 PathProgramCache]: Analyzing trace with hash 305470830, now seen corresponding path program 283 times [2020-02-10 19:45:47,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:47,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96418356] [2020-02-10 19:45:47,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:48,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 19:45:48,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96418356] [2020-02-10 19:45:48,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:48,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:48,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887413828] [2020-02-10 19:45:48,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:48,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:48,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:48,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:48,083 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:45:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:48,211 INFO L93 Difference]: Finished difference Result 611 states and 1826 transitions. [2020-02-10 19:45:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:48,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:48,213 INFO L225 Difference]: With dead ends: 611 [2020-02-10 19:45:48,213 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:45:48,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:48,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:45:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 391. [2020-02-10 19:45:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1360 transitions. [2020-02-10 19:45:48,223 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1360 transitions. Word has length 22 [2020-02-10 19:45:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:48,223 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1360 transitions. [2020-02-10 19:45:48,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1360 transitions. [2020-02-10 19:45:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:48,224 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:48,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 19:45:48,224 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 19:45:48,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:48,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1140046180, now seen corresponding path program 284 times [2020-02-10 19:45:48,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:48,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132051722] [2020-02-10 19:45:48,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:48,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132051722] [2020-02-10 19:45:48,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:48,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:48,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722077054] [2020-02-10 19:45:48,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:48,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:48,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:48,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:48,500 INFO L87 Difference]: Start difference. First operand 391 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:45:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:48,604 INFO L93 Difference]: Finished difference Result 609 states and 1821 transitions. [2020-02-10 19:45:48,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:48,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:48,606 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:45:48,606 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:45:48,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:45:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 390. [2020-02-10 19:45:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1358 transitions. [2020-02-10 19:45:48,617 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1358 transitions. Word has length 22 [2020-02-10 19:45:48,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:48,617 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1358 transitions. [2020-02-10 19:45:48,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1358 transitions. [2020-02-10 19:45:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:48,617 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:48,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:48,618 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 19:45:48,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:48,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1882712346, now seen corresponding path program 285 times [2020-02-10 19:45:48,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:48,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424328950] [2020-02-10 19:45:48,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:48,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 19:45:48,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424328950] [2020-02-10 19:45:48,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:48,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:48,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268622072] [2020-02-10 19:45:48,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:48,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:48,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:48,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:48,883 INFO L87 Difference]: Start difference. First operand 390 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:45:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:48,993 INFO L93 Difference]: Finished difference Result 617 states and 1839 transitions. [2020-02-10 19:45:48,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:48,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:48,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:48,995 INFO L225 Difference]: With dead ends: 617 [2020-02-10 19:45:48,995 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:45:48,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:49,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:45:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 393. [2020-02-10 19:45:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1363 transitions. [2020-02-10 19:45:49,005 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1363 transitions. Word has length 22 [2020-02-10 19:45:49,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:49,006 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1363 transitions. [2020-02-10 19:45:49,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1363 transitions. [2020-02-10 19:45:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:49,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:49,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:49,006 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 19:45:49,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:49,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1630255708, now seen corresponding path program 286 times [2020-02-10 19:45:49,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:49,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175985903] [2020-02-10 19:45:49,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:49,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 19:45:49,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175985903] [2020-02-10 19:45:49,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:49,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:49,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894206853] [2020-02-10 19:45:49,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:49,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:49,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:49,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:49,271 INFO L87 Difference]: Start difference. First operand 393 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:45:49,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:49,400 INFO L93 Difference]: Finished difference Result 619 states and 1840 transitions. [2020-02-10 19:45:49,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:49,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:49,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:49,402 INFO L225 Difference]: With dead ends: 619 [2020-02-10 19:45:49,402 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 19:45:49,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 19:45:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 390. [2020-02-10 19:45:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:45:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-02-10 19:45:49,411 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-02-10 19:45:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:49,411 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-02-10 19:45:49,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-02-10 19:45:49,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:49,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:49,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 19:45:49,412 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 19:45:49,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:49,412 INFO L82 PathProgramCache]: Analyzing trace with hash -633699914, now seen corresponding path program 287 times [2020-02-10 19:45:49,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:49,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125940996] [2020-02-10 19:45:49,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:49,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 19:45:49,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125940996] [2020-02-10 19:45:49,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:49,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:49,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929039413] [2020-02-10 19:45:49,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:49,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:49,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:49,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:49,683 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:45:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:49,786 INFO L93 Difference]: Finished difference Result 611 states and 1824 transitions. [2020-02-10 19:45:49,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:49,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:49,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:49,788 INFO L225 Difference]: With dead ends: 611 [2020-02-10 19:45:49,788 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:45:49,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 19:45:49,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:45:49,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 391. [2020-02-10 19:45:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:45:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-02-10 19:45:49,800 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-02-10 19:45:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:49,800 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-02-10 19:45:49,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-02-10 19:45:49,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:49,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:49,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 19:45:49,801 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 19:45:49,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:49,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1512470846, now seen corresponding path program 288 times [2020-02-10 19:45:49,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:49,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536915471] [2020-02-10 19:45:49,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:50,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 19:45:50,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536915471] [2020-02-10 19:45:50,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:50,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:50,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9080185] [2020-02-10 19:45:50,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:50,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:50,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:50,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:50,068 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:45:50,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:50,189 INFO L93 Difference]: Finished difference Result 615 states and 1831 transitions. [2020-02-10 19:45:50,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:50,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:50,191 INFO L225 Difference]: With dead ends: 615 [2020-02-10 19:45:50,191 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:45:50,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 19:45:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:45:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 387. [2020-02-10 19:45:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:45:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1352 transitions. [2020-02-10 19:45:50,201 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1352 transitions. Word has length 22 [2020-02-10 19:45:50,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:50,201 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1352 transitions. [2020-02-10 19:45:50,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1352 transitions. [2020-02-10 19:45:50,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:50,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45: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 19:45:50,202 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 19:45:50,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:50,203 INFO L82 PathProgramCache]: Analyzing trace with hash -950614304, now seen corresponding path program 289 times [2020-02-10 19:45:50,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:50,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470575669] [2020-02-10 19:45:50,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:50,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 19:45:50,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470575669] [2020-02-10 19:45:50,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:50,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:50,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596802853] [2020-02-10 19:45:50,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:50,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:50,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:50,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:50,501 INFO L87 Difference]: Start difference. First operand 387 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:45:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:50,605 INFO L93 Difference]: Finished difference Result 680 states and 2010 transitions. [2020-02-10 19:45:50,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:50,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:50,607 INFO L225 Difference]: With dead ends: 680 [2020-02-10 19:45:50,607 INFO L226 Difference]: Without dead ends: 664 [2020-02-10 19:45:50,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-02-10 19:45:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 402. [2020-02-10 19:45:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 19:45:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1397 transitions. [2020-02-10 19:45:50,618 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1397 transitions. Word has length 22 [2020-02-10 19:45:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:50,618 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1397 transitions. [2020-02-10 19:45:50,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1397 transitions. [2020-02-10 19:45:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:50,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:50,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 19:45:50,619 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 19:45:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash 639651582, now seen corresponding path program 290 times [2020-02-10 19:45:50,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:50,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301484198] [2020-02-10 19:45:50,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:50,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 19:45:50,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301484198] [2020-02-10 19:45:50,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:50,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:50,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829389691] [2020-02-10 19:45:50,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:50,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:50,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:50,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:50,908 INFO L87 Difference]: Start difference. First operand 402 states and 1397 transitions. Second operand 9 states. [2020-02-10 19:45:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:51,017 INFO L93 Difference]: Finished difference Result 675 states and 1997 transitions. [2020-02-10 19:45:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:51,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:51,019 INFO L225 Difference]: With dead ends: 675 [2020-02-10 19:45:51,019 INFO L226 Difference]: Without dead ends: 660 [2020-02-10 19:45:51,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 19:45:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2020-02-10 19:45:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 398. [2020-02-10 19:45:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:45:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1387 transitions. [2020-02-10 19:45:51,028 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1387 transitions. Word has length 22 [2020-02-10 19:45:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:51,029 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1387 transitions. [2020-02-10 19:45:51,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1387 transitions. [2020-02-10 19:45:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:51,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:51,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 19:45:51,029 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 19:45:51,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:51,030 INFO L82 PathProgramCache]: Analyzing trace with hash -685563440, now seen corresponding path program 291 times [2020-02-10 19:45:51,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:51,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676729254] [2020-02-10 19:45:51,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:51,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 19:45:51,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676729254] [2020-02-10 19:45:51,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:51,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:51,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565059734] [2020-02-10 19:45:51,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:51,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:51,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:51,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:51,325 INFO L87 Difference]: Start difference. First operand 398 states and 1387 transitions. Second operand 9 states. [2020-02-10 19:45:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:51,421 INFO L93 Difference]: Finished difference Result 687 states and 2022 transitions. [2020-02-10 19:45:51,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:51,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:51,423 INFO L225 Difference]: With dead ends: 687 [2020-02-10 19:45:51,423 INFO L226 Difference]: Without dead ends: 671 [2020-02-10 19:45:51,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 19:45:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2020-02-10 19:45:51,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 406. [2020-02-10 19:45:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-02-10 19:45:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1400 transitions. [2020-02-10 19:45:51,434 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1400 transitions. Word has length 22 [2020-02-10 19:45:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:51,434 INFO L479 AbstractCegarLoop]: Abstraction has 406 states and 1400 transitions. [2020-02-10 19:45:51,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1400 transitions. [2020-02-10 19:45:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:51,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:51,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 19:45:51,435 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 19:45:51,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:51,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2111832306, now seen corresponding path program 292 times [2020-02-10 19:45:51,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:51,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988582132] [2020-02-10 19:45:51,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:51,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988582132] [2020-02-10 19:45:51,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:51,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:51,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971709256] [2020-02-10 19:45:51,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:51,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:51,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:51,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:51,734 INFO L87 Difference]: Start difference. First operand 406 states and 1400 transitions. Second operand 9 states. [2020-02-10 19:45:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:51,843 INFO L93 Difference]: Finished difference Result 685 states and 2012 transitions. [2020-02-10 19:45:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:51,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:51,845 INFO L225 Difference]: With dead ends: 685 [2020-02-10 19:45:51,845 INFO L226 Difference]: Without dead ends: 663 [2020-02-10 19:45:51,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-02-10 19:45:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 398. [2020-02-10 19:45:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:45:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1382 transitions. [2020-02-10 19:45:51,856 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1382 transitions. Word has length 22 [2020-02-10 19:45:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:51,856 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1382 transitions. [2020-02-10 19:45:51,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1382 transitions. [2020-02-10 19:45:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:51,857 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:51,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:51,857 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 19:45:51,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1900859854, now seen corresponding path program 293 times [2020-02-10 19:45:51,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:51,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167234351] [2020-02-10 19:45:51,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:52,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167234351] [2020-02-10 19:45:52,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:52,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:52,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355641604] [2020-02-10 19:45:52,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:52,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:52,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:52,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:52,150 INFO L87 Difference]: Start difference. First operand 398 states and 1382 transitions. Second operand 9 states. [2020-02-10 19:45:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:52,267 INFO L93 Difference]: Finished difference Result 672 states and 1987 transitions. [2020-02-10 19:45:52,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:52,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:52,269 INFO L225 Difference]: With dead ends: 672 [2020-02-10 19:45:52,270 INFO L226 Difference]: Without dead ends: 661 [2020-02-10 19:45:52,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-02-10 19:45:52,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 401. [2020-02-10 19:45:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 19:45:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1387 transitions. [2020-02-10 19:45:52,280 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1387 transitions. Word has length 22 [2020-02-10 19:45:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:52,280 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1387 transitions. [2020-02-10 19:45:52,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1387 transitions. [2020-02-10 19:45:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:52,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:52,281 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:52,281 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 19:45:52,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:52,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1882425828, now seen corresponding path program 294 times [2020-02-10 19:45:52,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:52,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604788494] [2020-02-10 19:45:52,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:52,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 19:45:52,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604788494] [2020-02-10 19:45:52,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:52,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:52,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368415074] [2020-02-10 19:45:52,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:52,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:52,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:52,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:52,569 INFO L87 Difference]: Start difference. First operand 401 states and 1387 transitions. Second operand 9 states. [2020-02-10 19:45:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:52,692 INFO L93 Difference]: Finished difference Result 675 states and 1990 transitions. [2020-02-10 19:45:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:52,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:52,694 INFO L225 Difference]: With dead ends: 675 [2020-02-10 19:45:52,694 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 19:45:52,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 19:45:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 19:45:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 393. [2020-02-10 19:45:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1370 transitions. [2020-02-10 19:45:52,708 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1370 transitions. Word has length 22 [2020-02-10 19:45:52,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:52,709 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1370 transitions. [2020-02-10 19:45:52,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1370 transitions. [2020-02-10 19:45:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:52,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:52,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 19:45:52,710 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 19:45:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1795585756, now seen corresponding path program 295 times [2020-02-10 19:45:52,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:52,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331096303] [2020-02-10 19:45:52,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:52,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331096303] [2020-02-10 19:45:52,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:52,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:52,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976575882] [2020-02-10 19:45:52,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:52,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:52,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:52,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:52,998 INFO L87 Difference]: Start difference. First operand 393 states and 1370 transitions. Second operand 9 states. [2020-02-10 19:45:53,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:53,094 INFO L93 Difference]: Finished difference Result 676 states and 1997 transitions. [2020-02-10 19:45:53,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:53,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:53,096 INFO L225 Difference]: With dead ends: 676 [2020-02-10 19:45:53,096 INFO L226 Difference]: Without dead ends: 660 [2020-02-10 19:45:53,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 19:45:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2020-02-10 19:45:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 401. [2020-02-10 19:45:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 19:45:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1390 transitions. [2020-02-10 19:45:53,106 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1390 transitions. Word has length 22 [2020-02-10 19:45:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:53,106 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1390 transitions. [2020-02-10 19:45:53,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1390 transitions. [2020-02-10 19:45:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:53,107 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:53,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 19:45:53,107 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 19:45:53,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:53,107 INFO L82 PathProgramCache]: Analyzing trace with hash -205319870, now seen corresponding path program 296 times [2020-02-10 19:45:53,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:53,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452530923] [2020-02-10 19:45:53,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:53,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 19:45:53,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452530923] [2020-02-10 19:45:53,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:53,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:53,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572954110] [2020-02-10 19:45:53,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:53,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:53,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:53,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:53,392 INFO L87 Difference]: Start difference. First operand 401 states and 1390 transitions. Second operand 9 states. [2020-02-10 19:45:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:53,515 INFO L93 Difference]: Finished difference Result 671 states and 1984 transitions. [2020-02-10 19:45:53,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:53,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:53,517 INFO L225 Difference]: With dead ends: 671 [2020-02-10 19:45:53,517 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 19:45:53,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:53,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 19:45:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 397. [2020-02-10 19:45:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:45:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1380 transitions. [2020-02-10 19:45:53,528 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1380 transitions. Word has length 22 [2020-02-10 19:45:53,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:53,528 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1380 transitions. [2020-02-10 19:45:53,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1380 transitions. [2020-02-10 19:45:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:53,529 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:53,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 19:45:53,529 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 19:45:53,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:53,529 INFO L82 PathProgramCache]: Analyzing trace with hash -463022828, now seen corresponding path program 297 times [2020-02-10 19:45:53,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:53,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981546453] [2020-02-10 19:45:53,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:53,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 19:45:53,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981546453] [2020-02-10 19:45:53,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:53,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:53,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096235918] [2020-02-10 19:45:53,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:53,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:53,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:53,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:53,814 INFO L87 Difference]: Start difference. First operand 397 states and 1380 transitions. Second operand 9 states. [2020-02-10 19:45:53,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:53,906 INFO L93 Difference]: Finished difference Result 680 states and 2003 transitions. [2020-02-10 19:45:53,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:53,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:53,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:53,908 INFO L225 Difference]: With dead ends: 680 [2020-02-10 19:45:53,908 INFO L226 Difference]: Without dead ends: 664 [2020-02-10 19:45:53,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 19:45:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-02-10 19:45:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 403. [2020-02-10 19:45:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-02-10 19:45:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1390 transitions. [2020-02-10 19:45:53,918 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1390 transitions. Word has length 22 [2020-02-10 19:45:53,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:53,918 INFO L479 AbstractCegarLoop]: Abstraction has 403 states and 1390 transitions. [2020-02-10 19:45:53,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1390 transitions. [2020-02-10 19:45:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:53,919 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:53,919 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:53,919 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 19:45:53,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:53,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2054122856, now seen corresponding path program 298 times [2020-02-10 19:45:53,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:53,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154658944] [2020-02-10 19:45:53,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:54,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 19:45:54,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154658944] [2020-02-10 19:45:54,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:54,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:54,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604726750] [2020-02-10 19:45:54,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:54,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:54,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:54,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:54,204 INFO L87 Difference]: Start difference. First operand 403 states and 1390 transitions. Second operand 9 states. [2020-02-10 19:45:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:54,316 INFO L93 Difference]: Finished difference Result 677 states and 1992 transitions. [2020-02-10 19:45:54,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:54,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:54,318 INFO L225 Difference]: With dead ends: 677 [2020-02-10 19:45:54,318 INFO L226 Difference]: Without dead ends: 658 [2020-02-10 19:45:54,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-02-10 19:45:54,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 397. [2020-02-10 19:45:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:45:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1376 transitions. [2020-02-10 19:45:54,329 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1376 transitions. Word has length 22 [2020-02-10 19:45:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:54,329 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1376 transitions. [2020-02-10 19:45:54,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1376 transitions. [2020-02-10 19:45:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:54,330 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:54,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 19:45:54,330 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 19:45:54,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:54,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1678319242, now seen corresponding path program 299 times [2020-02-10 19:45:54,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:54,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496568069] [2020-02-10 19:45:54,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:54,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 19:45:54,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496568069] [2020-02-10 19:45:54,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:54,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:54,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045155591] [2020-02-10 19:45:54,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:54,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:54,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:54,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:54,607 INFO L87 Difference]: Start difference. First operand 397 states and 1376 transitions. Second operand 9 states. [2020-02-10 19:45:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:54,736 INFO L93 Difference]: Finished difference Result 667 states and 1973 transitions. [2020-02-10 19:45:54,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:54,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:54,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:54,738 INFO L225 Difference]: With dead ends: 667 [2020-02-10 19:45:54,738 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 19:45:54,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 19:45:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 400. [2020-02-10 19:45:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 19:45:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1381 transitions. [2020-02-10 19:45:54,748 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1381 transitions. Word has length 22 [2020-02-10 19:45:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:54,748 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1381 transitions. [2020-02-10 19:45:54,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1381 transitions. [2020-02-10 19:45:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:54,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:54,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 19:45:54,749 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 19:45:54,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash 50728092, now seen corresponding path program 300 times [2020-02-10 19:45:54,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:54,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298840139] [2020-02-10 19:45:54,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:55,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298840139] [2020-02-10 19:45:55,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:55,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:55,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067260455] [2020-02-10 19:45:55,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:55,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:55,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:55,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:55,036 INFO L87 Difference]: Start difference. First operand 400 states and 1381 transitions. Second operand 9 states. [2020-02-10 19:45:55,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:55,150 INFO L93 Difference]: Finished difference Result 669 states and 1974 transitions. [2020-02-10 19:45:55,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:55,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:55,152 INFO L225 Difference]: With dead ends: 669 [2020-02-10 19:45:55,152 INFO L226 Difference]: Without dead ends: 649 [2020-02-10 19:45:55,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 19:45:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2020-02-10 19:45:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 393. [2020-02-10 19:45:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-02-10 19:45:55,162 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-02-10 19:45:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:55,162 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-02-10 19:45:55,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-02-10 19:45:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:55,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:55,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 19:45:55,163 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 19:45:55,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:55,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1969181664, now seen corresponding path program 301 times [2020-02-10 19:45:55,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:55,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014258260] [2020-02-10 19:45:55,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:55,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 19:45:55,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014258260] [2020-02-10 19:45:55,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:55,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:55,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143810007] [2020-02-10 19:45:55,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:55,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:55,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:55,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:55,465 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:45:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:55,573 INFO L93 Difference]: Finished difference Result 696 states and 2042 transitions. [2020-02-10 19:45:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:55,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:55,575 INFO L225 Difference]: With dead ends: 696 [2020-02-10 19:45:55,575 INFO L226 Difference]: Without dead ends: 680 [2020-02-10 19:45:55,575 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-02-10 19:45:55,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 409. [2020-02-10 19:45:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-02-10 19:45:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1404 transitions. [2020-02-10 19:45:55,588 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1404 transitions. Word has length 22 [2020-02-10 19:45:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:55,588 INFO L479 AbstractCegarLoop]: Abstraction has 409 states and 1404 transitions. [2020-02-10 19:45:55,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1404 transitions. [2020-02-10 19:45:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:55,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:55,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 19:45:55,589 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 19:45:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash 471610114, now seen corresponding path program 302 times [2020-02-10 19:45:55,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:55,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227325013] [2020-02-10 19:45:55,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:55,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 19:45:55,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227325013] [2020-02-10 19:45:55,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:55,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:55,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083802983] [2020-02-10 19:45:55,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:55,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:55,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:55,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:55,898 INFO L87 Difference]: Start difference. First operand 409 states and 1404 transitions. Second operand 9 states. [2020-02-10 19:45:56,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:56,005 INFO L93 Difference]: Finished difference Result 694 states and 2032 transitions. [2020-02-10 19:45:56,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:56,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:56,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:56,007 INFO L225 Difference]: With dead ends: 694 [2020-02-10 19:45:56,007 INFO L226 Difference]: Without dead ends: 672 [2020-02-10 19:45:56,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 19:45:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-02-10 19:45:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 401. [2020-02-10 19:45:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 19:45:56,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1384 transitions. [2020-02-10 19:45:56,019 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1384 transitions. Word has length 22 [2020-02-10 19:45:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:56,019 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1384 transitions. [2020-02-10 19:45:56,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1384 transitions. [2020-02-10 19:45:56,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:56,020 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:56,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 19:45:56,020 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 19:45:56,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:56,020 INFO L82 PathProgramCache]: Analyzing trace with hash -836380636, now seen corresponding path program 303 times [2020-02-10 19:45:56,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:56,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266202976] [2020-02-10 19:45:56,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:56,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 19:45:56,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266202976] [2020-02-10 19:45:56,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:56,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:56,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792325682] [2020-02-10 19:45:56,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:56,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:56,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:56,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:56,318 INFO L87 Difference]: Start difference. First operand 401 states and 1384 transitions. Second operand 9 states. [2020-02-10 19:45:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:56,413 INFO L93 Difference]: Finished difference Result 693 states and 2029 transitions. [2020-02-10 19:45:56,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:56,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:56,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:56,415 INFO L225 Difference]: With dead ends: 693 [2020-02-10 19:45:56,416 INFO L226 Difference]: Without dead ends: 677 [2020-02-10 19:45:56,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 19:45:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-02-10 19:45:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 407. [2020-02-10 19:45:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-02-10 19:45:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1394 transitions. [2020-02-10 19:45:56,426 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1394 transitions. Word has length 22 [2020-02-10 19:45:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:56,426 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 1394 transitions. [2020-02-10 19:45:56,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1394 transitions. [2020-02-10 19:45:56,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:56,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:56,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 19:45:56,427 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 19:45:56,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:56,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1867486632, now seen corresponding path program 304 times [2020-02-10 19:45:56,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:56,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278731648] [2020-02-10 19:45:56,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:56,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 19:45:56,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278731648] [2020-02-10 19:45:56,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:56,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:56,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344332232] [2020-02-10 19:45:56,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:56,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:56,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:56,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:56,732 INFO L87 Difference]: Start difference. First operand 407 states and 1394 transitions. Second operand 9 states. [2020-02-10 19:45:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:56,843 INFO L93 Difference]: Finished difference Result 690 states and 2018 transitions. [2020-02-10 19:45:56,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:56,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:56,846 INFO L225 Difference]: With dead ends: 690 [2020-02-10 19:45:56,846 INFO L226 Difference]: Without dead ends: 671 [2020-02-10 19:45:56,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:56,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2020-02-10 19:45:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 401. [2020-02-10 19:45:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 19:45:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1378 transitions. [2020-02-10 19:45:56,856 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1378 transitions. Word has length 22 [2020-02-10 19:45:56,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:56,856 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1378 transitions. [2020-02-10 19:45:56,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:56,856 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1378 transitions. [2020-02-10 19:45:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:56,857 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:56,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:56,857 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 19:45:56,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:56,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1582826058, now seen corresponding path program 305 times [2020-02-10 19:45:56,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:56,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515078537] [2020-02-10 19:45:56,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:57,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515078537] [2020-02-10 19:45:57,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:57,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:57,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035865100] [2020-02-10 19:45:57,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:57,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:57,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:57,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:57,149 INFO L87 Difference]: Start difference. First operand 401 states and 1378 transitions. Second operand 9 states. [2020-02-10 19:45:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:57,259 INFO L93 Difference]: Finished difference Result 688 states and 2015 transitions. [2020-02-10 19:45:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:57,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:57,261 INFO L225 Difference]: With dead ends: 688 [2020-02-10 19:45:57,261 INFO L226 Difference]: Without dead ends: 674 [2020-02-10 19:45:57,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 19:45:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2020-02-10 19:45:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 406. [2020-02-10 19:45:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-02-10 19:45:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1387 transitions. [2020-02-10 19:45:57,270 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1387 transitions. Word has length 22 [2020-02-10 19:45:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:57,271 INFO L479 AbstractCegarLoop]: Abstraction has 406 states and 1387 transitions. [2020-02-10 19:45:57,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1387 transitions. [2020-02-10 19:45:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:57,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:57,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 19:45:57,271 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 19:45:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1527414798, now seen corresponding path program 306 times [2020-02-10 19:45:57,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:57,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916504117] [2020-02-10 19:45:57,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:57,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 19:45:57,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916504117] [2020-02-10 19:45:57,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:57,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:57,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537726842] [2020-02-10 19:45:57,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:57,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:57,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:57,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:57,572 INFO L87 Difference]: Start difference. First operand 406 states and 1387 transitions. Second operand 9 states. [2020-02-10 19:45:57,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:57,707 INFO L93 Difference]: Finished difference Result 687 states and 2008 transitions. [2020-02-10 19:45:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:57,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:57,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:57,709 INFO L225 Difference]: With dead ends: 687 [2020-02-10 19:45:57,709 INFO L226 Difference]: Without dead ends: 661 [2020-02-10 19:45:57,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:57,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-02-10 19:45:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 393. [2020-02-10 19:45:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:45:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1360 transitions. [2020-02-10 19:45:57,721 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1360 transitions. Word has length 22 [2020-02-10 19:45:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:57,721 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1360 transitions. [2020-02-10 19:45:57,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1360 transitions. [2020-02-10 19:45:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:57,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:57,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:57,722 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 19:45:57,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:57,722 INFO L82 PathProgramCache]: Analyzing trace with hash -319200130, now seen corresponding path program 307 times [2020-02-10 19:45:57,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:57,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116048705] [2020-02-10 19:45:57,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:58,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116048705] [2020-02-10 19:45:58,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:58,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:58,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079620410] [2020-02-10 19:45:58,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:58,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:58,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:58,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:58,036 INFO L87 Difference]: Start difference. First operand 393 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:45:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:58,164 INFO L93 Difference]: Finished difference Result 663 states and 1963 transitions. [2020-02-10 19:45:58,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:58,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:58,166 INFO L225 Difference]: With dead ends: 663 [2020-02-10 19:45:58,167 INFO L226 Difference]: Without dead ends: 652 [2020-02-10 19:45:58,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 19:45:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-02-10 19:45:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 399. [2020-02-10 19:45:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:45:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1376 transitions. [2020-02-10 19:45:58,177 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1376 transitions. Word has length 22 [2020-02-10 19:45:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:58,177 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1376 transitions. [2020-02-10 19:45:58,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1376 transitions. [2020-02-10 19:45:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:58,177 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:58,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 19:45:58,178 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 19:45:58,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:58,178 INFO L82 PathProgramCache]: Analyzing trace with hash -300766104, now seen corresponding path program 308 times [2020-02-10 19:45:58,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:58,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268311422] [2020-02-10 19:45:58,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:58,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 19:45:58,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268311422] [2020-02-10 19:45:58,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:58,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:58,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111511197] [2020-02-10 19:45:58,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:58,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:58,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:58,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:58,462 INFO L87 Difference]: Start difference. First operand 399 states and 1376 transitions. Second operand 9 states. [2020-02-10 19:45:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:58,586 INFO L93 Difference]: Finished difference Result 666 states and 1966 transitions. [2020-02-10 19:45:58,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:58,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:58,588 INFO L225 Difference]: With dead ends: 666 [2020-02-10 19:45:58,588 INFO L226 Difference]: Without dead ends: 649 [2020-02-10 19:45:58,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 19:45:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2020-02-10 19:45:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 396. [2020-02-10 19:45:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:45:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1368 transitions. [2020-02-10 19:45:58,599 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1368 transitions. Word has length 22 [2020-02-10 19:45:58,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:58,599 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1368 transitions. [2020-02-10 19:45:58,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:58,599 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1368 transitions. [2020-02-10 19:45:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:58,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:58,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 19:45:58,600 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 19:45:58,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:58,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1170204866, now seen corresponding path program 309 times [2020-02-10 19:45:58,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:58,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047528107] [2020-02-10 19:45:58,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:58,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 19:45:58,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047528107] [2020-02-10 19:45:58,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:58,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:58,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154578297] [2020-02-10 19:45:58,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:58,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:58,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:58,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:58,881 INFO L87 Difference]: Start difference. First operand 396 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:45:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:58,988 INFO L93 Difference]: Finished difference Result 662 states and 1958 transitions. [2020-02-10 19:45:58,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:58,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:58,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:58,990 INFO L225 Difference]: With dead ends: 662 [2020-02-10 19:45:58,990 INFO L226 Difference]: Without dead ends: 651 [2020-02-10 19:45:58,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 19:45:58,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2020-02-10 19:45:58,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 399. [2020-02-10 19:45:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:45:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1373 transitions. [2020-02-10 19:45:59,000 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1373 transitions. Word has length 22 [2020-02-10 19:45:59,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:59,001 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1373 transitions. [2020-02-10 19:45:59,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1373 transitions. [2020-02-10 19:45:59,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:59,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:59,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 19:45:59,001 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 19:45:59,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:59,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1395715096, now seen corresponding path program 310 times [2020-02-10 19:45:59,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:59,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139963699] [2020-02-10 19:45:59,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:59,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139963699] [2020-02-10 19:45:59,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:59,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:59,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607946851] [2020-02-10 19:45:59,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:59,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:59,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:59,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:59,283 INFO L87 Difference]: Start difference. First operand 399 states and 1373 transitions. Second operand 9 states. [2020-02-10 19:45:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:59,405 INFO L93 Difference]: Finished difference Result 664 states and 1959 transitions. [2020-02-10 19:45:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:59,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:59,407 INFO L225 Difference]: With dead ends: 664 [2020-02-10 19:45:59,407 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 19:45:59,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 19:45:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 19:45:59,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 396. [2020-02-10 19:45:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:45:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1365 transitions. [2020-02-10 19:45:59,418 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1365 transitions. Word has length 22 [2020-02-10 19:45:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:59,418 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1365 transitions. [2020-02-10 19:45:59,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1365 transitions. [2020-02-10 19:45:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:59,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:59,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 19:45:59,419 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 19:45:59,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:59,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1760093698, now seen corresponding path program 311 times [2020-02-10 19:45:59,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:59,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580618416] [2020-02-10 19:45:59,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:59,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 19:45:59,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580618416] [2020-02-10 19:45:59,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:59,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:45:59,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792951869] [2020-02-10 19:45:59,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:45:59,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:59,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:45:59,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:59,704 INFO L87 Difference]: Start difference. First operand 396 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:45:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:59,818 INFO L93 Difference]: Finished difference Result 670 states and 1973 transitions. [2020-02-10 19:45:59,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:45:59,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:45:59,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:59,820 INFO L225 Difference]: With dead ends: 670 [2020-02-10 19:45:59,820 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 19:45:59,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 19:45:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 19:45:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 401. [2020-02-10 19:45:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 19:45:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1374 transitions. [2020-02-10 19:45:59,831 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1374 transitions. Word has length 22 [2020-02-10 19:45:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:59,831 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1374 transitions. [2020-02-10 19:45:59,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:45:59,831 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1374 transitions. [2020-02-10 19:45:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:45:59,832 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:59,832 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:59,832 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 19:45:59,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:59,832 INFO L82 PathProgramCache]: Analyzing trace with hash -824260290, now seen corresponding path program 312 times [2020-02-10 19:45:59,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:59,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422113132] [2020-02-10 19:45:59,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:00,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 19:46:00,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422113132] [2020-02-10 19:46:00,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:00,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:00,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357216617] [2020-02-10 19:46:00,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:00,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:00,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:00,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:00,121 INFO L87 Difference]: Start difference. First operand 401 states and 1374 transitions. Second operand 9 states. [2020-02-10 19:46:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:00,265 INFO L93 Difference]: Finished difference Result 669 states and 1966 transitions. [2020-02-10 19:46:00,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:00,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:00,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:00,267 INFO L225 Difference]: With dead ends: 669 [2020-02-10 19:46:00,267 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 19:46:00,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 19:46:00,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 19:46:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 387. [2020-02-10 19:46:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:46:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1348 transitions. [2020-02-10 19:46:00,278 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1348 transitions. Word has length 22 [2020-02-10 19:46:00,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:00,278 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1348 transitions. [2020-02-10 19:46:00,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:00,278 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1348 transitions. [2020-02-10 19:46:00,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:00,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:00,279 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:00,279 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 19:46:00,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:00,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1956856404, now seen corresponding path program 313 times [2020-02-10 19:46:00,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:00,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705963889] [2020-02-10 19:46:00,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:00,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 19:46:00,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705963889] [2020-02-10 19:46:00,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:00,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:00,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687725623] [2020-02-10 19:46:00,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:00,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:00,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:00,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:00,550 INFO L87 Difference]: Start difference. First operand 387 states and 1348 transitions. Second operand 9 states. [2020-02-10 19:46:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:00,646 INFO L93 Difference]: Finished difference Result 652 states and 1916 transitions. [2020-02-10 19:46:00,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:00,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:00,648 INFO L225 Difference]: With dead ends: 652 [2020-02-10 19:46:00,648 INFO L226 Difference]: Without dead ends: 636 [2020-02-10 19:46:00,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:00,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-02-10 19:46:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 396. [2020-02-10 19:46:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:46:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1371 transitions. [2020-02-10 19:46:00,657 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1371 transitions. Word has length 22 [2020-02-10 19:46:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:00,657 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1371 transitions. [2020-02-10 19:46:00,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1371 transitions. [2020-02-10 19:46:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:00,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:00,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 19:46:00,658 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 19:46:00,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:00,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1777042400, now seen corresponding path program 314 times [2020-02-10 19:46:00,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:00,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166970779] [2020-02-10 19:46:00,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:00,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 19:46:00,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166970779] [2020-02-10 19:46:00,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:00,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:00,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694602745] [2020-02-10 19:46:00,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:00,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:00,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:00,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:00,939 INFO L87 Difference]: Start difference. First operand 396 states and 1371 transitions. Second operand 9 states. [2020-02-10 19:46:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:01,029 INFO L93 Difference]: Finished difference Result 645 states and 1901 transitions. [2020-02-10 19:46:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:01,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:01,031 INFO L225 Difference]: With dead ends: 645 [2020-02-10 19:46:01,032 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 19:46:01,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 19:46:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 19:46:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 394. [2020-02-10 19:46:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-02-10 19:46:01,042 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-02-10 19:46:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:01,042 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-02-10 19:46:01,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-02-10 19:46:01,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:01,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:01,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 19:46:01,043 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 19:46:01,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:01,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1325418360, now seen corresponding path program 315 times [2020-02-10 19:46:01,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:01,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459149964] [2020-02-10 19:46:01,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:01,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 19:46:01,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459149964] [2020-02-10 19:46:01,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:01,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:01,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730511379] [2020-02-10 19:46:01,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:01,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:01,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:01,336 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-02-10 19:46:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:01,447 INFO L93 Difference]: Finished difference Result 663 states and 1940 transitions. [2020-02-10 19:46:01,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:01,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:01,449 INFO L225 Difference]: With dead ends: 663 [2020-02-10 19:46:01,449 INFO L226 Difference]: Without dead ends: 647 [2020-02-10 19:46:01,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 19:46:01,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-02-10 19:46:01,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 402. [2020-02-10 19:46:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 19:46:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1380 transitions. [2020-02-10 19:46:01,460 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1380 transitions. Word has length 22 [2020-02-10 19:46:01,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:01,460 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1380 transitions. [2020-02-10 19:46:01,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:01,460 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1380 transitions. [2020-02-10 19:46:01,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:01,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:01,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 19:46:01,461 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 19:46:01,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:01,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1455388806, now seen corresponding path program 316 times [2020-02-10 19:46:01,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:01,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929635504] [2020-02-10 19:46:01,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:01,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 19:46:01,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929635504] [2020-02-10 19:46:01,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:01,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:01,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025535255] [2020-02-10 19:46:01,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:01,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:01,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:01,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:01,751 INFO L87 Difference]: Start difference. First operand 402 states and 1380 transitions. Second operand 9 states. [2020-02-10 19:46:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:01,886 INFO L93 Difference]: Finished difference Result 661 states and 1930 transitions. [2020-02-10 19:46:01,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:01,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:01,888 INFO L225 Difference]: With dead ends: 661 [2020-02-10 19:46:01,888 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 19:46:01,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 19:46:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 19:46:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 394. [2020-02-10 19:46:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1364 transitions. [2020-02-10 19:46:01,898 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1364 transitions. Word has length 22 [2020-02-10 19:46:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:01,898 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1364 transitions. [2020-02-10 19:46:01,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1364 transitions. [2020-02-10 19:46:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:01,899 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:01,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 19:46:01,899 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 19:46:01,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:01,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1270696134, now seen corresponding path program 317 times [2020-02-10 19:46:01,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:01,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934832293] [2020-02-10 19:46:01,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:02,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 19:46:02,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934832293] [2020-02-10 19:46:02,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:02,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:02,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650413173] [2020-02-10 19:46:02,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:02,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:02,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:02,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:02,182 INFO L87 Difference]: Start difference. First operand 394 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:46:02,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:02,273 INFO L93 Difference]: Finished difference Result 642 states and 1893 transitions. [2020-02-10 19:46:02,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:02,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:02,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:02,275 INFO L225 Difference]: With dead ends: 642 [2020-02-10 19:46:02,275 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 19:46:02,275 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 19:46:02,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 395. [2020-02-10 19:46:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:46:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1365 transitions. [2020-02-10 19:46:02,286 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1365 transitions. Word has length 22 [2020-02-10 19:46:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:02,286 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1365 transitions. [2020-02-10 19:46:02,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1365 transitions. [2020-02-10 19:46:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:02,287 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:02,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 19:46:02,287 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 19:46:02,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:02,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1948560006, now seen corresponding path program 318 times [2020-02-10 19:46:02,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:02,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637778235] [2020-02-10 19:46:02,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:02,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 19:46:02,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637778235] [2020-02-10 19:46:02,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:02,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:02,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398419696] [2020-02-10 19:46:02,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:02,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:02,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:02,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:02,554 INFO L87 Difference]: Start difference. First operand 395 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:46:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:02,677 INFO L93 Difference]: Finished difference Result 647 states and 1902 transitions. [2020-02-10 19:46:02,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:02,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:02,679 INFO L225 Difference]: With dead ends: 647 [2020-02-10 19:46:02,679 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 19:46:02,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 19:46:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 19:46:02,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 391. [2020-02-10 19:46:02,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:46:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-02-10 19:46:02,690 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-02-10 19:46:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:02,690 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-02-10 19:46:02,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-02-10 19:46:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:02,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:02,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 19:46:02,691 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 19:46:02,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:02,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1513957264, now seen corresponding path program 319 times [2020-02-10 19:46:02,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:02,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31766389] [2020-02-10 19:46:02,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:02,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 19:46:02,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31766389] [2020-02-10 19:46:02,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:02,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:02,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125271996] [2020-02-10 19:46:02,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:02,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:02,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:02,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:02,965 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:46:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:03,065 INFO L93 Difference]: Finished difference Result 648 states and 1905 transitions. [2020-02-10 19:46:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:03,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:03,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:03,067 INFO L225 Difference]: With dead ends: 648 [2020-02-10 19:46:03,067 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 19:46:03,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 19:46:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 19:46:03,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 395. [2020-02-10 19:46:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:46:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1366 transitions. [2020-02-10 19:46:03,076 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1366 transitions. Word has length 22 [2020-02-10 19:46:03,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:03,077 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1366 transitions. [2020-02-10 19:46:03,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1366 transitions. [2020-02-10 19:46:03,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:03,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:03,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 19:46:03,077 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 19:46:03,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:03,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2075025756, now seen corresponding path program 320 times [2020-02-10 19:46:03,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:03,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845252289] [2020-02-10 19:46:03,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:03,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 19:46:03,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845252289] [2020-02-10 19:46:03,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:03,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:03,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033652154] [2020-02-10 19:46:03,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:03,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:03,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:03,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:03,362 INFO L87 Difference]: Start difference. First operand 395 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:46:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:03,476 INFO L93 Difference]: Finished difference Result 641 states and 1890 transitions. [2020-02-10 19:46:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:03,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:03,478 INFO L225 Difference]: With dead ends: 641 [2020-02-10 19:46:03,478 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 19:46:03,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 19:46:03,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 19:46:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 393. [2020-02-10 19:46:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:46:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-02-10 19:46:03,488 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-02-10 19:46:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:03,489 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-02-10 19:46:03,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-02-10 19:46:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:03,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:03,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 19:46:03,490 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 19:46:03,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:03,490 INFO L82 PathProgramCache]: Analyzing trace with hash -674225912, now seen corresponding path program 321 times [2020-02-10 19:46:03,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:03,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723718191] [2020-02-10 19:46:03,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:03,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 19:46:03,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723718191] [2020-02-10 19:46:03,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:03,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:03,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260769750] [2020-02-10 19:46:03,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:03,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:03,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:03,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:03,779 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:46:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:03,881 INFO L93 Difference]: Finished difference Result 656 states and 1923 transitions. [2020-02-10 19:46:03,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:03,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:03,884 INFO L225 Difference]: With dead ends: 656 [2020-02-10 19:46:03,884 INFO L226 Difference]: Without dead ends: 640 [2020-02-10 19:46:03,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 19:46:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-02-10 19:46:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 399. [2020-02-10 19:46:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:46:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1372 transitions. [2020-02-10 19:46:03,894 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1372 transitions. Word has length 22 [2020-02-10 19:46:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:03,894 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1372 transitions. [2020-02-10 19:46:03,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1372 transitions. [2020-02-10 19:46:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:03,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:03,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 19:46:03,895 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 19:46:03,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:03,895 INFO L82 PathProgramCache]: Analyzing trace with hash -481405220, now seen corresponding path program 322 times [2020-02-10 19:46:03,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:03,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371943305] [2020-02-10 19:46:03,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:04,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 19:46:04,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371943305] [2020-02-10 19:46:04,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:04,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:04,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834002817] [2020-02-10 19:46:04,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:04,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:04,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:04,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:04,179 INFO L87 Difference]: Start difference. First operand 399 states and 1372 transitions. Second operand 9 states. [2020-02-10 19:46:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:04,303 INFO L93 Difference]: Finished difference Result 653 states and 1912 transitions. [2020-02-10 19:46:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:04,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:04,305 INFO L225 Difference]: With dead ends: 653 [2020-02-10 19:46:04,305 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 19:46:04,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 19:46:04,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 19:46:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 393. [2020-02-10 19:46:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:46:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1360 transitions. [2020-02-10 19:46:04,316 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1360 transitions. Word has length 22 [2020-02-10 19:46:04,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:04,316 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1360 transitions. [2020-02-10 19:46:04,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1360 transitions. [2020-02-10 19:46:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:04,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:04,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 19:46:04,317 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 19:46:04,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:04,317 INFO L82 PathProgramCache]: Analyzing trace with hash -619503686, now seen corresponding path program 323 times [2020-02-10 19:46:04,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:04,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522562344] [2020-02-10 19:46:04,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:04,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522562344] [2020-02-10 19:46:04,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:04,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:04,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204520153] [2020-02-10 19:46:04,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:04,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:04,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:04,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:04,594 INFO L87 Difference]: Start difference. First operand 393 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:46:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:04,711 INFO L93 Difference]: Finished difference Result 637 states and 1881 transitions. [2020-02-10 19:46:04,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:04,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:04,720 INFO L225 Difference]: With dead ends: 637 [2020-02-10 19:46:04,720 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 19:46:04,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 19:46:04,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 19:46:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 394. [2020-02-10 19:46:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1361 transitions. [2020-02-10 19:46:04,730 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1361 transitions. Word has length 22 [2020-02-10 19:46:04,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:04,731 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1361 transitions. [2020-02-10 19:46:04,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1361 transitions. [2020-02-10 19:46:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:04,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:04,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 19:46:04,731 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 19:46:04,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:04,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1526667074, now seen corresponding path program 324 times [2020-02-10 19:46:04,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:04,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350618036] [2020-02-10 19:46:04,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:04,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 19:46:04,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350618036] [2020-02-10 19:46:04,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:04,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:04,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93289591] [2020-02-10 19:46:04,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:05,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:05,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:05,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:05,000 INFO L87 Difference]: Start difference. First operand 394 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:46:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:05,138 INFO L93 Difference]: Finished difference Result 641 states and 1888 transitions. [2020-02-10 19:46:05,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:05,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:05,140 INFO L225 Difference]: With dead ends: 641 [2020-02-10 19:46:05,140 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 19:46:05,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 19:46:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 19:46:05,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 391. [2020-02-10 19:46:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:46:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-02-10 19:46:05,150 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-02-10 19:46:05,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:05,150 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-02-10 19:46:05,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-02-10 19:46:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:05,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:05,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 19:46:05,151 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 19:46:05,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:05,151 INFO L82 PathProgramCache]: Analyzing trace with hash -439620080, now seen corresponding path program 325 times [2020-02-10 19:46:05,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:05,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61353047] [2020-02-10 19:46:05,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:05,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 19:46:05,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61353047] [2020-02-10 19:46:05,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:05,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:05,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539700079] [2020-02-10 19:46:05,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:05,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:05,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:05,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:05,448 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:46:05,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:05,549 INFO L93 Difference]: Finished difference Result 680 states and 1986 transitions. [2020-02-10 19:46:05,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:05,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:05,551 INFO L225 Difference]: With dead ends: 680 [2020-02-10 19:46:05,551 INFO L226 Difference]: Without dead ends: 664 [2020-02-10 19:46:05,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 19:46:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-02-10 19:46:05,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 407. [2020-02-10 19:46:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-02-10 19:46:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1394 transitions. [2020-02-10 19:46:05,561 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1394 transitions. Word has length 22 [2020-02-10 19:46:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:05,561 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 1394 transitions. [2020-02-10 19:46:05,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1394 transitions. [2020-02-10 19:46:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:05,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:05,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 19:46:05,562 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 19:46:05,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:05,562 INFO L82 PathProgramCache]: Analyzing trace with hash -569590526, now seen corresponding path program 326 times [2020-02-10 19:46:05,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:05,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88528087] [2020-02-10 19:46:05,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:05,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 19:46:05,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88528087] [2020-02-10 19:46:05,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:05,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:05,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076306269] [2020-02-10 19:46:05,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:05,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:05,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:05,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:05,863 INFO L87 Difference]: Start difference. First operand 407 states and 1394 transitions. Second operand 9 states. [2020-02-10 19:46:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:06,000 INFO L93 Difference]: Finished difference Result 678 states and 1976 transitions. [2020-02-10 19:46:06,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:06,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:06,002 INFO L225 Difference]: With dead ends: 678 [2020-02-10 19:46:06,002 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 19:46:06,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 19:46:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 19:46:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 399. [2020-02-10 19:46:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:46:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1374 transitions. [2020-02-10 19:46:06,012 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1374 transitions. Word has length 22 [2020-02-10 19:46:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:06,012 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1374 transitions. [2020-02-10 19:46:06,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1374 transitions. [2020-02-10 19:46:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:06,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:06,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 19:46:06,013 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 19:46:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:06,013 INFO L82 PathProgramCache]: Analyzing trace with hash 654471508, now seen corresponding path program 327 times [2020-02-10 19:46:06,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:06,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524070899] [2020-02-10 19:46:06,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:06,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 19:46:06,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524070899] [2020-02-10 19:46:06,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:06,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:06,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734955649] [2020-02-10 19:46:06,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:06,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:06,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:06,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:06,314 INFO L87 Difference]: Start difference. First operand 399 states and 1374 transitions. Second operand 9 states. [2020-02-10 19:46:06,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:06,415 INFO L93 Difference]: Finished difference Result 677 states and 1973 transitions. [2020-02-10 19:46:06,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:06,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:06,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:06,416 INFO L225 Difference]: With dead ends: 677 [2020-02-10 19:46:06,417 INFO L226 Difference]: Without dead ends: 661 [2020-02-10 19:46:06,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 19:46:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-02-10 19:46:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 405. [2020-02-10 19:46:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-02-10 19:46:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1384 transitions. [2020-02-10 19:46:06,426 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1384 transitions. Word has length 22 [2020-02-10 19:46:06,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:06,426 INFO L479 AbstractCegarLoop]: Abstraction has 405 states and 1384 transitions. [2020-02-10 19:46:06,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1384 transitions. [2020-02-10 19:46:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:06,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:06,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 19:46:06,427 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 19:46:06,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:06,427 INFO L82 PathProgramCache]: Analyzing trace with hash 847292200, now seen corresponding path program 328 times [2020-02-10 19:46:06,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:06,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561432107] [2020-02-10 19:46:06,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:06,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 19:46:06,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561432107] [2020-02-10 19:46:06,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:06,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:06,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009318916] [2020-02-10 19:46:06,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:06,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:06,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:06,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:06,726 INFO L87 Difference]: Start difference. First operand 405 states and 1384 transitions. Second operand 9 states. [2020-02-10 19:46:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:06,862 INFO L93 Difference]: Finished difference Result 674 states and 1962 transitions. [2020-02-10 19:46:06,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:06,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:06,864 INFO L225 Difference]: With dead ends: 674 [2020-02-10 19:46:06,864 INFO L226 Difference]: Without dead ends: 655 [2020-02-10 19:46:06,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2020-02-10 19:46:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 399. [2020-02-10 19:46:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:46:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1368 transitions. [2020-02-10 19:46:06,875 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1368 transitions. Word has length 22 [2020-02-10 19:46:06,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:06,875 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1368 transitions. [2020-02-10 19:46:06,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:06,875 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1368 transitions. [2020-02-10 19:46:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:06,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:06,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 19:46:06,876 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 19:46:06,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:06,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1137908070, now seen corresponding path program 329 times [2020-02-10 19:46:06,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:06,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824290407] [2020-02-10 19:46:06,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:07,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 19:46:07,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824290407] [2020-02-10 19:46:07,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:07,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:07,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679210579] [2020-02-10 19:46:07,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:07,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:07,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:07,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:07,164 INFO L87 Difference]: Start difference. First operand 399 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:46:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:07,310 INFO L93 Difference]: Finished difference Result 672 states and 1959 transitions. [2020-02-10 19:46:07,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:07,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:07,312 INFO L225 Difference]: With dead ends: 672 [2020-02-10 19:46:07,312 INFO L226 Difference]: Without dead ends: 658 [2020-02-10 19:46:07,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 19:46:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-02-10 19:46:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 404. [2020-02-10 19:46:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-02-10 19:46:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1377 transitions. [2020-02-10 19:46:07,322 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1377 transitions. Word has length 22 [2020-02-10 19:46:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:07,323 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 1377 transitions. [2020-02-10 19:46:07,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1377 transitions. [2020-02-10 19:46:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:07,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:07,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 19:46:07,324 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 19:46:07,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:07,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1193319330, now seen corresponding path program 330 times [2020-02-10 19:46:07,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:07,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973272993] [2020-02-10 19:46:07,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:07,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 19:46:07,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973272993] [2020-02-10 19:46:07,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:07,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:07,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250900831] [2020-02-10 19:46:07,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:07,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:07,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:07,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:07,614 INFO L87 Difference]: Start difference. First operand 404 states and 1377 transitions. Second operand 9 states. [2020-02-10 19:46:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:07,756 INFO L93 Difference]: Finished difference Result 671 states and 1952 transitions. [2020-02-10 19:46:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:07,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:07,758 INFO L225 Difference]: With dead ends: 671 [2020-02-10 19:46:07,758 INFO L226 Difference]: Without dead ends: 645 [2020-02-10 19:46: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 19:46:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-02-10 19:46:07,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 391. [2020-02-10 19:46:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:46:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1352 transitions. [2020-02-10 19:46:07,769 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1352 transitions. Word has length 22 [2020-02-10 19:46:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:07,770 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1352 transitions. [2020-02-10 19:46:07,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1352 transitions. [2020-02-10 19:46:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:07,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:07,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 19:46:07,770 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 19:46:07,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:07,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1098237084, now seen corresponding path program 331 times [2020-02-10 19:46:07,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:07,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187991630] [2020-02-10 19:46:07,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:08,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 19:46:08,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187991630] [2020-02-10 19:46:08,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:08,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:08,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853419325] [2020-02-10 19:46:08,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:08,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:08,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:08,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:08,045 INFO L87 Difference]: Start difference. First operand 391 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:46:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:08,151 INFO L93 Difference]: Finished difference Result 633 states and 1871 transitions. [2020-02-10 19:46:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:08,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:08,153 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:46:08,153 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 19:46:08,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 19:46:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 19:46:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 393. [2020-02-10 19:46:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:46:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1356 transitions. [2020-02-10 19:46:08,163 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1356 transitions. Word has length 22 [2020-02-10 19:46:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:08,163 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1356 transitions. [2020-02-10 19:46:08,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1356 transitions. [2020-02-10 19:46:08,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:08,164 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:08,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 19:46:08,164 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 19:46:08,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:08,165 INFO L82 PathProgramCache]: Analyzing trace with hash 22525928, now seen corresponding path program 332 times [2020-02-10 19:46:08,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:08,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893069410] [2020-02-10 19:46:08,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:08,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 19:46:08,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893069410] [2020-02-10 19:46:08,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:08,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:08,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825478968] [2020-02-10 19:46:08,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:08,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:08,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:08,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:08,438 INFO L87 Difference]: Start difference. First operand 393 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:46:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:08,581 INFO L93 Difference]: Finished difference Result 638 states and 1880 transitions. [2020-02-10 19:46:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:08,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:08,583 INFO L225 Difference]: With dead ends: 638 [2020-02-10 19:46:08,584 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 19:46:08,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 19:46:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 19:46:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 392. [2020-02-10 19:46:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:46:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-02-10 19:46:08,593 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-02-10 19:46:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:08,594 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-02-10 19:46:08,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-02-10 19:46:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:08,594 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:08,594 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:08,594 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 19:46:08,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:08,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2102638624, now seen corresponding path program 333 times [2020-02-10 19:46:08,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:08,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996128742] [2020-02-10 19:46:08,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:08,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 19:46:08,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996128742] [2020-02-10 19:46:08,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:08,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:08,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145423555] [2020-02-10 19:46:08,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:08,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:08,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:08,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:08,878 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:46:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:08,976 INFO L93 Difference]: Finished difference Result 632 states and 1868 transitions. [2020-02-10 19:46:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:08,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:08,978 INFO L225 Difference]: With dead ends: 632 [2020-02-10 19:46:08,978 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 19:46:08,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 19:46:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 19:46:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 393. [2020-02-10 19:46:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:46:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1355 transitions. [2020-02-10 19:46:08,987 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1355 transitions. Word has length 22 [2020-02-10 19:46:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:08,988 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1355 transitions. [2020-02-10 19:46:08,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:08,988 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1355 transitions. [2020-02-10 19:46:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:08,988 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:08,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 19:46:08,988 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 19:46:08,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:08,989 INFO L82 PathProgramCache]: Analyzing trace with hash 43532136, now seen corresponding path program 334 times [2020-02-10 19:46:08,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:08,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477221623] [2020-02-10 19:46:08,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:09,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 19:46:09,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477221623] [2020-02-10 19:46:09,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:09,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:09,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537575997] [2020-02-10 19:46:09,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:09,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:09,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:09,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:09,278 INFO L87 Difference]: Start difference. First operand 393 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:46:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:09,423 INFO L93 Difference]: Finished difference Result 636 states and 1875 transitions. [2020-02-10 19:46:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:09,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:09,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:09,425 INFO L225 Difference]: With dead ends: 636 [2020-02-10 19:46:09,425 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 19:46:09,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 19:46:09,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 19:46:09,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 392. [2020-02-10 19:46:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:46:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1353 transitions. [2020-02-10 19:46:09,435 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1353 transitions. Word has length 22 [2020-02-10 19:46:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:09,435 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1353 transitions. [2020-02-10 19:46:09,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1353 transitions. [2020-02-10 19:46:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:09,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:09,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 19:46:09,436 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 19:46:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:09,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2129310048, now seen corresponding path program 335 times [2020-02-10 19:46:09,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:09,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071205071] [2020-02-10 19:46:09,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:09,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 19:46:09,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071205071] [2020-02-10 19:46:09,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:09,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:09,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416642119] [2020-02-10 19:46:09,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:09,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:09,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:09,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:09,724 INFO L87 Difference]: Start difference. First operand 392 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:46:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:09,866 INFO L93 Difference]: Finished difference Result 646 states and 1899 transitions. [2020-02-10 19:46:09,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:09,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:09,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:09,868 INFO L225 Difference]: With dead ends: 646 [2020-02-10 19:46:09,868 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 19:46:09,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 19:46:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 19:46:09,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 397. [2020-02-10 19:46:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:46:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1362 transitions. [2020-02-10 19:46:09,878 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1362 transitions. Word has length 22 [2020-02-10 19:46:09,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:09,878 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1362 transitions. [2020-02-10 19:46:09,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1362 transitions. [2020-02-10 19:46:09,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:09,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:09,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 19:46:09,879 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 19:46:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:09,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1056224668, now seen corresponding path program 336 times [2020-02-10 19:46:09,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:09,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51736222] [2020-02-10 19:46:09,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:10,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 19:46:10,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51736222] [2020-02-10 19:46:10,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:10,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:10,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674057332] [2020-02-10 19:46:10,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:10,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:10,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:10,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:10,184 INFO L87 Difference]: Start difference. First operand 397 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:46:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:10,328 INFO L93 Difference]: Finished difference Result 645 states and 1892 transitions. [2020-02-10 19:46:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:10,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:10,331 INFO L225 Difference]: With dead ends: 645 [2020-02-10 19:46:10,331 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 19:46:10,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 19:46:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 387. [2020-02-10 19:46:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:46:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1344 transitions. [2020-02-10 19:46:10,340 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1344 transitions. Word has length 22 [2020-02-10 19:46:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:10,340 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1344 transitions. [2020-02-10 19:46:10,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1344 transitions. [2020-02-10 19:46:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:10,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:10,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 19:46:10,341 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 19:46:10,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:10,341 INFO L82 PathProgramCache]: Analyzing trace with hash -525304394, now seen corresponding path program 337 times [2020-02-10 19:46:10,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:10,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95451908] [2020-02-10 19:46:10,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46: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 19:46:10,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95451908] [2020-02-10 19:46:10,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:10,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:10,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786822923] [2020-02-10 19:46:10,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:10,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:10,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:10,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:10,612 INFO L87 Difference]: Start difference. First operand 387 states and 1344 transitions. Second operand 9 states. [2020-02-10 19:46:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:10,742 INFO L93 Difference]: Finished difference Result 603 states and 1802 transitions. [2020-02-10 19:46:10,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:10,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:10,744 INFO L225 Difference]: With dead ends: 603 [2020-02-10 19:46:10,744 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:46:10,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 19:46:10,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:46:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 390. [2020-02-10 19:46:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:46:10,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1352 transitions. [2020-02-10 19:46:10,754 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1352 transitions. Word has length 22 [2020-02-10 19:46:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:10,754 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1352 transitions. [2020-02-10 19:46:10,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1352 transitions. [2020-02-10 19:46:10,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:10,755 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:10,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 19:46:10,755 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 19:46:10,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:10,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1970821404, now seen corresponding path program 338 times [2020-02-10 19:46:10,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:10,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830444746] [2020-02-10 19:46:10,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:11,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 19:46:11,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830444746] [2020-02-10 19:46:11,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:11,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:11,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320609549] [2020-02-10 19:46:11,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:11,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:11,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:11,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:11,035 INFO L87 Difference]: Start difference. First operand 390 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:46:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:11,130 INFO L93 Difference]: Finished difference Result 601 states and 1797 transitions. [2020-02-10 19:46:11,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:11,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:11,132 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:46:11,132 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:46:11,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 19:46:11,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:46:11,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 389. [2020-02-10 19:46:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:46:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1350 transitions. [2020-02-10 19:46:11,143 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1350 transitions. Word has length 22 [2020-02-10 19:46:11,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:11,143 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1350 transitions. [2020-02-10 19:46:11,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1350 transitions. [2020-02-10 19:46:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:11,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:11,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 19:46:11,144 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 19:46:11,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:11,144 INFO L82 PathProgramCache]: Analyzing trace with hash 487388138, now seen corresponding path program 339 times [2020-02-10 19:46:11,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:11,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696423354] [2020-02-10 19:46:11,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:11,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 19:46:11,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696423354] [2020-02-10 19:46:11,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:11,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:11,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161617933] [2020-02-10 19:46:11,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:11,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:11,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:11,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:11,405 INFO L87 Difference]: Start difference. First operand 389 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:46:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:11,529 INFO L93 Difference]: Finished difference Result 610 states and 1817 transitions. [2020-02-10 19:46:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:11,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:11,531 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:46:11,531 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:46:11,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:46:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 392. [2020-02-10 19:46:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:46:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1355 transitions. [2020-02-10 19:46:11,541 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1355 transitions. Word has length 22 [2020-02-10 19:46:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:11,541 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1355 transitions. [2020-02-10 19:46:11,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1355 transitions. [2020-02-10 19:46:11,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:11,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:11,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 19:46:11,542 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 19:46:11,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:11,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1873423268, now seen corresponding path program 340 times [2020-02-10 19:46:11,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:11,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828248414] [2020-02-10 19:46:11,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:11,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 19:46:11,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828248414] [2020-02-10 19:46:11,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:11,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:11,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369519417] [2020-02-10 19:46:11,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:11,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:11,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:11,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:11,804 INFO L87 Difference]: Start difference. First operand 392 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:46:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:11,943 INFO L93 Difference]: Finished difference Result 613 states and 1820 transitions. [2020-02-10 19:46:11,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:11,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:11,945 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:46:11,945 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:46:11,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 19:46:11,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:46:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 389. [2020-02-10 19:46:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:46:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1349 transitions. [2020-02-10 19:46:11,955 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1349 transitions. Word has length 22 [2020-02-10 19:46:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:11,955 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1349 transitions. [2020-02-10 19:46:11,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1349 transitions. [2020-02-10 19:46:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:11,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:11,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 19:46:11,956 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 19:46:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:11,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1736400570, now seen corresponding path program 341 times [2020-02-10 19:46:11,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:11,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142276777] [2020-02-10 19:46:11,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:12,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 19:46:12,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142276777] [2020-02-10 19:46:12,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:12,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:12,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833041575] [2020-02-10 19:46:12,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:12,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:12,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:12,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:12,229 INFO L87 Difference]: Start difference. First operand 389 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:46:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:12,342 INFO L93 Difference]: Finished difference Result 604 states and 1802 transitions. [2020-02-10 19:46:12,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:12,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:12,344 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:46:12,345 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 19:46:12,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 19:46:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 19:46:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 390. [2020-02-10 19:46:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:46:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1350 transitions. [2020-02-10 19:46:12,355 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1350 transitions. Word has length 22 [2020-02-10 19:46:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:12,355 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1350 transitions. [2020-02-10 19:46:12,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1350 transitions. [2020-02-10 19:46:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:12,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:12,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 19:46:12,356 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 19:46:12,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:12,356 INFO L82 PathProgramCache]: Analyzing trace with hash 660689414, now seen corresponding path program 342 times [2020-02-10 19:46:12,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:12,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225731772] [2020-02-10 19:46:12,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:12,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 19:46:12,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225731772] [2020-02-10 19:46:12,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:12,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:12,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274293215] [2020-02-10 19:46:12,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:12,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:12,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:12,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:12,614 INFO L87 Difference]: Start difference. First operand 390 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:46:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:12,756 INFO L93 Difference]: Finished difference Result 609 states and 1811 transitions. [2020-02-10 19:46:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:12,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:12,758 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:46:12,758 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:46:12,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 19:46:12,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:46:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 388. [2020-02-10 19:46:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:46:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1347 transitions. [2020-02-10 19:46:12,768 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1347 transitions. Word has length 22 [2020-02-10 19:46:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:12,769 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1347 transitions. [2020-02-10 19:46:12,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1347 transitions. [2020-02-10 19:46:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:12,769 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:12,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 19:46:12,769 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 19:46:12,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:12,770 INFO L82 PathProgramCache]: Analyzing trace with hash -968203534, now seen corresponding path program 343 times [2020-02-10 19:46:12,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:12,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080273741] [2020-02-10 19:46:12,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:13,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:13,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080273741] [2020-02-10 19:46:13,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:13,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:13,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398204213] [2020-02-10 19:46:13,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:13,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:13,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:13,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:13,036 INFO L87 Difference]: Start difference. First operand 388 states and 1347 transitions. Second operand 9 states. [2020-02-10 19:46:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:13,174 INFO L93 Difference]: Finished difference Result 602 states and 1799 transitions. [2020-02-10 19:46:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:13,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:13,176 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:46:13,176 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:46:13,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:46:13,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 390. [2020-02-10 19:46:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:46:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1351 transitions. [2020-02-10 19:46:13,186 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1351 transitions. Word has length 22 [2020-02-10 19:46:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:13,186 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1351 transitions. [2020-02-10 19:46:13,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1351 transitions. [2020-02-10 19:46:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:13,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:13,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:13,187 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 19:46:13,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1881246752, now seen corresponding path program 344 times [2020-02-10 19:46:13,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:13,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851416998] [2020-02-10 19:46:13,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:13,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 19:46:13,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851416998] [2020-02-10 19:46:13,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:13,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:13,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848253921] [2020-02-10 19:46:13,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:13,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:13,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:13,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:13,470 INFO L87 Difference]: Start difference. First operand 390 states and 1351 transitions. Second operand 9 states. [2020-02-10 19:46:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:13,586 INFO L93 Difference]: Finished difference Result 600 states and 1794 transitions. [2020-02-10 19:46:13,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:13,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:13,588 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:46:13,588 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:46:13,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 19:46:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:46:13,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 389. [2020-02-10 19:46:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:46:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1349 transitions. [2020-02-10 19:46:13,598 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1349 transitions. Word has length 22 [2020-02-10 19:46:13,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:13,598 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1349 transitions. [2020-02-10 19:46:13,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1349 transitions. [2020-02-10 19:46:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:13,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:13,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 19:46:13,599 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 19:46:13,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:13,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1138580586, now seen corresponding path program 345 times [2020-02-10 19:46:13,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:13,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126906872] [2020-02-10 19:46:13,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:13,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 19:46:13,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126906872] [2020-02-10 19:46:13,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:13,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:13,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020981903] [2020-02-10 19:46:13,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:13,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:13,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:13,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:13,876 INFO L87 Difference]: Start difference. First operand 389 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:46:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:14,018 INFO L93 Difference]: Finished difference Result 608 states and 1812 transitions. [2020-02-10 19:46:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:14,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:14,020 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:46:14,021 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 19:46:14,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 19:46:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 19:46:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 392. [2020-02-10 19:46:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:46:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-02-10 19:46:14,030 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-02-10 19:46:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:14,030 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-02-10 19:46:14,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-02-10 19:46:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:14,031 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:14,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 19:46:14,031 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 19:46:14,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:14,031 INFO L82 PathProgramCache]: Analyzing trace with hash 356581344, now seen corresponding path program 346 times [2020-02-10 19:46:14,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:14,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90190448] [2020-02-10 19:46:14,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:14,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 19:46:14,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90190448] [2020-02-10 19:46:14,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:14,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:14,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431810360] [2020-02-10 19:46:14,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:14,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:14,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:14,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:14,304 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:46:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:14,447 INFO L93 Difference]: Finished difference Result 610 states and 1813 transitions. [2020-02-10 19:46:14,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:14,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:14,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:14,449 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:46:14,449 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:46:14,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 19:46:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:46:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 389. [2020-02-10 19:46:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:46:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1348 transitions. [2020-02-10 19:46:14,460 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1348 transitions. Word has length 22 [2020-02-10 19:46:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:14,460 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1348 transitions. [2020-02-10 19:46:14,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1348 transitions. [2020-02-10 19:46:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:14,461 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:14,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 19:46:14,461 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 19:46:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:14,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1907374278, now seen corresponding path program 347 times [2020-02-10 19:46:14,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:14,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799285302] [2020-02-10 19:46:14,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:14,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 19:46:14,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799285302] [2020-02-10 19:46:14,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:14,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:14,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599544679] [2020-02-10 19:46:14,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:14,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:14,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:14,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:14,732 INFO L87 Difference]: Start difference. First operand 389 states and 1348 transitions. Second operand 9 states. [2020-02-10 19:46:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:14,851 INFO L93 Difference]: Finished difference Result 602 states and 1797 transitions. [2020-02-10 19:46:14,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:14,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:14,853 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:46:14,853 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:46:14,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 19:46:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:46:14,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 390. [2020-02-10 19:46:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:46:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-02-10 19:46:14,864 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-02-10 19:46:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:14,864 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-02-10 19:46:14,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-02-10 19:46:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:14,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:14,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 19:46:14,865 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 19:46:14,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:14,865 INFO L82 PathProgramCache]: Analyzing trace with hash 238796482, now seen corresponding path program 348 times [2020-02-10 19:46:14,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:14,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344543762] [2020-02-10 19:46:14,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46: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 19:46:15,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344543762] [2020-02-10 19:46:15,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:15,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:15,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934248024] [2020-02-10 19:46:15,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:15,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:15,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:15,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:15,134 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:46:15,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:15,275 INFO L93 Difference]: Finished difference Result 606 states and 1804 transitions. [2020-02-10 19:46:15,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:15,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:15,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:15,277 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:46:15,278 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:46:15,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 19:46:15,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:46:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 388. [2020-02-10 19:46:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:46:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1346 transitions. [2020-02-10 19:46:15,288 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1346 transitions. Word has length 22 [2020-02-10 19:46:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:15,288 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1346 transitions. [2020-02-10 19:46:15,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1346 transitions. [2020-02-10 19:46:15,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:15,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:15,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 19:46:15,289 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 19:46:15,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:15,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1373186418, now seen corresponding path program 349 times [2020-02-10 19:46:15,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:15,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844343119] [2020-02-10 19:46:15,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:15,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 19:46:15,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844343119] [2020-02-10 19:46:15,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:15,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:15,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101390572] [2020-02-10 19:46:15,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:15,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:15,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:15,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:15,553 INFO L87 Difference]: Start difference. First operand 388 states and 1346 transitions. Second operand 9 states. [2020-02-10 19:46:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:15,678 INFO L93 Difference]: Finished difference Result 622 states and 1850 transitions. [2020-02-10 19:46:15,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:15,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:15,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:15,680 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:46:15,680 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 19:46:15,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 19:46:15,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 19:46:15,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 394. [2020-02-10 19:46:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1362 transitions. [2020-02-10 19:46:15,689 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1362 transitions. Word has length 22 [2020-02-10 19:46:15,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:15,689 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1362 transitions. [2020-02-10 19:46:15,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1362 transitions. [2020-02-10 19:46:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:15,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:15,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 19:46:15,690 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 19:46:15,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:15,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1535745748, now seen corresponding path program 350 times [2020-02-10 19:46:15,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:15,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783405069] [2020-02-10 19:46:15,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:15,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 19:46:15,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783405069] [2020-02-10 19:46:15,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:15,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:15,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348411239] [2020-02-10 19:46:15,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:15,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:15,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:15,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:15,951 INFO L87 Difference]: Start difference. First operand 394 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:46:16,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:16,092 INFO L93 Difference]: Finished difference Result 625 states and 1853 transitions. [2020-02-10 19:46:16,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:16,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:16,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:16,094 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:46:16,094 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 19:46:16,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 19:46:16,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 19:46:16,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 391. [2020-02-10 19:46:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:46:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1354 transitions. [2020-02-10 19:46:16,104 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1354 transitions. Word has length 22 [2020-02-10 19:46:16,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:16,104 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1354 transitions. [2020-02-10 19:46:16,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1354 transitions. [2020-02-10 19:46:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:16,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:16,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 19:46:16,105 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 19:46:16,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1827689290, now seen corresponding path program 351 times [2020-02-10 19:46:16,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:16,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254679945] [2020-02-10 19:46:16,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:16,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254679945] [2020-02-10 19:46:16,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:16,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:16,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906286318] [2020-02-10 19:46:16,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:16,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:16,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:16,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:16,385 INFO L87 Difference]: Start difference. First operand 391 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:46:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:16,541 INFO L93 Difference]: Finished difference Result 621 states and 1845 transitions. [2020-02-10 19:46:16,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:16,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:16,543 INFO L225 Difference]: With dead ends: 621 [2020-02-10 19:46:16,543 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:46:16,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 19:46:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:46:16,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 394. [2020-02-10 19:46:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1359 transitions. [2020-02-10 19:46:16,553 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1359 transitions. Word has length 22 [2020-02-10 19:46:16,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:16,553 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1359 transitions. [2020-02-10 19:46:16,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1359 transitions. [2020-02-10 19:46:16,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:16,554 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:16,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 19:46:16,554 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 19:46:16,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:16,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1685278764, now seen corresponding path program 352 times [2020-02-10 19:46:16,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:16,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674463542] [2020-02-10 19:46:16,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:16,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 19:46:16,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674463542] [2020-02-10 19:46:16,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:16,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:16,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011742166] [2020-02-10 19:46:16,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:16,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:16,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:16,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:16,816 INFO L87 Difference]: Start difference. First operand 394 states and 1359 transitions. Second operand 9 states. [2020-02-10 19:46:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:16,936 INFO L93 Difference]: Finished difference Result 623 states and 1846 transitions. [2020-02-10 19:46:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:16,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:16,939 INFO L225 Difference]: With dead ends: 623 [2020-02-10 19:46:16,939 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 19:46:16,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 19:46:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 19:46:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 391. [2020-02-10 19:46:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:46:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1351 transitions. [2020-02-10 19:46:16,949 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1351 transitions. Word has length 22 [2020-02-10 19:46:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:16,949 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1351 transitions. [2020-02-10 19:46:16,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1351 transitions. [2020-02-10 19:46:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:16,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:16,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 19:46:16,950 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 19:46:16,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:16,950 INFO L82 PathProgramCache]: Analyzing trace with hash -7918474, now seen corresponding path program 353 times [2020-02-10 19:46:16,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:16,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441461367] [2020-02-10 19:46:16,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:17,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 19:46:17,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441461367] [2020-02-10 19:46:17,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:17,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:17,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731597283] [2020-02-10 19:46:17,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:17,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:17,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:17,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:17,223 INFO L87 Difference]: Start difference. First operand 391 states and 1351 transitions. Second operand 9 states. [2020-02-10 19:46:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:17,368 INFO L93 Difference]: Finished difference Result 629 states and 1860 transitions. [2020-02-10 19:46:17,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:17,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:17,370 INFO L225 Difference]: With dead ends: 629 [2020-02-10 19:46:17,370 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 19:46:17,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 19:46:17,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 396. [2020-02-10 19:46:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:46:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1360 transitions. [2020-02-10 19:46:17,380 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1360 transitions. Word has length 22 [2020-02-10 19:46:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:17,381 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1360 transitions. [2020-02-10 19:46:17,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:17,381 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1360 transitions. [2020-02-10 19:46:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:17,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:17,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:17,381 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 19:46:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:17,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1702694834, now seen corresponding path program 354 times [2020-02-10 19:46:17,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:17,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050178183] [2020-02-10 19:46:17,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:17,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 19:46:17,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050178183] [2020-02-10 19:46:17,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:17,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:17,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311838909] [2020-02-10 19:46:17,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:17,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:17,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:17,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:17,651 INFO L87 Difference]: Start difference. First operand 396 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:46:17,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:17,775 INFO L93 Difference]: Finished difference Result 628 states and 1853 transitions. [2020-02-10 19:46:17,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:17,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:17,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:17,777 INFO L225 Difference]: With dead ends: 628 [2020-02-10 19:46:17,777 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 19:46:17,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 19:46:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 19:46:17,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 388. [2020-02-10 19:46:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:46:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1345 transitions. [2020-02-10 19:46:17,787 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1345 transitions. Word has length 22 [2020-02-10 19:46:17,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:17,787 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1345 transitions. [2020-02-10 19:46:17,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1345 transitions. [2020-02-10 19:46:17,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:17,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:17,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 19:46:17,788 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 19:46:17,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:17,788 INFO L82 PathProgramCache]: Analyzing trace with hash 253265632, now seen corresponding path program 355 times [2020-02-10 19:46:17,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:17,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286866148] [2020-02-10 19:46:17,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:18,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 19:46:18,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286866148] [2020-02-10 19:46:18,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:18,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:18,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006107199] [2020-02-10 19:46:18,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:18,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:18,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:18,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:18,065 INFO L87 Difference]: Start difference. First operand 388 states and 1345 transitions. Second operand 9 states. [2020-02-10 19:46:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:18,178 INFO L93 Difference]: Finished difference Result 608 states and 1811 transitions. [2020-02-10 19:46:18,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:18,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:18,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:18,181 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:46:18,181 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:46:18,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 19:46:18,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:46:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 390. [2020-02-10 19:46:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:46:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-02-10 19:46:18,191 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-02-10 19:46:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:18,191 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-02-10 19:46:18,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-02-10 19:46:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:18,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:18,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 19:46:18,192 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 19:46:18,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:18,192 INFO L82 PathProgramCache]: Analyzing trace with hash -822445524, now seen corresponding path program 356 times [2020-02-10 19:46:18,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:18,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971682832] [2020-02-10 19:46:18,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:18,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 19:46:18,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971682832] [2020-02-10 19:46:18,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:18,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:18,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984030373] [2020-02-10 19:46:18,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:18,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:18,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:18,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:18,457 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:46:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:18,571 INFO L93 Difference]: Finished difference Result 613 states and 1820 transitions. [2020-02-10 19:46:18,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:18,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:18,573 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:46:18,573 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:46:18,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 19:46:18,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:46:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 389. [2020-02-10 19:46:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:46:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1347 transitions. [2020-02-10 19:46:18,584 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1347 transitions. Word has length 22 [2020-02-10 19:46:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:18,584 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1347 transitions. [2020-02-10 19:46:18,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1347 transitions. [2020-02-10 19:46:18,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:18,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:18,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 19:46:18,585 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 19:46:18,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:18,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1347357220, now seen corresponding path program 357 times [2020-02-10 19:46:18,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:18,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982168261] [2020-02-10 19:46:18,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:18,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 19:46:18,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982168261] [2020-02-10 19:46:18,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:18,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:18,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165816419] [2020-02-10 19:46:18,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:18,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:18,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:18,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:18,852 INFO L87 Difference]: Start difference. First operand 389 states and 1347 transitions. Second operand 9 states. [2020-02-10 19:46:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:18,980 INFO L93 Difference]: Finished difference Result 607 states and 1808 transitions. [2020-02-10 19:46:18,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:18,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:18,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:18,982 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:46:18,982 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:46:18,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 19:46:18,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:46:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 390. [2020-02-10 19:46:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:46:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1348 transitions. [2020-02-10 19:46:18,992 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1348 transitions. Word has length 22 [2020-02-10 19:46:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:18,992 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1348 transitions. [2020-02-10 19:46:18,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1348 transitions. [2020-02-10 19:46:18,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:18,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:18,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 19:46:18,993 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 19:46:18,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:18,993 INFO L82 PathProgramCache]: Analyzing trace with hash -801439316, now seen corresponding path program 358 times [2020-02-10 19:46:18,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:18,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242088174] [2020-02-10 19:46:18,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:19,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 19:46:19,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242088174] [2020-02-10 19:46:19,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:19,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:19,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440272963] [2020-02-10 19:46:19,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:19,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:19,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:19,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:19,258 INFO L87 Difference]: Start difference. First operand 390 states and 1348 transitions. Second operand 9 states. [2020-02-10 19:46:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:19,375 INFO L93 Difference]: Finished difference Result 611 states and 1815 transitions. [2020-02-10 19:46:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:19,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:19,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:19,377 INFO L225 Difference]: With dead ends: 611 [2020-02-10 19:46:19,377 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 19:46:19,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 19:46:19,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 19:46:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 389. [2020-02-10 19:46:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:46:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1346 transitions. [2020-02-10 19:46:19,387 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1346 transitions. Word has length 22 [2020-02-10 19:46:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:19,387 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1346 transitions. [2020-02-10 19:46:19,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1346 transitions. [2020-02-10 19:46:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:19,388 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:19,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 19:46:19,388 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 19:46:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:19,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1284338596, now seen corresponding path program 359 times [2020-02-10 19:46:19,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:19,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728062452] [2020-02-10 19:46:19,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:19,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 19:46:19,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728062452] [2020-02-10 19:46:19,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:19,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:19,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770631715] [2020-02-10 19:46:19,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:19,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:19,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:19,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:19,661 INFO L87 Difference]: Start difference. First operand 389 states and 1346 transitions. Second operand 9 states. [2020-02-10 19:46:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:19,765 INFO L93 Difference]: Finished difference Result 621 states and 1839 transitions. [2020-02-10 19:46:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:19,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:19,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:19,767 INFO L225 Difference]: With dead ends: 621 [2020-02-10 19:46:19,767 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 19:46:19,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 19:46:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 19:46:19,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 394. [2020-02-10 19:46:19,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1355 transitions. [2020-02-10 19:46:19,778 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1355 transitions. Word has length 22 [2020-02-10 19:46:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:19,778 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1355 transitions. [2020-02-10 19:46:19,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:19,778 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1355 transitions. [2020-02-10 19:46:19,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:19,778 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:19,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 19:46:19,779 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 19:46:19,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:19,779 INFO L82 PathProgramCache]: Analyzing trace with hash 211253216, now seen corresponding path program 360 times [2020-02-10 19:46:19,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:19,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712655434] [2020-02-10 19:46:19,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:20,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 19:46:20,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712655434] [2020-02-10 19:46:20,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:20,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:20,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771683105] [2020-02-10 19:46:20,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:20,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:20,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:20,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:20,049 INFO L87 Difference]: Start difference. First operand 394 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:46:20,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:20,156 INFO L93 Difference]: Finished difference Result 620 states and 1832 transitions. [2020-02-10 19:46:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:20,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:20,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:20,158 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:46:20,158 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:46:20,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 19:46:20,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:46:20,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 383. [2020-02-10 19:46:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:46:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1336 transitions. [2020-02-10 19:46:20,168 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1336 transitions. Word has length 22 [2020-02-10 19:46:20,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:20,169 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1336 transitions. [2020-02-10 19:46:20,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1336 transitions. [2020-02-10 19:46:20,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:20,169 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:20,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 19:46:20,169 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 19:46:20,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:20,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1339285254, now seen corresponding path program 361 times [2020-02-10 19:46:20,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:20,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520205363] [2020-02-10 19:46:20,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:20,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 19:46:20,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520205363] [2020-02-10 19:46:20,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:20,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:20,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789558975] [2020-02-10 19:46:20,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:20,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:20,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:20,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:20,468 INFO L87 Difference]: Start difference. First operand 383 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:46:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:20,546 INFO L93 Difference]: Finished difference Result 666 states and 1990 transitions. [2020-02-10 19:46:20,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:20,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:20,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:20,549 INFO L225 Difference]: With dead ends: 666 [2020-02-10 19:46:20,549 INFO L226 Difference]: Without dead ends: 650 [2020-02-10 19:46:20,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 19:46:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-02-10 19:46:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 399. [2020-02-10 19:46:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:46:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1391 transitions. [2020-02-10 19:46:20,559 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1391 transitions. Word has length 22 [2020-02-10 19:46:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:20,559 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1391 transitions. [2020-02-10 19:46:20,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1391 transitions. [2020-02-10 19:46:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:20,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:20,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 19:46:20,559 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 19:46:20,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:20,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1365416156, now seen corresponding path program 362 times [2020-02-10 19:46:20,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:20,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195738248] [2020-02-10 19:46:20,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:20,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195738248] [2020-02-10 19:46:20,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:20,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:20,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614079117] [2020-02-10 19:46:20,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:20,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:20,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:20,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:20,843 INFO L87 Difference]: Start difference. First operand 399 states and 1391 transitions. Second operand 9 states. [2020-02-10 19:46:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:20,946 INFO L93 Difference]: Finished difference Result 661 states and 1977 transitions. [2020-02-10 19:46:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:20,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:20,949 INFO L225 Difference]: With dead ends: 661 [2020-02-10 19:46:20,949 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 19:46:20,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 19:46:20,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 19:46:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 395. [2020-02-10 19:46:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:46:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1382 transitions. [2020-02-10 19:46:20,959 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1382 transitions. Word has length 22 [2020-02-10 19:46:20,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:20,959 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1382 transitions. [2020-02-10 19:46:20,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1382 transitions. [2020-02-10 19:46:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:20,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:20,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 19:46:20,960 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 19:46:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1440197426, now seen corresponding path program 363 times [2020-02-10 19:46:20,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:20,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161794339] [2020-02-10 19:46:20,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:21,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 19:46:21,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161794339] [2020-02-10 19:46:21,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:21,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:21,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328476422] [2020-02-10 19:46:21,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:21,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:21,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:21,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:21,275 INFO L87 Difference]: Start difference. First operand 395 states and 1382 transitions. Second operand 9 states. [2020-02-10 19:46:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:21,352 INFO L93 Difference]: Finished difference Result 664 states and 1982 transitions. [2020-02-10 19:46:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:21,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:21,354 INFO L225 Difference]: With dead ends: 664 [2020-02-10 19:46:21,354 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 19:46:21,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 19:46:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 19:46:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 398. [2020-02-10 19:46:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:46:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1386 transitions. [2020-02-10 19:46:21,368 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1386 transitions. Word has length 22 [2020-02-10 19:46:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:21,368 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1386 transitions. [2020-02-10 19:46:21,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1386 transitions. [2020-02-10 19:46:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:21,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:21,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 19:46:21,369 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 19:46:21,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:21,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1566833800, now seen corresponding path program 364 times [2020-02-10 19:46:21,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:21,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513390548] [2020-02-10 19:46:21,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:21,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 19:46:21,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513390548] [2020-02-10 19:46:21,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:21,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:21,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794744957] [2020-02-10 19:46:21,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:21,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:21,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:21,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:21,662 INFO L87 Difference]: Start difference. First operand 398 states and 1386 transitions. Second operand 9 states. [2020-02-10 19:46:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:21,771 INFO L93 Difference]: Finished difference Result 658 states and 1968 transitions. [2020-02-10 19:46:21,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:21,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:21,773 INFO L225 Difference]: With dead ends: 658 [2020-02-10 19:46:21,773 INFO L226 Difference]: Without dead ends: 645 [2020-02-10 19:46:21,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 19:46:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-02-10 19:46:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 395. [2020-02-10 19:46:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:46:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1379 transitions. [2020-02-10 19:46:21,784 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1379 transitions. Word has length 22 [2020-02-10 19:46:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:21,784 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1379 transitions. [2020-02-10 19:46:21,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1379 transitions. [2020-02-10 19:46:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:21,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:21,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 19:46:21,785 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 19:46:21,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:21,785 INFO L82 PathProgramCache]: Analyzing trace with hash -848184368, now seen corresponding path program 365 times [2020-02-10 19:46:21,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:21,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200327689] [2020-02-10 19:46:21,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:22,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 19:46:22,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200327689] [2020-02-10 19:46:22,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:22,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:22,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593002505] [2020-02-10 19:46:22,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:22,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:22,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:22,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:22,074 INFO L87 Difference]: Start difference. First operand 395 states and 1379 transitions. Second operand 9 states. [2020-02-10 19:46:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:22,183 INFO L93 Difference]: Finished difference Result 653 states and 1959 transitions. [2020-02-10 19:46:22,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:22,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:22,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:22,184 INFO L225 Difference]: With dead ends: 653 [2020-02-10 19:46:22,184 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 19:46:22,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 19:46:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 19:46:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 397. [2020-02-10 19:46:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:46:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1382 transitions. [2020-02-10 19:46:22,195 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1382 transitions. Word has length 22 [2020-02-10 19:46:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:22,195 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1382 transitions. [2020-02-10 19:46:22,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1382 transitions. [2020-02-10 19:46:22,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:22,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:22,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 19:46:22,196 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 19:46:22,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:22,196 INFO L82 PathProgramCache]: Analyzing trace with hash 493748420, now seen corresponding path program 366 times [2020-02-10 19:46:22,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:22,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821434344] [2020-02-10 19:46:22,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:22,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 19:46:22,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821434344] [2020-02-10 19:46:22,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:22,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:22,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316638782] [2020-02-10 19:46:22,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:22,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:22,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:22,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:22,476 INFO L87 Difference]: Start difference. First operand 397 states and 1382 transitions. Second operand 9 states. [2020-02-10 19:46:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:22,580 INFO L93 Difference]: Finished difference Result 652 states and 1955 transitions. [2020-02-10 19:46:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:22,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:22,582 INFO L225 Difference]: With dead ends: 652 [2020-02-10 19:46:22,582 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 19:46:22,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 19:46:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 19:46:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 392. [2020-02-10 19:46:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:46:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1372 transitions. [2020-02-10 19:46:22,592 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1372 transitions. Word has length 22 [2020-02-10 19:46:22,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:22,592 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1372 transitions. [2020-02-10 19:46:22,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1372 transitions. [2020-02-10 19:46:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:22,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46: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 19:46:22,593 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 19:46:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:22,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1718040, now seen corresponding path program 367 times [2020-02-10 19:46:22,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:22,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816572349] [2020-02-10 19:46:22,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:22,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 19:46:22,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816572349] [2020-02-10 19:46:22,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:22,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:22,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903239715] [2020-02-10 19:46:22,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:22,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:22,882 INFO L87 Difference]: Start difference. First operand 392 states and 1372 transitions. Second operand 9 states. [2020-02-10 19:46:22,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:22,961 INFO L93 Difference]: Finished difference Result 678 states and 2017 transitions. [2020-02-10 19:46:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:22,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:22,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:22,963 INFO L225 Difference]: With dead ends: 678 [2020-02-10 19:46:22,964 INFO L226 Difference]: Without dead ends: 662 [2020-02-10 19:46:22,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:22,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-02-10 19:46:22,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 401. [2020-02-10 19:46:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 19:46:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1394 transitions. [2020-02-10 19:46:22,975 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1394 transitions. Word has length 22 [2020-02-10 19:46:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:22,975 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1394 transitions. [2020-02-10 19:46:22,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1394 transitions. [2020-02-10 19:46:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:22,975 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:22,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 19:46:22,976 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 19:46:22,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:22,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1591983926, now seen corresponding path program 368 times [2020-02-10 19:46:22,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:22,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291893361] [2020-02-10 19:46:22,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:23,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 19:46:23,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291893361] [2020-02-10 19:46:23,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:23,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:23,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509036842] [2020-02-10 19:46:23,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:23,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:23,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:23,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:23,265 INFO L87 Difference]: Start difference. First operand 401 states and 1394 transitions. Second operand 9 states. [2020-02-10 19:46:23,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:23,376 INFO L93 Difference]: Finished difference Result 673 states and 2004 transitions. [2020-02-10 19:46:23,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:23,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:23,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:23,378 INFO L225 Difference]: With dead ends: 673 [2020-02-10 19:46:23,378 INFO L226 Difference]: Without dead ends: 658 [2020-02-10 19:46:23,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 19:46:23,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-02-10 19:46:23,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 397. [2020-02-10 19:46:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:46:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1384 transitions. [2020-02-10 19:46:23,388 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1384 transitions. Word has length 22 [2020-02-10 19:46:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:23,388 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1384 transitions. [2020-02-10 19:46:23,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1384 transitions. [2020-02-10 19:46:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:23,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:23,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 19:46:23,389 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 19:46:23,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash 266768904, now seen corresponding path program 369 times [2020-02-10 19:46:23,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:23,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111380502] [2020-02-10 19:46:23,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:23,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 19:46:23,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111380502] [2020-02-10 19:46:23,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:23,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:23,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192749329] [2020-02-10 19:46:23,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:23,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:23,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:23,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:23,693 INFO L87 Difference]: Start difference. First operand 397 states and 1384 transitions. Second operand 9 states. [2020-02-10 19:46:23,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:23,768 INFO L93 Difference]: Finished difference Result 685 states and 2029 transitions. [2020-02-10 19:46:23,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:23,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:23,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:23,770 INFO L225 Difference]: With dead ends: 685 [2020-02-10 19:46:23,770 INFO L226 Difference]: Without dead ends: 669 [2020-02-10 19:46:23,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 19:46:23,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2020-02-10 19:46:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 405. [2020-02-10 19:46:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-02-10 19:46:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1397 transitions. [2020-02-10 19:46:23,780 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1397 transitions. Word has length 22 [2020-02-10 19:46:23,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:23,781 INFO L479 AbstractCegarLoop]: Abstraction has 405 states and 1397 transitions. [2020-02-10 19:46:23,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1397 transitions. [2020-02-10 19:46:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:23,781 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:23,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 19:46:23,781 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 19:46:23,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:23,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1230802646, now seen corresponding path program 370 times [2020-02-10 19:46:23,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:23,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140665669] [2020-02-10 19:46:23,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:24,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 19:46:24,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140665669] [2020-02-10 19:46:24,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:24,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:24,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462174448] [2020-02-10 19:46:24,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:24,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:24,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:24,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:24,087 INFO L87 Difference]: Start difference. First operand 405 states and 1397 transitions. Second operand 9 states. [2020-02-10 19:46:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:24,193 INFO L93 Difference]: Finished difference Result 683 states and 2019 transitions. [2020-02-10 19:46:24,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:24,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:24,195 INFO L225 Difference]: With dead ends: 683 [2020-02-10 19:46:24,195 INFO L226 Difference]: Without dead ends: 661 [2020-02-10 19:46:24,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:24,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-02-10 19:46:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 397. [2020-02-10 19:46:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:46:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1379 transitions. [2020-02-10 19:46:24,206 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1379 transitions. Word has length 22 [2020-02-10 19:46:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:24,206 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1379 transitions. [2020-02-10 19:46:24,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1379 transitions. [2020-02-10 19:46:24,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:24,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46: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 19:46:24,207 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 19:46:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:24,207 INFO L82 PathProgramCache]: Analyzing trace with hash -948527510, now seen corresponding path program 371 times [2020-02-10 19:46:24,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:24,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413215123] [2020-02-10 19:46:24,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:24,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 19:46:24,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413215123] [2020-02-10 19:46:24,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:24,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:24,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679198263] [2020-02-10 19:46:24,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:24,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:24,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:24,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:24,492 INFO L87 Difference]: Start difference. First operand 397 states and 1379 transitions. Second operand 9 states. [2020-02-10 19:46:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:24,597 INFO L93 Difference]: Finished difference Result 670 states and 1994 transitions. [2020-02-10 19:46:24,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:24,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:24,599 INFO L225 Difference]: With dead ends: 670 [2020-02-10 19:46:24,600 INFO L226 Difference]: Without dead ends: 659 [2020-02-10 19:46:24,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 19:46:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-02-10 19:46:24,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 400. [2020-02-10 19:46:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 19:46:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1384 transitions. [2020-02-10 19:46:24,609 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1384 transitions. Word has length 22 [2020-02-10 19:46:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:24,609 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1384 transitions. [2020-02-10 19:46:24,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1384 transitions. [2020-02-10 19:46:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:24,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:24,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 19:46:24,610 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 19:46:24,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:24,610 INFO L82 PathProgramCache]: Analyzing trace with hash -930093484, now seen corresponding path program 372 times [2020-02-10 19:46:24,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:24,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463876057] [2020-02-10 19:46:24,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:24,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463876057] [2020-02-10 19:46:24,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:24,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:24,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817003997] [2020-02-10 19:46:24,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:24,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:24,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:24,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:24,895 INFO L87 Difference]: Start difference. First operand 400 states and 1384 transitions. Second operand 9 states. [2020-02-10 19:46:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:25,007 INFO L93 Difference]: Finished difference Result 673 states and 1997 transitions. [2020-02-10 19:46:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:25,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:25,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:25,009 INFO L225 Difference]: With dead ends: 673 [2020-02-10 19:46:25,010 INFO L226 Difference]: Without dead ends: 651 [2020-02-10 19:46:25,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 19:46:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2020-02-10 19:46:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 392. [2020-02-10 19:46:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:46:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1368 transitions. [2020-02-10 19:46:25,020 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1368 transitions. Word has length 22 [2020-02-10 19:46:25,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:25,020 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1368 transitions. [2020-02-10 19:46:25,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:25,020 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1368 transitions. [2020-02-10 19:46:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:25,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:25,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:25,021 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 19:46:25,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:25,021 INFO L82 PathProgramCache]: Analyzing trace with hash 938605096, now seen corresponding path program 373 times [2020-02-10 19:46:25,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:25,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358818098] [2020-02-10 19:46:25,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:25,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 19:46:25,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358818098] [2020-02-10 19:46:25,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:25,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:25,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647502788] [2020-02-10 19:46:25,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:25,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:25,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:25,315 INFO L87 Difference]: Start difference. First operand 392 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:46:25,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:25,385 INFO L93 Difference]: Finished difference Result 672 states and 1996 transitions. [2020-02-10 19:46:25,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:25,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:25,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:25,387 INFO L225 Difference]: With dead ends: 672 [2020-02-10 19:46:25,387 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 19:46:25,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 19:46:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 19:46:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 399. [2020-02-10 19:46:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:46:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1384 transitions. [2020-02-10 19:46:25,398 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1384 transitions. Word has length 22 [2020-02-10 19:46:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:25,399 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1384 transitions. [2020-02-10 19:46:25,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1384 transitions. [2020-02-10 19:46:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:25,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:25,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 19:46:25,399 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 19:46:25,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:25,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1065241470, now seen corresponding path program 374 times [2020-02-10 19:46:25,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:25,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007153558] [2020-02-10 19:46:25,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:25,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 19:46:25,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007153558] [2020-02-10 19:46:25,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:25,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:25,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31868060] [2020-02-10 19:46:25,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:25,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:25,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:25,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:25,695 INFO L87 Difference]: Start difference. First operand 399 states and 1384 transitions. Second operand 9 states. [2020-02-10 19:46:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:25,798 INFO L93 Difference]: Finished difference Result 666 states and 1982 transitions. [2020-02-10 19:46:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:25,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:25,800 INFO L225 Difference]: With dead ends: 666 [2020-02-10 19:46:25,800 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 19:46:25,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 19:46:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 19:46:25,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 396. [2020-02-10 19:46:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:46:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1377 transitions. [2020-02-10 19:46:25,811 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1377 transitions. Word has length 22 [2020-02-10 19:46:25,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:25,811 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1377 transitions. [2020-02-10 19:46:25,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1377 transitions. [2020-02-10 19:46:25,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:25,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:25,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 19:46:25,812 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 19:46:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:25,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1748047018, now seen corresponding path program 375 times [2020-02-10 19:46:25,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:25,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616198654] [2020-02-10 19:46:25,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:26,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 19:46:26,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616198654] [2020-02-10 19:46:26,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:26,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:26,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457107071] [2020-02-10 19:46:26,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:26,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:26,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:26,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:26,103 INFO L87 Difference]: Start difference. First operand 396 states and 1377 transitions. Second operand 9 states. [2020-02-10 19:46:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:26,180 INFO L93 Difference]: Finished difference Result 681 states and 2014 transitions. [2020-02-10 19:46:26,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:26,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:26,182 INFO L225 Difference]: With dead ends: 681 [2020-02-10 19:46:26,182 INFO L226 Difference]: Without dead ends: 665 [2020-02-10 19:46:26,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 19:46:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-02-10 19:46:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 404. [2020-02-10 19:46:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-02-10 19:46:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1390 transitions. [2020-02-10 19:46:26,192 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1390 transitions. Word has length 22 [2020-02-10 19:46:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:26,192 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 1390 transitions. [2020-02-10 19:46:26,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1390 transitions. [2020-02-10 19:46:26,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:26,192 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:26,193 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:26,193 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 19:46:26,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:26,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1897474686, now seen corresponding path program 376 times [2020-02-10 19:46:26,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:26,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933035472] [2020-02-10 19:46:26,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:26,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 19:46:26,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933035472] [2020-02-10 19:46:26,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:26,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:26,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063605970] [2020-02-10 19:46:26,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:26,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:26,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:26,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:26,482 INFO L87 Difference]: Start difference. First operand 404 states and 1390 transitions. Second operand 9 states. [2020-02-10 19:46:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:26,597 INFO L93 Difference]: Finished difference Result 679 states and 2004 transitions. [2020-02-10 19:46:26,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:26,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:26,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:26,599 INFO L225 Difference]: With dead ends: 679 [2020-02-10 19:46:26,599 INFO L226 Difference]: Without dead ends: 657 [2020-02-10 19:46:26,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 19:46:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-02-10 19:46:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 396. [2020-02-10 19:46:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:46:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1373 transitions. [2020-02-10 19:46:26,609 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1373 transitions. Word has length 22 [2020-02-10 19:46:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:26,609 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1373 transitions. [2020-02-10 19:46:26,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1373 transitions. [2020-02-10 19:46:26,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:26,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:26,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 19:46:26,610 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 19:46:26,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:26,610 INFO L82 PathProgramCache]: Analyzing trace with hash 527385892, now seen corresponding path program 377 times [2020-02-10 19:46:26,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:26,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107814540] [2020-02-10 19:46:26,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:26,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 19:46:26,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107814540] [2020-02-10 19:46:26,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:26,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:26,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541794761] [2020-02-10 19:46:26,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:26,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:26,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:26,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:26,896 INFO L87 Difference]: Start difference. First operand 396 states and 1373 transitions. Second operand 9 states. [2020-02-10 19:46:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:27,001 INFO L93 Difference]: Finished difference Result 663 states and 1973 transitions. [2020-02-10 19:46:27,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:27,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:27,003 INFO L225 Difference]: With dead ends: 663 [2020-02-10 19:46:27,003 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 19:46:27,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 19:46:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 19:46:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 398. [2020-02-10 19:46:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:46:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1376 transitions. [2020-02-10 19:46:27,014 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1376 transitions. Word has length 22 [2020-02-10 19:46:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:27,015 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1376 transitions. [2020-02-10 19:46:27,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1376 transitions. [2020-02-10 19:46:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:27,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:27,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 19:46:27,017 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 19:46:27,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:27,017 INFO L82 PathProgramCache]: Analyzing trace with hash -390564298, now seen corresponding path program 378 times [2020-02-10 19:46:27,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:27,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060490480] [2020-02-10 19:46:27,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:27,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 19:46:27,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060490480] [2020-02-10 19:46:27,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:27,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:27,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953980984] [2020-02-10 19:46:27,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:27,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:27,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:27,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:27,300 INFO L87 Difference]: Start difference. First operand 398 states and 1376 transitions. Second operand 9 states. [2020-02-10 19:46:27,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:27,411 INFO L93 Difference]: Finished difference Result 667 states and 1979 transitions. [2020-02-10 19:46:27,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:27,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:27,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:27,413 INFO L225 Difference]: With dead ends: 667 [2020-02-10 19:46:27,413 INFO L226 Difference]: Without dead ends: 647 [2020-02-10 19:46:27,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 19:46:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-02-10 19:46:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 392. [2020-02-10 19:46:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:46:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-02-10 19:46:27,426 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-02-10 19:46:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:27,426 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-02-10 19:46:27,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-02-10 19:46:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:27,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:27,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 19:46:27,427 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 19:46:27,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:27,427 INFO L82 PathProgramCache]: Analyzing trace with hash -255685110, now seen corresponding path program 379 times [2020-02-10 19:46:27,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:27,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817501942] [2020-02-10 19:46:27,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:27,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 19:46:27,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817501942] [2020-02-10 19:46:27,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:27,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:27,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221972117] [2020-02-10 19:46:27,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:27,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:27,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:27,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:27,713 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:46:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:27,821 INFO L93 Difference]: Finished difference Result 648 states and 1944 transitions. [2020-02-10 19:46:27,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:27,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:27,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:27,823 INFO L225 Difference]: With dead ends: 648 [2020-02-10 19:46:27,823 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 19:46:27,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 19:46:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 19:46:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 396. [2020-02-10 19:46:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:46:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1374 transitions. [2020-02-10 19:46:27,835 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1374 transitions. Word has length 22 [2020-02-10 19:46:27,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:27,835 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1374 transitions. [2020-02-10 19:46:27,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1374 transitions. [2020-02-10 19:46:27,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:27,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:27,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 19:46:27,836 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 19:46:27,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:27,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1086247678, now seen corresponding path program 380 times [2020-02-10 19:46:27,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:27,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159223600] [2020-02-10 19:46:27,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:28,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 19:46:28,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159223600] [2020-02-10 19:46:28,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:28,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:28,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819749791] [2020-02-10 19:46:28,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:28,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:28,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:28,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:28,126 INFO L87 Difference]: Start difference. First operand 396 states and 1374 transitions. Second operand 9 states. [2020-02-10 19:46:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:28,228 INFO L93 Difference]: Finished difference Result 647 states and 1940 transitions. [2020-02-10 19:46:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:28,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:28,231 INFO L225 Difference]: With dead ends: 647 [2020-02-10 19:46:28,231 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 19:46:28,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 19:46:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 19:46:28,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 394. [2020-02-10 19:46:28,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1369 transitions. [2020-02-10 19:46:28,242 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1369 transitions. Word has length 22 [2020-02-10 19:46:28,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:28,242 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1369 transitions. [2020-02-10 19:46:28,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1369 transitions. [2020-02-10 19:46:28,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:28,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:28,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 19:46:28,242 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 19:46:28,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:28,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1352630072, now seen corresponding path program 381 times [2020-02-10 19:46:28,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:28,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072830748] [2020-02-10 19:46:28,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:28,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 19:46:28,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072830748] [2020-02-10 19:46:28,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:28,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:28,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550703906] [2020-02-10 19:46:28,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:28,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:28,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:28,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:28,527 INFO L87 Difference]: Start difference. First operand 394 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:46:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:28,630 INFO L93 Difference]: Finished difference Result 653 states and 1953 transitions. [2020-02-10 19:46:28,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:28,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:28,632 INFO L225 Difference]: With dead ends: 653 [2020-02-10 19:46:28,632 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 19:46:28,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 19:46:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 19:46:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 397. [2020-02-10 19:46:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:46:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1374 transitions. [2020-02-10 19:46:28,651 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1374 transitions. Word has length 22 [2020-02-10 19:46:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:28,651 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1374 transitions. [2020-02-10 19:46:28,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:28,652 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1374 transitions. [2020-02-10 19:46:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:28,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:28,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 19:46:28,652 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 19:46:28,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:28,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2075777240, now seen corresponding path program 382 times [2020-02-10 19:46:28,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:28,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67363541] [2020-02-10 19:46:28,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:28,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 19:46:28,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67363541] [2020-02-10 19:46:28,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:28,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:28,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573053438] [2020-02-10 19:46:28,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:28,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:28,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:28,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:28,936 INFO L87 Difference]: Start difference. First operand 397 states and 1374 transitions. Second operand 9 states. [2020-02-10 19:46:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:29,050 INFO L93 Difference]: Finished difference Result 656 states and 1956 transitions. [2020-02-10 19:46:29,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:29,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:29,052 INFO L225 Difference]: With dead ends: 656 [2020-02-10 19:46:29,052 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 19:46:29,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:29,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 19:46:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 394. [2020-02-10 19:46:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-02-10 19:46:29,062 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-02-10 19:46:29,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:29,062 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-02-10 19:46:29,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-02-10 19:46:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:29,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:29,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 19:46:29,063 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 19:46:29,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:29,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1621477480, now seen corresponding path program 383 times [2020-02-10 19:46:29,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:29,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131192135] [2020-02-10 19:46:29,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:29,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 19:46:29,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131192135] [2020-02-10 19:46:29,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:29,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:29,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227248755] [2020-02-10 19:46:29,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:29,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:29,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:29,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:29,339 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-02-10 19:46:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:29,454 INFO L93 Difference]: Finished difference Result 650 states and 1944 transitions. [2020-02-10 19:46:29,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:29,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:29,456 INFO L225 Difference]: With dead ends: 650 [2020-02-10 19:46:29,456 INFO L226 Difference]: Without dead ends: 640 [2020-02-10 19:46:29,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 19:46:29,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-02-10 19:46:29,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 396. [2020-02-10 19:46:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:46:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1370 transitions. [2020-02-10 19:46:29,467 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1370 transitions. Word has length 22 [2020-02-10 19:46:29,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:29,467 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1370 transitions. [2020-02-10 19:46:29,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:29,467 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1370 transitions. [2020-02-10 19:46:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:29,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:29,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 19:46:29,468 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 19:46:29,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:29,468 INFO L82 PathProgramCache]: Analyzing trace with hash 703527290, now seen corresponding path program 384 times [2020-02-10 19:46:29,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:29,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042005473] [2020-02-10 19:46:29,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:29,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 19:46:29,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042005473] [2020-02-10 19:46:29,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:29,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:29,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496698864] [2020-02-10 19:46:29,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:29,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:29,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:29,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:29,739 INFO L87 Difference]: Start difference. First operand 396 states and 1370 transitions. Second operand 9 states. [2020-02-10 19:46:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:29,842 INFO L93 Difference]: Finished difference Result 654 states and 1950 transitions. [2020-02-10 19:46:29,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:29,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:29,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:29,844 INFO L225 Difference]: With dead ends: 654 [2020-02-10 19:46:29,844 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 19:46:29,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:29,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 19:46:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 388. [2020-02-10 19:46:29,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:46:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1355 transitions. [2020-02-10 19:46:29,854 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1355 transitions. Word has length 22 [2020-02-10 19:46:29,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:29,855 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1355 transitions. [2020-02-10 19:46:29,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1355 transitions. [2020-02-10 19:46:29,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:29,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:29,855 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:29,855 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 19:46:29,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:29,856 INFO L82 PathProgramCache]: Analyzing trace with hash 914974018, now seen corresponding path program 385 times [2020-02-10 19:46:29,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:29,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077990027] [2020-02-10 19:46:29,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:30,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 19:46:30,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077990027] [2020-02-10 19:46:30,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:30,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:30,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970620453] [2020-02-10 19:46:30,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:30,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:30,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:30,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:30,125 INFO L87 Difference]: Start difference. First operand 388 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:46:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:30,206 INFO L93 Difference]: Finished difference Result 660 states and 1973 transitions. [2020-02-10 19:46:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:30,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:30,208 INFO L225 Difference]: With dead ends: 660 [2020-02-10 19:46:30,208 INFO L226 Difference]: Without dead ends: 644 [2020-02-10 19:46:30,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 19:46:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-02-10 19:46:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 398. [2020-02-10 19:46:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:46:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1384 transitions. [2020-02-10 19:46:30,227 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1384 transitions. Word has length 22 [2020-02-10 19:46:30,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:30,227 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1384 transitions. [2020-02-10 19:46:30,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1384 transitions. [2020-02-10 19:46:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:30,228 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:30,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 19:46:30,228 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 19:46:30,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1789727392, now seen corresponding path program 386 times [2020-02-10 19:46:30,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:30,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325532315] [2020-02-10 19:46:30,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:30,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 19:46:30,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325532315] [2020-02-10 19:46:30,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:30,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:30,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803381708] [2020-02-10 19:46:30,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:30,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:30,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:30,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:30,489 INFO L87 Difference]: Start difference. First operand 398 states and 1384 transitions. Second operand 9 states. [2020-02-10 19:46:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:30,591 INFO L93 Difference]: Finished difference Result 655 states and 1960 transitions. [2020-02-10 19:46:30,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:30,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:30,594 INFO L225 Difference]: With dead ends: 655 [2020-02-10 19:46:30,594 INFO L226 Difference]: Without dead ends: 640 [2020-02-10 19:46:30,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 19:46:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-02-10 19:46:30,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 394. [2020-02-10 19:46:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1375 transitions. [2020-02-10 19:46:30,603 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1375 transitions. Word has length 22 [2020-02-10 19:46:30,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:30,604 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1375 transitions. [2020-02-10 19:46:30,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1375 transitions. [2020-02-10 19:46:30,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:30,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:30,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 19:46:30,604 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 19:46:30,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:30,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1015886190, now seen corresponding path program 387 times [2020-02-10 19:46:30,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:30,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614649532] [2020-02-10 19:46:30,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:30,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 19:46:30,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614649532] [2020-02-10 19:46:30,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:30,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:30,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093763909] [2020-02-10 19:46:30,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:30,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:30,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:30,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:30,873 INFO L87 Difference]: Start difference. First operand 394 states and 1375 transitions. Second operand 9 states. [2020-02-10 19:46:30,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:30,952 INFO L93 Difference]: Finished difference Result 658 states and 1965 transitions. [2020-02-10 19:46:30,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:30,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:30,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:30,954 INFO L225 Difference]: With dead ends: 658 [2020-02-10 19:46:30,954 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 19:46:30,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:30,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 19:46:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 397. [2020-02-10 19:46:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:46:30,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1379 transitions. [2020-02-10 19:46:30,964 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1379 transitions. Word has length 22 [2020-02-10 19:46:30,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:30,964 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1379 transitions. [2020-02-10 19:46:30,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1379 transitions. [2020-02-10 19:46:30,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:30,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:30,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 19:46:30,965 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 19:46:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:30,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1142522564, now seen corresponding path program 388 times [2020-02-10 19:46:30,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:30,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836318609] [2020-02-10 19:46:30,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:31,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 19:46:31,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836318609] [2020-02-10 19:46:31,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:31,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:31,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115868863] [2020-02-10 19:46:31,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:31,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:31,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:31,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:31,232 INFO L87 Difference]: Start difference. First operand 397 states and 1379 transitions. Second operand 9 states. [2020-02-10 19:46:31,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:31,339 INFO L93 Difference]: Finished difference Result 652 states and 1951 transitions. [2020-02-10 19:46:31,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:31,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:31,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:31,341 INFO L225 Difference]: With dead ends: 652 [2020-02-10 19:46:31,341 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 19:46:31,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 19:46:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 394. [2020-02-10 19:46:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1372 transitions. [2020-02-10 19:46:31,352 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1372 transitions. Word has length 22 [2020-02-10 19:46:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:31,352 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1372 transitions. [2020-02-10 19:46:31,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1372 transitions. [2020-02-10 19:46:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:31,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:31,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 19:46:31,353 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 19:46:31,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:31,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1272495604, now seen corresponding path program 389 times [2020-02-10 19:46:31,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:31,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568618930] [2020-02-10 19:46:31,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:31,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 19:46:31,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568618930] [2020-02-10 19:46:31,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:31,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:31,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057884526] [2020-02-10 19:46:31,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:31,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:31,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:31,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:31,625 INFO L87 Difference]: Start difference. First operand 394 states and 1372 transitions. Second operand 9 states. [2020-02-10 19:46:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:31,731 INFO L93 Difference]: Finished difference Result 647 states and 1942 transitions. [2020-02-10 19:46:31,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:31,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:31,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:31,733 INFO L225 Difference]: With dead ends: 647 [2020-02-10 19:46:31,733 INFO L226 Difference]: Without dead ends: 636 [2020-02-10 19:46:31,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 19:46:31,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-02-10 19:46:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 396. [2020-02-10 19:46:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:46:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1375 transitions. [2020-02-10 19:46:31,743 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1375 transitions. Word has length 22 [2020-02-10 19:46:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:31,743 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1375 transitions. [2020-02-10 19:46:31,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1375 transitions. [2020-02-10 19:46:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:31,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46: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 19:46:31,744 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 19:46:31,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:31,744 INFO L82 PathProgramCache]: Analyzing trace with hash 69437184, now seen corresponding path program 390 times [2020-02-10 19:46:31,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:31,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149042645] [2020-02-10 19:46:31,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:32,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 19:46:32,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149042645] [2020-02-10 19:46:32,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:32,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:32,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103918381] [2020-02-10 19:46:32,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:32,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:32,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:32,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:32,026 INFO L87 Difference]: Start difference. First operand 396 states and 1375 transitions. Second operand 9 states. [2020-02-10 19:46:32,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:32,136 INFO L93 Difference]: Finished difference Result 646 states and 1938 transitions. [2020-02-10 19:46:32,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:32,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:32,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:32,138 INFO L225 Difference]: With dead ends: 646 [2020-02-10 19:46:32,139 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 19:46:32,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 19:46:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 391. [2020-02-10 19:46:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:46:32,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1365 transitions. [2020-02-10 19:46:32,149 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1365 transitions. Word has length 22 [2020-02-10 19:46:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:32,149 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1365 transitions. [2020-02-10 19:46:32,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1365 transitions. [2020-02-10 19:46:32,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:32,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:32,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 19:46:32,150 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 19:46:32,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:32,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1267564648, now seen corresponding path program 391 times [2020-02-10 19:46:32,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:32,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745943797] [2020-02-10 19:46:32,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:32,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 19:46:32,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745943797] [2020-02-10 19:46:32,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:32,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:32,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624607451] [2020-02-10 19:46:32,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:32,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:32,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:32,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:32,421 INFO L87 Difference]: Start difference. First operand 391 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:46:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:32,505 INFO L93 Difference]: Finished difference Result 668 states and 1992 transitions. [2020-02-10 19:46:32,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:32,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:32,508 INFO L225 Difference]: With dead ends: 668 [2020-02-10 19:46:32,508 INFO L226 Difference]: Without dead ends: 652 [2020-02-10 19:46:32,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 19:46:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-02-10 19:46:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 399. [2020-02-10 19:46:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:46:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1385 transitions. [2020-02-10 19:46:32,519 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1385 transitions. Word has length 22 [2020-02-10 19:46:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:32,519 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1385 transitions. [2020-02-10 19:46:32,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1385 transitions. [2020-02-10 19:46:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:32,520 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:32,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 19:46:32,520 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 19:46:32,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:32,520 INFO L82 PathProgramCache]: Analyzing trace with hash 322701238, now seen corresponding path program 392 times [2020-02-10 19:46:32,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:32,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814612841] [2020-02-10 19:46:32,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:32,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814612841] [2020-02-10 19:46:32,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:32,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:32,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170064617] [2020-02-10 19:46:32,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:32,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:32,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:32,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:32,787 INFO L87 Difference]: Start difference. First operand 399 states and 1385 transitions. Second operand 9 states. [2020-02-10 19:46:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:32,888 INFO L93 Difference]: Finished difference Result 663 states and 1979 transitions. [2020-02-10 19:46:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:32,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:32,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:32,890 INFO L225 Difference]: With dead ends: 663 [2020-02-10 19:46:32,891 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 19:46:32,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:32,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 19:46:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 395. [2020-02-10 19:46:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:46:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1375 transitions. [2020-02-10 19:46:32,902 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1375 transitions. Word has length 22 [2020-02-10 19:46:32,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:32,902 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1375 transitions. [2020-02-10 19:46:32,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:32,902 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1375 transitions. [2020-02-10 19:46:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:32,902 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:32,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:32,903 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 19:46:32,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:32,903 INFO L82 PathProgramCache]: Analyzing trace with hash 64998280, now seen corresponding path program 393 times [2020-02-10 19:46:32,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:32,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260689887] [2020-02-10 19:46:32,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:33,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 19:46:33,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260689887] [2020-02-10 19:46:33,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:33,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:33,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180080002] [2020-02-10 19:46:33,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:33,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:33,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:33,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:33,175 INFO L87 Difference]: Start difference. First operand 395 states and 1375 transitions. Second operand 9 states. [2020-02-10 19:46:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:33,255 INFO L93 Difference]: Finished difference Result 672 states and 1998 transitions. [2020-02-10 19:46:33,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:33,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:33,257 INFO L225 Difference]: With dead ends: 672 [2020-02-10 19:46:33,257 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 19:46:33,257 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 19:46:33,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 401. [2020-02-10 19:46:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 19:46:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1385 transitions. [2020-02-10 19:46:33,267 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1385 transitions. Word has length 22 [2020-02-10 19:46:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:33,267 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1385 transitions. [2020-02-10 19:46:33,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1385 transitions. [2020-02-10 19:46:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:33,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:33,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 19:46:33,268 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 19:46:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:33,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1526101748, now seen corresponding path program 394 times [2020-02-10 19:46:33,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:33,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307982192] [2020-02-10 19:46:33,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:33,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 19:46:33,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307982192] [2020-02-10 19:46:33,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:33,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:33,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636143136] [2020-02-10 19:46:33,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:33,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:33,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:33,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:33,539 INFO L87 Difference]: Start difference. First operand 401 states and 1385 transitions. Second operand 9 states. [2020-02-10 19:46:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:33,645 INFO L93 Difference]: Finished difference Result 669 states and 1987 transitions. [2020-02-10 19:46:33,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:33,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:33,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:33,647 INFO L225 Difference]: With dead ends: 669 [2020-02-10 19:46:33,647 INFO L226 Difference]: Without dead ends: 650 [2020-02-10 19:46: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 19:46:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-02-10 19:46:33,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 395. [2020-02-10 19:46:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:46:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1371 transitions. [2020-02-10 19:46:33,658 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1371 transitions. Word has length 22 [2020-02-10 19:46:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:33,659 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1371 transitions. [2020-02-10 19:46:33,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1371 transitions. [2020-02-10 19:46:33,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:33,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46: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 19:46:33,660 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 19:46:33,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:33,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1150298134, now seen corresponding path program 395 times [2020-02-10 19:46:33,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:33,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942728991] [2020-02-10 19:46:33,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:33,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 19:46:33,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942728991] [2020-02-10 19:46:33,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:33,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:33,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653661474] [2020-02-10 19:46:33,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:33,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:33,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:33,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:33,921 INFO L87 Difference]: Start difference. First operand 395 states and 1371 transitions. Second operand 9 states. [2020-02-10 19:46:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:34,030 INFO L93 Difference]: Finished difference Result 659 states and 1968 transitions. [2020-02-10 19:46:34,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:34,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:34,032 INFO L225 Difference]: With dead ends: 659 [2020-02-10 19:46:34,032 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 19:46:34,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 19:46:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 398. [2020-02-10 19:46:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:46:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1376 transitions. [2020-02-10 19:46:34,042 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1376 transitions. Word has length 22 [2020-02-10 19:46:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:34,042 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1376 transitions. [2020-02-10 19:46:34,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1376 transitions. [2020-02-10 19:46:34,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:34,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:34,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 19:46:34,043 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 19:46:34,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash 578749200, now seen corresponding path program 396 times [2020-02-10 19:46:34,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:34,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898727478] [2020-02-10 19:46:34,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:34,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 19:46:34,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898727478] [2020-02-10 19:46:34,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:34,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:34,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051781973] [2020-02-10 19:46:34,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:34,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:34,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:34,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:34,309 INFO L87 Difference]: Start difference. First operand 398 states and 1376 transitions. Second operand 9 states. [2020-02-10 19:46:34,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:34,413 INFO L93 Difference]: Finished difference Result 661 states and 1969 transitions. [2020-02-10 19:46:34,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:34,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:34,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:34,415 INFO L225 Difference]: With dead ends: 661 [2020-02-10 19:46:34,415 INFO L226 Difference]: Without dead ends: 641 [2020-02-10 19:46:34,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 19:46:34,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-02-10 19:46:34,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 391. [2020-02-10 19:46:34,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:46:34,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-02-10 19:46:34,425 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-02-10 19:46:34,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:34,425 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-02-10 19:46:34,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-02-10 19:46:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:34,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:34,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 19:46:34,426 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 19:46:34,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:34,426 INFO L82 PathProgramCache]: Analyzing trace with hash 320514856, now seen corresponding path program 397 times [2020-02-10 19:46:34,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:34,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904411613] [2020-02-10 19:46:34,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:34,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 19:46:34,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904411613] [2020-02-10 19:46:34,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:34,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:34,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620004775] [2020-02-10 19:46:34,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:34,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:34,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:34,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:34,693 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:46:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:34,775 INFO L93 Difference]: Finished difference Result 662 states and 1972 transitions. [2020-02-10 19:46:34,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:34,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:34,777 INFO L225 Difference]: With dead ends: 662 [2020-02-10 19:46:34,777 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 19:46:34,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:34,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 19:46:34,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 397. [2020-02-10 19:46:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:46:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1376 transitions. [2020-02-10 19:46:34,787 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1376 transitions. Word has length 22 [2020-02-10 19:46:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:34,787 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1376 transitions. [2020-02-10 19:46:34,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1376 transitions. [2020-02-10 19:46:34,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:34,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:34,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 19:46:34,788 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 19:46:34,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:34,788 INFO L82 PathProgramCache]: Analyzing trace with hash 447151230, now seen corresponding path program 398 times [2020-02-10 19:46:34,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:34,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996749289] [2020-02-10 19:46:34,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:35,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 19:46:35,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996749289] [2020-02-10 19:46:35,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:35,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:35,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946560424] [2020-02-10 19:46:35,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:35,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:35,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:35,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:35,051 INFO L87 Difference]: Start difference. First operand 397 states and 1376 transitions. Second operand 9 states. [2020-02-10 19:46:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:35,149 INFO L93 Difference]: Finished difference Result 656 states and 1958 transitions. [2020-02-10 19:46:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:35,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:35,151 INFO L225 Difference]: With dead ends: 656 [2020-02-10 19:46:35,151 INFO L226 Difference]: Without dead ends: 643 [2020-02-10 19:46:35,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 19:46:35,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-02-10 19:46:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 394. [2020-02-10 19:46:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1369 transitions. [2020-02-10 19:46:35,161 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1369 transitions. Word has length 22 [2020-02-10 19:46:35,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:35,161 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1369 transitions. [2020-02-10 19:46:35,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:35,161 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1369 transitions. [2020-02-10 19:46:35,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:35,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:35,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 19:46:35,162 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 19:46:35,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:35,162 INFO L82 PathProgramCache]: Analyzing trace with hash 855744658, now seen corresponding path program 399 times [2020-02-10 19:46:35,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:35,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530362217] [2020-02-10 19:46:35,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:35,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 19:46:35,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530362217] [2020-02-10 19:46:35,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:35,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:35,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520753344] [2020-02-10 19:46:35,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:35,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:35,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:35,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:35,441 INFO L87 Difference]: Start difference. First operand 394 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:46:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:35,517 INFO L93 Difference]: Finished difference Result 668 states and 1984 transitions. [2020-02-10 19:46:35,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:35,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:35,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:35,519 INFO L225 Difference]: With dead ends: 668 [2020-02-10 19:46:35,519 INFO L226 Difference]: Without dead ends: 652 [2020-02-10 19:46:35,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 19:46:35,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-02-10 19:46:35,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 400. [2020-02-10 19:46:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 19:46:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1379 transitions. [2020-02-10 19:46:35,530 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1379 transitions. Word has length 22 [2020-02-10 19:46:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:35,530 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1379 transitions. [2020-02-10 19:46:35,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1379 transitions. [2020-02-10 19:46:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:35,531 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:35,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 19:46:35,531 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 19:46:35,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:35,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1602175584, now seen corresponding path program 400 times [2020-02-10 19:46:35,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:35,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800183296] [2020-02-10 19:46:35,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:35,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800183296] [2020-02-10 19:46:35,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:35,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:35,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049751829] [2020-02-10 19:46:35,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:35,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:35,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:35,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:35,804 INFO L87 Difference]: Start difference. First operand 400 states and 1379 transitions. Second operand 9 states. [2020-02-10 19:46:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:35,926 INFO L93 Difference]: Finished difference Result 665 states and 1973 transitions. [2020-02-10 19:46:35,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:35,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:35,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:35,928 INFO L225 Difference]: With dead ends: 665 [2020-02-10 19:46:35,929 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 19:46:35,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 19:46:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 19:46:35,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 394. [2020-02-10 19:46:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:35,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1366 transitions. [2020-02-10 19:46:35,939 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1366 transitions. Word has length 22 [2020-02-10 19:46:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:35,939 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1366 transitions. [2020-02-10 19:46:35,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:35,940 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1366 transitions. [2020-02-10 19:46:35,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:35,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:35,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 19:46:35,940 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 19:46:35,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:35,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1163789728, now seen corresponding path program 401 times [2020-02-10 19:46:35,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:35,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784173588] [2020-02-10 19:46:35,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:36,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 19:46:36,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784173588] [2020-02-10 19:46:36,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:36,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:36,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436399508] [2020-02-10 19:46:36,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:36,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:36,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:36,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:36,220 INFO L87 Difference]: Start difference. First operand 394 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:46:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:36,322 INFO L93 Difference]: Finished difference Result 652 states and 1948 transitions. [2020-02-10 19:46:36,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:36,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:36,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:36,324 INFO L225 Difference]: With dead ends: 652 [2020-02-10 19:46:36,324 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 19:46:36,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 19:46:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 19:46:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 396. [2020-02-10 19:46:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:46:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1369 transitions. [2020-02-10 19:46:36,335 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1369 transitions. Word has length 22 [2020-02-10 19:46:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:36,335 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1369 transitions. [2020-02-10 19:46:36,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1369 transitions. [2020-02-10 19:46:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:36,336 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:36,336 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:36,336 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 19:46:36,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash -592334922, now seen corresponding path program 402 times [2020-02-10 19:46:36,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:36,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831287649] [2020-02-10 19:46:36,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:36,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 19:46:36,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831287649] [2020-02-10 19:46:36,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:36,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:36,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395675635] [2020-02-10 19:46:36,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:36,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:36,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:36,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:36,618 INFO L87 Difference]: Start difference. First operand 396 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:46:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:36,713 INFO L93 Difference]: Finished difference Result 655 states and 1952 transitions. [2020-02-10 19:46:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:36,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:36,715 INFO L225 Difference]: With dead ends: 655 [2020-02-10 19:46:36,715 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 19:46:36,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 19:46:36,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 19:46:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 391. [2020-02-10 19:46:36,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:46:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1359 transitions. [2020-02-10 19:46:36,729 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1359 transitions. Word has length 22 [2020-02-10 19:46:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:36,729 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1359 transitions. [2020-02-10 19:46:36,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1359 transitions. [2020-02-10 19:46:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:36,730 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:36,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 19:46:36,730 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 19:46:36,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:36,730 INFO L82 PathProgramCache]: Analyzing trace with hash -873775350, now seen corresponding path program 403 times [2020-02-10 19:46:36,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:36,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158097010] [2020-02-10 19:46:36,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:36,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 19:46:36,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158097010] [2020-02-10 19:46:36,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:36,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:36,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881032987] [2020-02-10 19:46:36,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:36,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:36,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:36,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:36,999 INFO L87 Difference]: Start difference. First operand 391 states and 1359 transitions. Second operand 9 states. [2020-02-10 19:46:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:37,129 INFO L93 Difference]: Finished difference Result 641 states and 1927 transitions. [2020-02-10 19:46:37,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:37,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:37,131 INFO L225 Difference]: With dead ends: 641 [2020-02-10 19:46:37,131 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 19:46:37,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 19:46:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 395. [2020-02-10 19:46:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:46:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1369 transitions. [2020-02-10 19:46:37,141 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1369 transitions. Word has length 22 [2020-02-10 19:46:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:37,141 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1369 transitions. [2020-02-10 19:46:37,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1369 transitions. [2020-02-10 19:46:37,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:37,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:37,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 19:46:37,142 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 19:46:37,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:37,142 INFO L82 PathProgramCache]: Analyzing trace with hash 468157438, now seen corresponding path program 404 times [2020-02-10 19:46:37,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:37,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457887777] [2020-02-10 19:46:37,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:37,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 19:46:37,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457887777] [2020-02-10 19:46:37,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:37,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:37,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18951254] [2020-02-10 19:46:37,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:37,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:37,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:37,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:37,414 INFO L87 Difference]: Start difference. First operand 395 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:46:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:37,522 INFO L93 Difference]: Finished difference Result 640 states and 1923 transitions. [2020-02-10 19:46:37,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:37,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:37,524 INFO L225 Difference]: With dead ends: 640 [2020-02-10 19:46:37,525 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 19:46:37,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:37,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 19:46:37,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 393. [2020-02-10 19:46:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:46:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1364 transitions. [2020-02-10 19:46:37,535 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1364 transitions. Word has length 22 [2020-02-10 19:46:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:37,535 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1364 transitions. [2020-02-10 19:46:37,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1364 transitions. [2020-02-10 19:46:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:37,536 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:37,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 19:46:37,536 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 19:46:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:37,536 INFO L82 PathProgramCache]: Analyzing trace with hash -338545548, now seen corresponding path program 405 times [2020-02-10 19:46:37,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:37,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605462714] [2020-02-10 19:46:37,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:37,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 19:46:37,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605462714] [2020-02-10 19:46:37,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:37,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:37,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707999800] [2020-02-10 19:46:37,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:37,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:37,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:37,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:37,802 INFO L87 Difference]: Start difference. First operand 393 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:46:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:37,931 INFO L93 Difference]: Finished difference Result 645 states and 1934 transitions. [2020-02-10 19:46:37,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:37,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:37,933 INFO L225 Difference]: With dead ends: 645 [2020-02-10 19:46:37,933 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 19:46:37,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 19:46:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 19:46:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 396. [2020-02-10 19:46:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:46:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1369 transitions. [2020-02-10 19:46:37,943 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1369 transitions. Word has length 22 [2020-02-10 19:46:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:37,943 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1369 transitions. [2020-02-10 19:46:37,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:37,944 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1369 transitions. [2020-02-10 19:46:37,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:37,944 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:37,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 19:46:37,944 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 19:46:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:37,944 INFO L82 PathProgramCache]: Analyzing trace with hash -566934556, now seen corresponding path program 406 times [2020-02-10 19:46:37,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:37,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051084702] [2020-02-10 19:46:37,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46: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 19:46:38,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051084702] [2020-02-10 19:46:38,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:38,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:38,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418493911] [2020-02-10 19:46:38,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:38,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:38,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:38,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:38,209 INFO L87 Difference]: Start difference. First operand 396 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:46:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:38,317 INFO L93 Difference]: Finished difference Result 647 states and 1935 transitions. [2020-02-10 19:46:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:38,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:38,319 INFO L225 Difference]: With dead ends: 647 [2020-02-10 19:46:38,319 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 19:46:38,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 19:46:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 393. [2020-02-10 19:46:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:46:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-02-10 19:46:38,329 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-02-10 19:46:38,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:38,329 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-02-10 19:46:38,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-02-10 19:46:38,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:38,330 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:38,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 19:46:38,330 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 19:46:38,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:38,330 INFO L82 PathProgramCache]: Analyzing trace with hash -69698140, now seen corresponding path program 407 times [2020-02-10 19:46:38,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:38,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713595172] [2020-02-10 19:46:38,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:38,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713595172] [2020-02-10 19:46:38,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:38,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:38,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328600527] [2020-02-10 19:46:38,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:38,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:38,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:38,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:38,594 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:46:38,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:38,695 INFO L93 Difference]: Finished difference Result 642 states and 1925 transitions. [2020-02-10 19:46:38,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:38,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:38,697 INFO L225 Difference]: With dead ends: 642 [2020-02-10 19:46:38,697 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 19:46:38,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 19:46:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 19:46:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 395. [2020-02-10 19:46:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:46:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1365 transitions. [2020-02-10 19:46:38,706 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1365 transitions. Word has length 22 [2020-02-10 19:46:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:38,707 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1365 transitions. [2020-02-10 19:46:38,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1365 transitions. [2020-02-10 19:46:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:38,707 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:38,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 19:46:38,707 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 19:46:38,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:38,708 INFO L82 PathProgramCache]: Analyzing trace with hash 501756666, now seen corresponding path program 408 times [2020-02-10 19:46:38,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:38,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860740317] [2020-02-10 19:46:38,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:38,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 19:46:38,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860740317] [2020-02-10 19:46:38,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:38,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:38,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670078896] [2020-02-10 19:46:38,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:38,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:38,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:38,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:38,984 INFO L87 Difference]: Start difference. First operand 395 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:46:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:39,111 INFO L93 Difference]: Finished difference Result 645 states and 1929 transitions. [2020-02-10 19:46:39,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:39,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:39,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:39,114 INFO L225 Difference]: With dead ends: 645 [2020-02-10 19:46:39,114 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 19:46:39,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:39,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 19:46:39,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 388. [2020-02-10 19:46:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:46:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1352 transitions. [2020-02-10 19:46:39,123 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1352 transitions. Word has length 22 [2020-02-10 19:46:39,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:39,124 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1352 transitions. [2020-02-10 19:46:39,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1352 transitions. [2020-02-10 19:46:39,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:39,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:39,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 19:46:39,124 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 19:46:39,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:39,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1062496130, now seen corresponding path program 409 times [2020-02-10 19:46:39,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:39,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693226974] [2020-02-10 19:46:39,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:39,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 19:46:39,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693226974] [2020-02-10 19:46:39,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:39,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:39,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494513162] [2020-02-10 19:46:39,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:39,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:39,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:39,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:39,418 INFO L87 Difference]: Start difference. First operand 388 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:46:39,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:39,499 INFO L93 Difference]: Finished difference Result 696 states and 2068 transitions. [2020-02-10 19:46:39,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:39,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:39,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:39,502 INFO L225 Difference]: With dead ends: 696 [2020-02-10 19:46:39,502 INFO L226 Difference]: Without dead ends: 680 [2020-02-10 19:46:39,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:39,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-02-10 19:46:39,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 403. [2020-02-10 19:46:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-02-10 19:46:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1397 transitions. [2020-02-10 19:46:39,513 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1397 transitions. Word has length 22 [2020-02-10 19:46:39,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:39,513 INFO L479 AbstractCegarLoop]: Abstraction has 403 states and 1397 transitions. [2020-02-10 19:46:39,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1397 transitions. [2020-02-10 19:46:39,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:39,513 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:39,513 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:39,514 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 19:46:39,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:39,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1642205280, now seen corresponding path program 410 times [2020-02-10 19:46:39,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:39,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813198742] [2020-02-10 19:46:39,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:39,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 19:46:39,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813198742] [2020-02-10 19:46:39,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:39,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:39,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793826847] [2020-02-10 19:46:39,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:39,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:39,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:39,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:39,797 INFO L87 Difference]: Start difference. First operand 403 states and 1397 transitions. Second operand 9 states. [2020-02-10 19:46:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:39,923 INFO L93 Difference]: Finished difference Result 691 states and 2055 transitions. [2020-02-10 19:46:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:39,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:39,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:39,925 INFO L225 Difference]: With dead ends: 691 [2020-02-10 19:46:39,925 INFO L226 Difference]: Without dead ends: 676 [2020-02-10 19:46:39,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 19:46:39,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2020-02-10 19:46:39,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 399. [2020-02-10 19:46:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:46:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1387 transitions. [2020-02-10 19:46:39,936 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1387 transitions. Word has length 22 [2020-02-10 19:46:39,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:39,936 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1387 transitions. [2020-02-10 19:46:39,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1387 transitions. [2020-02-10 19:46:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:39,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:39,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 19:46:39,937 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 19:46:39,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:39,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1327546994, now seen corresponding path program 411 times [2020-02-10 19:46:39,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:39,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118765422] [2020-02-10 19:46:39,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:40,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 19:46:40,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118765422] [2020-02-10 19:46:40,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:40,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:40,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336151285] [2020-02-10 19:46:40,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:40,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:40,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:40,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:40,237 INFO L87 Difference]: Start difference. First operand 399 states and 1387 transitions. Second operand 9 states. [2020-02-10 19:46:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:40,320 INFO L93 Difference]: Finished difference Result 703 states and 2080 transitions. [2020-02-10 19:46:40,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:40,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:40,322 INFO L225 Difference]: With dead ends: 703 [2020-02-10 19:46:40,322 INFO L226 Difference]: Without dead ends: 687 [2020-02-10 19:46:40,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 19:46:40,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-02-10 19:46:40,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 407. [2020-02-10 19:46:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-02-10 19:46:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1400 transitions. [2020-02-10 19:46:40,332 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1400 transitions. Word has length 22 [2020-02-10 19:46:40,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:40,332 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 1400 transitions. [2020-02-10 19:46:40,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1400 transitions. [2020-02-10 19:46:40,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:40,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:40,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 19:46:40,333 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 19:46:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:40,333 INFO L82 PathProgramCache]: Analyzing trace with hash -170024556, now seen corresponding path program 412 times [2020-02-10 19:46:40,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:40,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258314475] [2020-02-10 19:46:40,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:40,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 19:46:40,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258314475] [2020-02-10 19:46:40,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:40,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:40,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381149221] [2020-02-10 19:46:40,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:40,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:40,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:40,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:40,627 INFO L87 Difference]: Start difference. First operand 407 states and 1400 transitions. Second operand 9 states. [2020-02-10 19:46:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:40,737 INFO L93 Difference]: Finished difference Result 701 states and 2070 transitions. [2020-02-10 19:46:40,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:40,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:40,739 INFO L225 Difference]: With dead ends: 701 [2020-02-10 19:46:40,739 INFO L226 Difference]: Without dead ends: 679 [2020-02-10 19:46:40,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 19:46:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2020-02-10 19:46:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 399. [2020-02-10 19:46:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:46:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1382 transitions. [2020-02-10 19:46:40,749 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1382 transitions. Word has length 22 [2020-02-10 19:46:40,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:40,749 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1382 transitions. [2020-02-10 19:46:40,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1382 transitions. [2020-02-10 19:46:40,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:40,750 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:40,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 19:46:40,750 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 19:46:40,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:40,750 INFO L82 PathProgramCache]: Analyzing trace with hash 112250580, now seen corresponding path program 413 times [2020-02-10 19:46:40,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:40,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006365612] [2020-02-10 19:46:40,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:41,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 19:46:41,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006365612] [2020-02-10 19:46:41,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:41,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:41,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497875649] [2020-02-10 19:46:41,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:41,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:41,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:41,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:41,041 INFO L87 Difference]: Start difference. First operand 399 states and 1382 transitions. Second operand 9 states. [2020-02-10 19:46:41,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:41,146 INFO L93 Difference]: Finished difference Result 688 states and 2045 transitions. [2020-02-10 19:46:41,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:41,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:41,149 INFO L225 Difference]: With dead ends: 688 [2020-02-10 19:46:41,149 INFO L226 Difference]: Without dead ends: 677 [2020-02-10 19:46:41,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:41,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-02-10 19:46:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 402. [2020-02-10 19:46:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 19:46:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1387 transitions. [2020-02-10 19:46:41,158 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1387 transitions. Word has length 22 [2020-02-10 19:46:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:41,159 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1387 transitions. [2020-02-10 19:46:41,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1387 transitions. [2020-02-10 19:46:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:41,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:41,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 19:46:41,159 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 19:46:41,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:41,160 INFO L82 PathProgramCache]: Analyzing trace with hash 130684606, now seen corresponding path program 414 times [2020-02-10 19:46:41,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:41,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494209470] [2020-02-10 19:46:41,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:41,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 19:46:41,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494209470] [2020-02-10 19:46:41,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:41,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:41,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515474399] [2020-02-10 19:46:41,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:41,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:41,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:41,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:41,454 INFO L87 Difference]: Start difference. First operand 402 states and 1387 transitions. Second operand 9 states. [2020-02-10 19:46:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:41,565 INFO L93 Difference]: Finished difference Result 691 states and 2048 transitions. [2020-02-10 19:46:41,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:41,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:41,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:41,567 INFO L225 Difference]: With dead ends: 691 [2020-02-10 19:46:41,567 INFO L226 Difference]: Without dead ends: 669 [2020-02-10 19:46:41,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 19:46:41,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2020-02-10 19:46:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 394. [2020-02-10 19:46:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1370 transitions. [2020-02-10 19:46:41,578 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1370 transitions. Word has length 22 [2020-02-10 19:46:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:41,578 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1370 transitions. [2020-02-10 19:46:41,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1370 transitions. [2020-02-10 19:46:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:41,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:41,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 19:46:41,579 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 19:46:41,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:41,579 INFO L82 PathProgramCache]: Analyzing trace with hash 217524678, now seen corresponding path program 415 times [2020-02-10 19:46:41,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:41,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808563385] [2020-02-10 19:46:41,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:41,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 19:46:41,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808563385] [2020-02-10 19:46:41,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:41,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:41,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767321783] [2020-02-10 19:46:41,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:41,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:41,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:41,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:41,868 INFO L87 Difference]: Start difference. First operand 394 states and 1370 transitions. Second operand 9 states. [2020-02-10 19:46:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:41,951 INFO L93 Difference]: Finished difference Result 692 states and 2055 transitions. [2020-02-10 19:46:41,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:41,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:41,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:41,954 INFO L225 Difference]: With dead ends: 692 [2020-02-10 19:46:41,954 INFO L226 Difference]: Without dead ends: 676 [2020-02-10 19:46:41,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2020-02-10 19:46:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 402. [2020-02-10 19:46:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 19:46:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1390 transitions. [2020-02-10 19:46:41,965 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1390 transitions. Word has length 22 [2020-02-10 19:46:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:41,965 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1390 transitions. [2020-02-10 19:46:41,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1390 transitions. [2020-02-10 19:46:41,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:41,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46: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 19:46:41,966 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 19:46:41,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:41,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1807790564, now seen corresponding path program 416 times [2020-02-10 19:46:41,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:41,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956654631] [2020-02-10 19:46:41,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46: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 19:46:42,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956654631] [2020-02-10 19:46:42,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:42,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:42,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104061793] [2020-02-10 19:46:42,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:42,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:42,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:42,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:42,243 INFO L87 Difference]: Start difference. First operand 402 states and 1390 transitions. Second operand 9 states. [2020-02-10 19:46:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:42,355 INFO L93 Difference]: Finished difference Result 687 states and 2042 transitions. [2020-02-10 19:46:42,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:42,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:42,357 INFO L225 Difference]: With dead ends: 687 [2020-02-10 19:46:42,357 INFO L226 Difference]: Without dead ends: 672 [2020-02-10 19:46:42,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-02-10 19:46:42,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 398. [2020-02-10 19:46:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:46:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1380 transitions. [2020-02-10 19:46:42,366 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1380 transitions. Word has length 22 [2020-02-10 19:46:42,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:42,367 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1380 transitions. [2020-02-10 19:46:42,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:42,367 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1380 transitions. [2020-02-10 19:46:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:42,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:42,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 19:46:42,367 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 19:46:42,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:42,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1550087606, now seen corresponding path program 417 times [2020-02-10 19:46:42,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:42,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031482942] [2020-02-10 19:46:42,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:42,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 19:46:42,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031482942] [2020-02-10 19:46:42,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:42,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:42,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707783596] [2020-02-10 19:46:42,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:42,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:42,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:42,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:42,657 INFO L87 Difference]: Start difference. First operand 398 states and 1380 transitions. Second operand 9 states. [2020-02-10 19:46:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:42,749 INFO L93 Difference]: Finished difference Result 696 states and 2061 transitions. [2020-02-10 19:46:42,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:42,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:42,751 INFO L225 Difference]: With dead ends: 696 [2020-02-10 19:46:42,751 INFO L226 Difference]: Without dead ends: 680 [2020-02-10 19:46:42,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 19:46:42,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-02-10 19:46:42,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 404. [2020-02-10 19:46:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-02-10 19:46:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1390 transitions. [2020-02-10 19:46:42,761 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1390 transitions. Word has length 22 [2020-02-10 19:46:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:42,762 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 1390 transitions. [2020-02-10 19:46:42,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1390 transitions. [2020-02-10 19:46:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:42,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:42,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 19:46:42,762 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 19:46:42,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:42,763 INFO L82 PathProgramCache]: Analyzing trace with hash -41012422, now seen corresponding path program 418 times [2020-02-10 19:46:42,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:42,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86674487] [2020-02-10 19:46:42,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:43,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 19:46:43,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86674487] [2020-02-10 19:46:43,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:43,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:43,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717865017] [2020-02-10 19:46:43,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:43,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:43,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:43,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:43,044 INFO L87 Difference]: Start difference. First operand 404 states and 1390 transitions. Second operand 9 states. [2020-02-10 19:46:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:43,168 INFO L93 Difference]: Finished difference Result 693 states and 2050 transitions. [2020-02-10 19:46:43,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:43,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:43,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:43,170 INFO L225 Difference]: With dead ends: 693 [2020-02-10 19:46:43,170 INFO L226 Difference]: Without dead ends: 674 [2020-02-10 19:46:43,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 19:46:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2020-02-10 19:46:43,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 398. [2020-02-10 19:46:43,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:46:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1376 transitions. [2020-02-10 19:46:43,181 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1376 transitions. Word has length 22 [2020-02-10 19:46:43,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:43,181 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1376 transitions. [2020-02-10 19:46:43,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:43,181 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1376 transitions. [2020-02-10 19:46:43,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:43,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:43,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:43,182 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 19:46:43,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:43,182 INFO L82 PathProgramCache]: Analyzing trace with hash 334791192, now seen corresponding path program 419 times [2020-02-10 19:46:43,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:43,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752784905] [2020-02-10 19:46:43,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:43,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 19:46:43,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752784905] [2020-02-10 19:46:43,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:43,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:43,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022206825] [2020-02-10 19:46:43,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:43,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:43,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:43,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:43,463 INFO L87 Difference]: Start difference. First operand 398 states and 1376 transitions. Second operand 9 states. [2020-02-10 19:46:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:43,570 INFO L93 Difference]: Finished difference Result 683 states and 2031 transitions. [2020-02-10 19:46:43,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:43,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:43,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:43,572 INFO L225 Difference]: With dead ends: 683 [2020-02-10 19:46:43,573 INFO L226 Difference]: Without dead ends: 672 [2020-02-10 19:46:43,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 19:46:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-02-10 19:46:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 401. [2020-02-10 19:46:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 19:46:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1381 transitions. [2020-02-10 19:46:43,583 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1381 transitions. Word has length 22 [2020-02-10 19:46:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:43,583 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1381 transitions. [2020-02-10 19:46:43,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1381 transitions. [2020-02-10 19:46:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:43,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:43,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 19:46:43,584 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 19:46:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:43,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2063838526, now seen corresponding path program 420 times [2020-02-10 19:46:43,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:43,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542965293] [2020-02-10 19:46:43,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:43,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 19:46:43,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542965293] [2020-02-10 19:46:43,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:43,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:43,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173571241] [2020-02-10 19:46:43,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:43,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:43,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:43,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:43,862 INFO L87 Difference]: Start difference. First operand 401 states and 1381 transitions. Second operand 9 states. [2020-02-10 19:46:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:43,974 INFO L93 Difference]: Finished difference Result 685 states and 2032 transitions. [2020-02-10 19:46:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:43,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:43,976 INFO L225 Difference]: With dead ends: 685 [2020-02-10 19:46:43,976 INFO L226 Difference]: Without dead ends: 665 [2020-02-10 19:46:43,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 19:46:43,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-02-10 19:46:43,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 394. [2020-02-10 19:46:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1366 transitions. [2020-02-10 19:46:43,987 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1366 transitions. Word has length 22 [2020-02-10 19:46:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:43,987 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1366 transitions. [2020-02-10 19:46:43,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1366 transitions. [2020-02-10 19:46:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:43,988 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:43,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 19:46:43,988 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 19:46:43,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:43,988 INFO L82 PathProgramCache]: Analyzing trace with hash -312675198, now seen corresponding path program 421 times [2020-02-10 19:46:43,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:43,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706626846] [2020-02-10 19:46:43,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:44,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 19:46:44,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706626846] [2020-02-10 19:46:44,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:44,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:44,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900795581] [2020-02-10 19:46:44,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:44,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:44,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:44,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:44,301 INFO L87 Difference]: Start difference. First operand 394 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:46:44,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:44,399 INFO L93 Difference]: Finished difference Result 712 states and 2100 transitions. [2020-02-10 19:46:44,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:44,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:44,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:44,401 INFO L225 Difference]: With dead ends: 712 [2020-02-10 19:46:44,401 INFO L226 Difference]: Without dead ends: 696 [2020-02-10 19:46:44,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:44,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2020-02-10 19:46:44,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 410. [2020-02-10 19:46:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-02-10 19:46:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1404 transitions. [2020-02-10 19:46:44,414 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1404 transitions. Word has length 22 [2020-02-10 19:46:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:44,414 INFO L479 AbstractCegarLoop]: Abstraction has 410 states and 1404 transitions. [2020-02-10 19:46:44,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1404 transitions. [2020-02-10 19:46:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:44,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:44,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 19:46:44,415 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 19:46:44,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:44,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1810246748, now seen corresponding path program 422 times [2020-02-10 19:46:44,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:44,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736530953] [2020-02-10 19:46:44,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:44,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 19:46:44,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736530953] [2020-02-10 19:46:44,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:44,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:44,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118073036] [2020-02-10 19:46:44,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:44,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:44,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:44,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:44,724 INFO L87 Difference]: Start difference. First operand 410 states and 1404 transitions. Second operand 9 states. [2020-02-10 19:46:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:44,834 INFO L93 Difference]: Finished difference Result 710 states and 2090 transitions. [2020-02-10 19:46:44,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:44,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:44,836 INFO L225 Difference]: With dead ends: 710 [2020-02-10 19:46:44,836 INFO L226 Difference]: Without dead ends: 688 [2020-02-10 19:46:44,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 19:46:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2020-02-10 19:46:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 402. [2020-02-10 19:46:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 19:46:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1384 transitions. [2020-02-10 19:46:44,846 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1384 transitions. Word has length 22 [2020-02-10 19:46:44,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:44,846 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1384 transitions. [2020-02-10 19:46:44,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:44,846 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1384 transitions. [2020-02-10 19:46:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:44,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:44,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 19:46:44,847 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 19:46:44,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:44,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1176729798, now seen corresponding path program 423 times [2020-02-10 19:46:44,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:44,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788392876] [2020-02-10 19:46:44,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:45,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 19:46:45,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788392876] [2020-02-10 19:46:45,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:45,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:45,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920865366] [2020-02-10 19:46:45,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:45,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:45,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:45,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:45,148 INFO L87 Difference]: Start difference. First operand 402 states and 1384 transitions. Second operand 9 states. [2020-02-10 19:46:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:45,230 INFO L93 Difference]: Finished difference Result 709 states and 2087 transitions. [2020-02-10 19:46:45,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:45,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:45,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:45,233 INFO L225 Difference]: With dead ends: 709 [2020-02-10 19:46:45,233 INFO L226 Difference]: Without dead ends: 693 [2020-02-10 19:46:45,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 19:46:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-02-10 19:46:45,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 408. [2020-02-10 19:46:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2020-02-10 19:46:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1394 transitions. [2020-02-10 19:46:45,245 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 1394 transitions. Word has length 22 [2020-02-10 19:46:45,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:45,245 INFO L479 AbstractCegarLoop]: Abstraction has 408 states and 1394 transitions. [2020-02-10 19:46:45,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 1394 transitions. [2020-02-10 19:46:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:45,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:45,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 19:46:45,246 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 19:46:45,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:45,246 INFO L82 PathProgramCache]: Analyzing trace with hash -414370230, now seen corresponding path program 424 times [2020-02-10 19:46:45,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:45,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836480409] [2020-02-10 19:46:45,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:45,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 19:46:45,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836480409] [2020-02-10 19:46:45,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:45,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:45,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907357646] [2020-02-10 19:46:45,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:45,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:45,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:45,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:45,539 INFO L87 Difference]: Start difference. First operand 408 states and 1394 transitions. Second operand 9 states. [2020-02-10 19:46:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:45,647 INFO L93 Difference]: Finished difference Result 706 states and 2076 transitions. [2020-02-10 19:46:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:45,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:45,649 INFO L225 Difference]: With dead ends: 706 [2020-02-10 19:46:45,649 INFO L226 Difference]: Without dead ends: 687 [2020-02-10 19:46:45,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 19:46:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-02-10 19:46:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 402. [2020-02-10 19:46:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 19:46:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1378 transitions. [2020-02-10 19:46:45,660 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1378 transitions. Word has length 22 [2020-02-10 19:46:45,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:45,660 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1378 transitions. [2020-02-10 19:46:45,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1378 transitions. [2020-02-10 19:46:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:45,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:45,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 19:46:45,661 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 19:46:45,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:45,661 INFO L82 PathProgramCache]: Analyzing trace with hash 430284376, now seen corresponding path program 425 times [2020-02-10 19:46:45,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:45,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018318694] [2020-02-10 19:46:45,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:45,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 19:46:45,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018318694] [2020-02-10 19:46:45,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:45,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:45,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49319997] [2020-02-10 19:46:45,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:45,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:45,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:45,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:45,952 INFO L87 Difference]: Start difference. First operand 402 states and 1378 transitions. Second operand 9 states. [2020-02-10 19:46:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:46,061 INFO L93 Difference]: Finished difference Result 704 states and 2073 transitions. [2020-02-10 19:46:46,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:46,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:46,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:46,063 INFO L225 Difference]: With dead ends: 704 [2020-02-10 19:46:46,063 INFO L226 Difference]: Without dead ends: 690 [2020-02-10 19:46:46,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 19:46:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2020-02-10 19:46:46,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 407. [2020-02-10 19:46:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-02-10 19:46:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1387 transitions. [2020-02-10 19:46:46,073 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1387 transitions. Word has length 22 [2020-02-10 19:46:46,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:46,073 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 1387 transitions. [2020-02-10 19:46:46,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1387 transitions. [2020-02-10 19:46:46,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:46,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:46,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 19:46:46,074 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 19:46:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:46,074 INFO L82 PathProgramCache]: Analyzing trace with hash 485695636, now seen corresponding path program 426 times [2020-02-10 19:46:46,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:46,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228915870] [2020-02-10 19:46:46,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:46,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 19:46:46,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228915870] [2020-02-10 19:46:46,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:46,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:46,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627774476] [2020-02-10 19:46:46,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:46,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:46,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:46,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:46,373 INFO L87 Difference]: Start difference. First operand 407 states and 1387 transitions. Second operand 9 states. [2020-02-10 19:46:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:46,482 INFO L93 Difference]: Finished difference Result 703 states and 2066 transitions. [2020-02-10 19:46:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:46,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:46,484 INFO L225 Difference]: With dead ends: 703 [2020-02-10 19:46:46,484 INFO L226 Difference]: Without dead ends: 677 [2020-02-10 19:46:46,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 19:46:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-02-10 19:46:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 394. [2020-02-10 19:46:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1360 transitions. [2020-02-10 19:46:46,495 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1360 transitions. Word has length 22 [2020-02-10 19:46:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:46,495 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1360 transitions. [2020-02-10 19:46:46,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1360 transitions. [2020-02-10 19:46:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:46,496 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:46,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 19:46:46,496 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 19:46:46,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:46,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1693910304, now seen corresponding path program 427 times [2020-02-10 19:46:46,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:46,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60177161] [2020-02-10 19:46:46,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:46,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 19:46:46,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60177161] [2020-02-10 19:46:46,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:46,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:46,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75325362] [2020-02-10 19:46:46,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:46,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:46,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:46,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:46,777 INFO L87 Difference]: Start difference. First operand 394 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:46:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:46,891 INFO L93 Difference]: Finished difference Result 679 states and 2021 transitions. [2020-02-10 19:46:46,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:46,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:46,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:46,894 INFO L225 Difference]: With dead ends: 679 [2020-02-10 19:46:46,894 INFO L226 Difference]: Without dead ends: 668 [2020-02-10 19:46:46,894 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-02-10 19:46:46,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 400. [2020-02-10 19:46:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 19:46:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1376 transitions. [2020-02-10 19:46:46,904 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1376 transitions. Word has length 22 [2020-02-10 19:46:46,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:46,905 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1376 transitions. [2020-02-10 19:46:46,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:46,905 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1376 transitions. [2020-02-10 19:46:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:46,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:46,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:46,905 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 19:46:46,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:46,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1712344330, now seen corresponding path program 428 times [2020-02-10 19:46:46,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:46,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466131805] [2020-02-10 19:46:46,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:47,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 19:46:47,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466131805] [2020-02-10 19:46:47,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:47,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:47,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295530535] [2020-02-10 19:46:47,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:47,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:47,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:47,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:47,186 INFO L87 Difference]: Start difference. First operand 400 states and 1376 transitions. Second operand 9 states. [2020-02-10 19:46:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:47,291 INFO L93 Difference]: Finished difference Result 682 states and 2024 transitions. [2020-02-10 19:46:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:47,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:47,294 INFO L225 Difference]: With dead ends: 682 [2020-02-10 19:46:47,294 INFO L226 Difference]: Without dead ends: 665 [2020-02-10 19:46:47,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 19:46:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-02-10 19:46:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 397. [2020-02-10 19:46:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:46:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1368 transitions. [2020-02-10 19:46:47,304 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1368 transitions. Word has length 22 [2020-02-10 19:46:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:47,304 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1368 transitions. [2020-02-10 19:46:47,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:47,305 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1368 transitions. [2020-02-10 19:46:47,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:47,305 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:47,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 19:46:47,305 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 19:46:47,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:47,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1111651996, now seen corresponding path program 429 times [2020-02-10 19:46:47,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:47,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408671230] [2020-02-10 19:46:47,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:47,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 19:46:47,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408671230] [2020-02-10 19:46:47,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:47,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:47,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570612240] [2020-02-10 19:46:47,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:47,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:47,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:47,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:47,584 INFO L87 Difference]: Start difference. First operand 397 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:46:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:47,692 INFO L93 Difference]: Finished difference Result 678 states and 2016 transitions. [2020-02-10 19:46:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:47,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:47,695 INFO L225 Difference]: With dead ends: 678 [2020-02-10 19:46:47,695 INFO L226 Difference]: Without dead ends: 667 [2020-02-10 19:46:47,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 19:46:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-02-10 19:46:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 400. [2020-02-10 19:46:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 19:46:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1373 transitions. [2020-02-10 19:46:47,704 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1373 transitions. Word has length 22 [2020-02-10 19:46:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:47,705 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1373 transitions. [2020-02-10 19:46:47,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1373 transitions. [2020-02-10 19:46:47,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:47,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46: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 19:46:47,705 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 19:46:47,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:47,706 INFO L82 PathProgramCache]: Analyzing trace with hash 617395338, now seen corresponding path program 430 times [2020-02-10 19:46:47,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:47,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131732687] [2020-02-10 19:46:47,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:47,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 19:46:47,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131732687] [2020-02-10 19:46:47,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:47,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:47,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527491978] [2020-02-10 19:46:47,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:47,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:47,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:47,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:47,989 INFO L87 Difference]: Start difference. First operand 400 states and 1373 transitions. Second operand 9 states. [2020-02-10 19:46:48,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:48,101 INFO L93 Difference]: Finished difference Result 680 states and 2017 transitions. [2020-02-10 19:46:48,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:48,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:48,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:48,103 INFO L225 Difference]: With dead ends: 680 [2020-02-10 19:46:48,103 INFO L226 Difference]: Without dead ends: 664 [2020-02-10 19:46:48,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 19:46:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-02-10 19:46:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 397. [2020-02-10 19:46:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:46:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1365 transitions. [2020-02-10 19:46:48,113 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1365 transitions. Word has length 22 [2020-02-10 19:46:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:48,114 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1365 transitions. [2020-02-10 19:46:48,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:48,114 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1365 transitions. [2020-02-10 19:46:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:48,114 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:48,114 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:48,114 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 19:46:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:48,115 INFO L82 PathProgramCache]: Analyzing trace with hash -521763164, now seen corresponding path program 431 times [2020-02-10 19:46:48,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:48,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143254844] [2020-02-10 19:46:48,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:48,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 19:46:48,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143254844] [2020-02-10 19:46:48,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:48,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:48,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218482179] [2020-02-10 19:46:48,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:48,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:48,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:48,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:48,412 INFO L87 Difference]: Start difference. First operand 397 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:46:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:48,526 INFO L93 Difference]: Finished difference Result 686 states and 2031 transitions. [2020-02-10 19:46:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:48,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:48,528 INFO L225 Difference]: With dead ends: 686 [2020-02-10 19:46:48,528 INFO L226 Difference]: Without dead ends: 672 [2020-02-10 19:46:48,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:48,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-02-10 19:46:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 402. [2020-02-10 19:46:48,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 19:46:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1374 transitions. [2020-02-10 19:46:48,538 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1374 transitions. Word has length 22 [2020-02-10 19:46:48,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:48,538 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1374 transitions. [2020-02-10 19:46:48,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:48,538 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1374 transitions. [2020-02-10 19:46:48,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:48,538 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:48,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 19:46:48,539 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 19:46:48,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:48,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1188850144, now seen corresponding path program 432 times [2020-02-10 19:46:48,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:48,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046859788] [2020-02-10 19:46:48,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:48,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 19:46:48,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046859788] [2020-02-10 19:46:48,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:48,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:48,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486092813] [2020-02-10 19:46:48,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:48,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:48,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:48,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:48,837 INFO L87 Difference]: Start difference. First operand 402 states and 1374 transitions. Second operand 9 states. [2020-02-10 19:46:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:48,966 INFO L93 Difference]: Finished difference Result 685 states and 2024 transitions. [2020-02-10 19:46:48,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:48,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:48,969 INFO L225 Difference]: With dead ends: 685 [2020-02-10 19:46:48,969 INFO L226 Difference]: Without dead ends: 658 [2020-02-10 19:46:48,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 19:46:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-02-10 19:46:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 388. [2020-02-10 19:46:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:46:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1347 transitions. [2020-02-10 19:46:48,979 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1347 transitions. Word has length 22 [2020-02-10 19:46:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:48,979 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1347 transitions. [2020-02-10 19:46:48,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:48,979 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1347 transitions. [2020-02-10 19:46:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:48,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:48,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 19:46:48,980 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 19:46:48,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:48,980 INFO L82 PathProgramCache]: Analyzing trace with hash 856930222, now seen corresponding path program 433 times [2020-02-10 19:46:48,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:48,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371109934] [2020-02-10 19:46:48,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:49,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 19:46:49,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371109934] [2020-02-10 19:46:49,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:49,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:49,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807829352] [2020-02-10 19:46:49,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:49,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:49,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:49,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:49,267 INFO L87 Difference]: Start difference. First operand 388 states and 1347 transitions. Second operand 9 states. [2020-02-10 19:46:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:49,363 INFO L93 Difference]: Finished difference Result 682 states and 2018 transitions. [2020-02-10 19:46:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:49,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:49,366 INFO L225 Difference]: With dead ends: 682 [2020-02-10 19:46:49,366 INFO L226 Difference]: Without dead ends: 666 [2020-02-10 19:46:49,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 19:46:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2020-02-10 19:46:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 400. [2020-02-10 19:46:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 19:46:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1381 transitions. [2020-02-10 19:46:49,383 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1381 transitions. Word has length 22 [2020-02-10 19:46:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:49,383 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1381 transitions. [2020-02-10 19:46:49,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1381 transitions. [2020-02-10 19:46:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:49,383 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:49,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 19:46:49,384 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 19:46:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:49,384 INFO L82 PathProgramCache]: Analyzing trace with hash 983566596, now seen corresponding path program 434 times [2020-02-10 19:46:49,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:49,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910532949] [2020-02-10 19:46:49,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:49,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 19:46:49,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910532949] [2020-02-10 19:46:49,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:49,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:49,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155461689] [2020-02-10 19:46:49,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:49,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:49,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:49,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:49,675 INFO L87 Difference]: Start difference. First operand 400 states and 1381 transitions. Second operand 9 states. [2020-02-10 19:46:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:49,781 INFO L93 Difference]: Finished difference Result 676 states and 2004 transitions. [2020-02-10 19:46:49,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:49,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:49,783 INFO L225 Difference]: With dead ends: 676 [2020-02-10 19:46:49,783 INFO L226 Difference]: Without dead ends: 663 [2020-02-10 19:46:49,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 19:46:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-02-10 19:46:49,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 397. [2020-02-10 19:46:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:46:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1374 transitions. [2020-02-10 19:46:49,793 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1374 transitions. Word has length 22 [2020-02-10 19:46:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:49,793 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1374 transitions. [2020-02-10 19:46:49,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1374 transitions. [2020-02-10 19:46:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:49,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:49,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 19:46:49,794 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 19:46:49,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:49,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1829721892, now seen corresponding path program 435 times [2020-02-10 19:46:49,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:49,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059946817] [2020-02-10 19:46:49,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:50,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 19:46:50,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059946817] [2020-02-10 19:46:50,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:50,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:50,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824872326] [2020-02-10 19:46:50,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:50,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:50,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:50,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:50,095 INFO L87 Difference]: Start difference. First operand 397 states and 1374 transitions. Second operand 9 states. [2020-02-10 19:46:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:50,175 INFO L93 Difference]: Finished difference Result 691 states and 2036 transitions. [2020-02-10 19:46:50,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:50,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:50,177 INFO L225 Difference]: With dead ends: 691 [2020-02-10 19:46:50,178 INFO L226 Difference]: Without dead ends: 675 [2020-02-10 19:46:50,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 19:46:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2020-02-10 19:46:50,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 405. [2020-02-10 19:46:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-02-10 19:46:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1387 transitions. [2020-02-10 19:46:50,188 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1387 transitions. Word has length 22 [2020-02-10 19:46:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:50,188 INFO L479 AbstractCegarLoop]: Abstraction has 405 states and 1387 transitions. [2020-02-10 19:46:50,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1387 transitions. [2020-02-10 19:46:50,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:50,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:50,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 19:46:50,189 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 19:46:50,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:50,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1815799812, now seen corresponding path program 436 times [2020-02-10 19:46:50,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:50,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067287590] [2020-02-10 19:46:50,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:50,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 19:46:50,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067287590] [2020-02-10 19:46:50,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:50,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:50,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074988676] [2020-02-10 19:46:50,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:50,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:50,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:50,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:50,476 INFO L87 Difference]: Start difference. First operand 405 states and 1387 transitions. Second operand 9 states. [2020-02-10 19:46:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:50,583 INFO L93 Difference]: Finished difference Result 689 states and 2026 transitions. [2020-02-10 19:46:50,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:50,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:50,585 INFO L225 Difference]: With dead ends: 689 [2020-02-10 19:46:50,586 INFO L226 Difference]: Without dead ends: 667 [2020-02-10 19:46:50,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 19:46:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-02-10 19:46:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 397. [2020-02-10 19:46:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:46:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1370 transitions. [2020-02-10 19:46:50,596 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1370 transitions. Word has length 22 [2020-02-10 19:46:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:50,596 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1370 transitions. [2020-02-10 19:46:50,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1370 transitions. [2020-02-10 19:46:50,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:50,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:50,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 19:46:50,597 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 19:46:50,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:50,597 INFO L82 PathProgramCache]: Analyzing trace with hash 445711018, now seen corresponding path program 437 times [2020-02-10 19:46:50,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:50,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374548324] [2020-02-10 19:46:50,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:50,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 19:46:50,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374548324] [2020-02-10 19:46:50,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:50,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:50,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931046039] [2020-02-10 19:46:50,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:50,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:50,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:50,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:50,882 INFO L87 Difference]: Start difference. First operand 397 states and 1370 transitions. Second operand 9 states. [2020-02-10 19:46:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:50,992 INFO L93 Difference]: Finished difference Result 673 states and 1995 transitions. [2020-02-10 19:46:50,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:50,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:50,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:50,994 INFO L225 Difference]: With dead ends: 673 [2020-02-10 19:46:50,994 INFO L226 Difference]: Without dead ends: 663 [2020-02-10 19:46:50,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-02-10 19:46:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 399. [2020-02-10 19:46:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:46:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1373 transitions. [2020-02-10 19:46:51,005 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1373 transitions. Word has length 22 [2020-02-10 19:46:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:51,005 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1373 transitions. [2020-02-10 19:46:51,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1373 transitions. [2020-02-10 19:46:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:51,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:51,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:51,006 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 19:46:51,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:51,006 INFO L82 PathProgramCache]: Analyzing trace with hash -472239172, now seen corresponding path program 438 times [2020-02-10 19:46:51,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:51,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401705256] [2020-02-10 19:46:51,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:51,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401705256] [2020-02-10 19:46:51,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:51,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:51,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142293080] [2020-02-10 19:46:51,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:51,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:51,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:51,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:51,277 INFO L87 Difference]: Start difference. First operand 399 states and 1373 transitions. Second operand 9 states. [2020-02-10 19:46:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:51,386 INFO L93 Difference]: Finished difference Result 677 states and 2001 transitions. [2020-02-10 19:46:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:51,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:51,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:51,388 INFO L225 Difference]: With dead ends: 677 [2020-02-10 19:46:51,388 INFO L226 Difference]: Without dead ends: 657 [2020-02-10 19:46:51,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 19:46:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-02-10 19:46:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 393. [2020-02-10 19:46:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:46:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1361 transitions. [2020-02-10 19:46:51,400 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1361 transitions. Word has length 22 [2020-02-10 19:46:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:51,400 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1361 transitions. [2020-02-10 19:46:51,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1361 transitions. [2020-02-10 19:46:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:51,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:51,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 19:46:51,401 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 19:46:51,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1951021810, now seen corresponding path program 439 times [2020-02-10 19:46:51,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:51,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651890653] [2020-02-10 19:46:51,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:51,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 19:46:51,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651890653] [2020-02-10 19:46:51,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:51,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:51,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564915879] [2020-02-10 19:46:51,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:51,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:51,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:51,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:51,684 INFO L87 Difference]: Start difference. First operand 393 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:46:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:51,765 INFO L93 Difference]: Finished difference Result 678 states and 2006 transitions. [2020-02-10 19:46:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:51,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:51,767 INFO L225 Difference]: With dead ends: 678 [2020-02-10 19:46:51,767 INFO L226 Difference]: Without dead ends: 662 [2020-02-10 19:46:51,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-02-10 19:46:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 399. [2020-02-10 19:46:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:46:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1375 transitions. [2020-02-10 19:46:51,777 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1375 transitions. Word has length 22 [2020-02-10 19:46:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:51,777 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1375 transitions. [2020-02-10 19:46:51,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1375 transitions. [2020-02-10 19:46:51,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:51,778 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:51,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 19:46:51,778 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 19:46:51,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:51,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2077658184, now seen corresponding path program 440 times [2020-02-10 19:46:51,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:51,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023839116] [2020-02-10 19:46:51,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:52,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 19:46:52,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023839116] [2020-02-10 19:46:52,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:52,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:52,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967546061] [2020-02-10 19:46:52,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:52,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:52,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:52,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:52,054 INFO L87 Difference]: Start difference. First operand 399 states and 1375 transitions. Second operand 9 states. [2020-02-10 19:46:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:52,164 INFO L93 Difference]: Finished difference Result 672 states and 1992 transitions. [2020-02-10 19:46:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:52,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:52,166 INFO L225 Difference]: With dead ends: 672 [2020-02-10 19:46:52,166 INFO L226 Difference]: Without dead ends: 659 [2020-02-10 19:46:52,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 19:46:52,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-02-10 19:46:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 396. [2020-02-10 19:46:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:46:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1368 transitions. [2020-02-10 19:46:52,177 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1368 transitions. Word has length 22 [2020-02-10 19:46:52,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:52,177 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1368 transitions. [2020-02-10 19:46:52,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1368 transitions. [2020-02-10 19:46:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:52,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:52,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 19:46:52,178 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 19:46:52,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:52,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1808715684, now seen corresponding path program 441 times [2020-02-10 19:46:52,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:52,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803435912] [2020-02-10 19:46:52,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:52,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 19:46:52,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803435912] [2020-02-10 19:46:52,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:52,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:52,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580853623] [2020-02-10 19:46:52,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:52,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:52,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:52,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:52,472 INFO L87 Difference]: Start difference. First operand 396 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:46:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:52,554 INFO L93 Difference]: Finished difference Result 684 states and 2018 transitions. [2020-02-10 19:46:52,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:52,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:52,556 INFO L225 Difference]: With dead ends: 684 [2020-02-10 19:46:52,556 INFO L226 Difference]: Without dead ends: 668 [2020-02-10 19:46:52,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-02-10 19:46:52,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 402. [2020-02-10 19:46:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 19:46:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1378 transitions. [2020-02-10 19:46:52,566 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1378 transitions. Word has length 22 [2020-02-10 19:46:52,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:52,567 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1378 transitions. [2020-02-10 19:46:52,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:52,567 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1378 transitions. [2020-02-10 19:46:52,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:52,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:52,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:52,567 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 19:46:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:52,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1062284758, now seen corresponding path program 442 times [2020-02-10 19:46:52,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:52,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146159484] [2020-02-10 19:46:52,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:52,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 19:46:52,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146159484] [2020-02-10 19:46:52,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:52,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:52,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677070073] [2020-02-10 19:46:52,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:52,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:52,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:52,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:52,850 INFO L87 Difference]: Start difference. First operand 402 states and 1378 transitions. Second operand 9 states. [2020-02-10 19:46:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:52,963 INFO L93 Difference]: Finished difference Result 681 states and 2007 transitions. [2020-02-10 19:46:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:52,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:52,966 INFO L225 Difference]: With dead ends: 681 [2020-02-10 19:46:52,966 INFO L226 Difference]: Without dead ends: 662 [2020-02-10 19:46:52,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 19:46:52,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-02-10 19:46:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 396. [2020-02-10 19:46:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:46:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1365 transitions. [2020-02-10 19:46:52,979 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1365 transitions. Word has length 22 [2020-02-10 19:46:52,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:52,979 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1365 transitions. [2020-02-10 19:46:52,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1365 transitions. [2020-02-10 19:46:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:52,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:52,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 19:46:52,980 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 19:46:52,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash 466717226, now seen corresponding path program 443 times [2020-02-10 19:46:52,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:52,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091505961] [2020-02-10 19:46:52,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:53,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 19:46:53,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091505961] [2020-02-10 19:46:53,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:53,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:53,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783167498] [2020-02-10 19:46:53,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:53,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:53,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:53,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:53,271 INFO L87 Difference]: Start difference. First operand 396 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:46:53,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:53,402 INFO L93 Difference]: Finished difference Result 668 states and 1982 transitions. [2020-02-10 19:46:53,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:53,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:53,403 INFO L225 Difference]: With dead ends: 668 [2020-02-10 19:46:53,403 INFO L226 Difference]: Without dead ends: 658 [2020-02-10 19:46:53,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 19:46:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-02-10 19:46:53,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 398. [2020-02-10 19:46:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:46:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1368 transitions. [2020-02-10 19:46:53,414 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1368 transitions. Word has length 22 [2020-02-10 19:46:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:53,415 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1368 transitions. [2020-02-10 19:46:53,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:53,415 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1368 transitions. [2020-02-10 19:46:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:53,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:53,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 19:46:53,415 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 19:46:53,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:53,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1038172032, now seen corresponding path program 444 times [2020-02-10 19:46:53,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:53,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962203098] [2020-02-10 19:46:53,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:53,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 19:46:53,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962203098] [2020-02-10 19:46:53,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:53,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:53,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968434766] [2020-02-10 19:46:53,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:53,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:53,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:53,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:53,705 INFO L87 Difference]: Start difference. First operand 398 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:46:53,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:53,820 INFO L93 Difference]: Finished difference Result 671 states and 1986 transitions. [2020-02-10 19:46:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:53,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:53,822 INFO L225 Difference]: With dead ends: 671 [2020-02-10 19:46:53,822 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 19:46:53,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 19:46:53,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 19:46:53,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 393. [2020-02-10 19:46:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:46:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1358 transitions. [2020-02-10 19:46:53,833 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1358 transitions. Word has length 22 [2020-02-10 19:46:53,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:53,833 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1358 transitions. [2020-02-10 19:46:53,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1358 transitions. [2020-02-10 19:46:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:53,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:53,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 19:46:53,834 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 19:46:53,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:53,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1877500082, now seen corresponding path program 445 times [2020-02-10 19:46:53,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:53,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726716387] [2020-02-10 19:46:53,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:54,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 19:46:54,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726716387] [2020-02-10 19:46:54,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:54,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:54,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470219461] [2020-02-10 19:46:54,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:54,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:54,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:54,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:54,140 INFO L87 Difference]: Start difference. First operand 393 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:46:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:54,235 INFO L93 Difference]: Finished difference Result 704 states and 2069 transitions. [2020-02-10 19:46:54,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:54,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:54,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:54,237 INFO L225 Difference]: With dead ends: 704 [2020-02-10 19:46:54,237 INFO L226 Difference]: Without dead ends: 688 [2020-02-10 19:46:54,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 19:46:54,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2020-02-10 19:46:54,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 409. [2020-02-10 19:46:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-02-10 19:46:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1396 transitions. [2020-02-10 19:46:54,248 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1396 transitions. Word has length 22 [2020-02-10 19:46:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:54,248 INFO L479 AbstractCegarLoop]: Abstraction has 409 states and 1396 transitions. [2020-02-10 19:46:54,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1396 transitions. [2020-02-10 19:46:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:54,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:54,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 19:46:54,249 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 19:46:54,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:54,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1228054490, now seen corresponding path program 446 times [2020-02-10 19:46:54,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:54,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390277729] [2020-02-10 19:46:54,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46: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 19:46:54,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390277729] [2020-02-10 19:46:54,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:54,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:54,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599263353] [2020-02-10 19:46:54,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:54,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:54,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:54,552 INFO L87 Difference]: Start difference. First operand 409 states and 1396 transitions. Second operand 9 states. [2020-02-10 19:46:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:54,660 INFO L93 Difference]: Finished difference Result 702 states and 2059 transitions. [2020-02-10 19:46:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:54,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:54,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:54,662 INFO L225 Difference]: With dead ends: 702 [2020-02-10 19:46:54,662 INFO L226 Difference]: Without dead ends: 680 [2020-02-10 19:46:54,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 19:46:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-02-10 19:46:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 401. [2020-02-10 19:46:54,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 19:46:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1376 transitions. [2020-02-10 19:46:54,673 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1376 transitions. Word has length 22 [2020-02-10 19:46:54,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:54,673 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1376 transitions. [2020-02-10 19:46:54,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1376 transitions. [2020-02-10 19:46:54,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:54,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:54,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 19:46:54,674 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 19:46:54,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:54,674 INFO L82 PathProgramCache]: Analyzing trace with hash 804414702, now seen corresponding path program 447 times [2020-02-10 19:46:54,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:54,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490574289] [2020-02-10 19:46:54,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:54,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 19:46:54,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490574289] [2020-02-10 19:46:54,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:54,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:54,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724291453] [2020-02-10 19:46:54,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:54,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:54,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:54,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:54,974 INFO L87 Difference]: Start difference. First operand 401 states and 1376 transitions. Second operand 9 states. [2020-02-10 19:46:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:55,054 INFO L93 Difference]: Finished difference Result 701 states and 2056 transitions. [2020-02-10 19:46:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:55,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:55,056 INFO L225 Difference]: With dead ends: 701 [2020-02-10 19:46:55,056 INFO L226 Difference]: Without dead ends: 685 [2020-02-10 19:46:55,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 19:46:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2020-02-10 19:46:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 407. [2020-02-10 19:46:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-02-10 19:46:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1386 transitions. [2020-02-10 19:46:55,071 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1386 transitions. Word has length 22 [2020-02-10 19:46:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:55,072 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 1386 transitions. [2020-02-10 19:46:55,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1386 transitions. [2020-02-10 19:46:55,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:55,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:55,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 19:46:55,072 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 19:46:55,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:55,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1550845628, now seen corresponding path program 448 times [2020-02-10 19:46:55,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:55,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164843599] [2020-02-10 19:46:55,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:55,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 19:46:55,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164843599] [2020-02-10 19:46:55,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:55,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:55,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120242772] [2020-02-10 19:46:55,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:55,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:55,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:55,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:55,366 INFO L87 Difference]: Start difference. First operand 407 states and 1386 transitions. Second operand 9 states. [2020-02-10 19:46:55,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:55,473 INFO L93 Difference]: Finished difference Result 698 states and 2045 transitions. [2020-02-10 19:46:55,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:55,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:55,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:55,475 INFO L225 Difference]: With dead ends: 698 [2020-02-10 19:46:55,475 INFO L226 Difference]: Without dead ends: 679 [2020-02-10 19:46:55,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 19:46:55,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2020-02-10 19:46:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 401. [2020-02-10 19:46:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 19:46:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1370 transitions. [2020-02-10 19:46:55,485 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1370 transitions. Word has length 22 [2020-02-10 19:46:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:55,485 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1370 transitions. [2020-02-10 19:46:55,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1370 transitions. [2020-02-10 19:46:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:55,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:55,486 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:55,486 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 19:46:55,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:55,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1377366140, now seen corresponding path program 449 times [2020-02-10 19:46:55,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:55,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370139049] [2020-02-10 19:46:55,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:55,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 19:46:55,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370139049] [2020-02-10 19:46:55,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:55,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:55,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408639974] [2020-02-10 19:46:55,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:55,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:55,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:55,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:55,777 INFO L87 Difference]: Start difference. First operand 401 states and 1370 transitions. Second operand 9 states. [2020-02-10 19:46:55,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:55,884 INFO L93 Difference]: Finished difference Result 696 states and 2042 transitions. [2020-02-10 19:46:55,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:55,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:55,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:55,886 INFO L225 Difference]: With dead ends: 696 [2020-02-10 19:46:55,886 INFO L226 Difference]: Without dead ends: 682 [2020-02-10 19:46:55,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:55,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2020-02-10 19:46:55,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 406. [2020-02-10 19:46:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-02-10 19:46:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1379 transitions. [2020-02-10 19:46:55,897 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1379 transitions. Word has length 22 [2020-02-10 19:46:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:55,897 INFO L479 AbstractCegarLoop]: Abstraction has 406 states and 1379 transitions. [2020-02-10 19:46:55,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1379 transitions. [2020-02-10 19:46:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:55,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:55,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 19:46:55,898 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 19:46:55,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:55,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1321954880, now seen corresponding path program 450 times [2020-02-10 19:46:55,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:55,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387167432] [2020-02-10 19:46:55,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:56,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 19:46:56,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387167432] [2020-02-10 19:46:56,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:56,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:56,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619607794] [2020-02-10 19:46:56,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:56,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:56,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:56,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:56,189 INFO L87 Difference]: Start difference. First operand 406 states and 1379 transitions. Second operand 9 states. [2020-02-10 19:46:56,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:56,303 INFO L93 Difference]: Finished difference Result 695 states and 2035 transitions. [2020-02-10 19:46:56,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:56,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:56,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:56,305 INFO L225 Difference]: With dead ends: 695 [2020-02-10 19:46:56,305 INFO L226 Difference]: Without dead ends: 669 [2020-02-10 19:46:56,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:56,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2020-02-10 19:46:56,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 393. [2020-02-10 19:46:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:46:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1353 transitions. [2020-02-10 19:46:56,315 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1353 transitions. Word has length 22 [2020-02-10 19:46:56,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:56,315 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1353 transitions. [2020-02-10 19:46:56,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1353 transitions. [2020-02-10 19:46:56,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:56,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:56,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 19:46:56,316 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 19:46:56,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:56,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2046148872, now seen corresponding path program 451 times [2020-02-10 19:46:56,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:56,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746998044] [2020-02-10 19:46:56,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:56,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 19:46:56,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746998044] [2020-02-10 19:46:56,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:56,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:56,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087781759] [2020-02-10 19:46:56,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:56,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:56,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:56,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:56,596 INFO L87 Difference]: Start difference. First operand 393 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:46:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:56,706 INFO L93 Difference]: Finished difference Result 664 states and 1972 transitions. [2020-02-10 19:46:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:56,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:56,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:56,708 INFO L225 Difference]: With dead ends: 664 [2020-02-10 19:46:56,708 INFO L226 Difference]: Without dead ends: 654 [2020-02-10 19:46:56,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 19:46:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2020-02-10 19:46:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 397. [2020-02-10 19:46:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:46:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1363 transitions. [2020-02-10 19:46:56,718 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1363 transitions. Word has length 22 [2020-02-10 19:46:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:56,718 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1363 transitions. [2020-02-10 19:46:56,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:56,718 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1363 transitions. [2020-02-10 19:46:56,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:56,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:56,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 19:46:56,719 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 19:46:56,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:56,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1128198682, now seen corresponding path program 452 times [2020-02-10 19:46:56,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:56,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059581674] [2020-02-10 19:46:56,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:56,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 19:46:56,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059581674] [2020-02-10 19:46:56,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:56,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:56,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359723589] [2020-02-10 19:46:56,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:56,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:56,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:56,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:56,992 INFO L87 Difference]: Start difference. First operand 397 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:46:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:57,100 INFO L93 Difference]: Finished difference Result 668 states and 1978 transitions. [2020-02-10 19:46:57,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:57,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:57,102 INFO L225 Difference]: With dead ends: 668 [2020-02-10 19:46:57,102 INFO L226 Difference]: Without dead ends: 652 [2020-02-10 19:46:57,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-02-10 19:46:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 395. [2020-02-10 19:46:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:46:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1358 transitions. [2020-02-10 19:46:57,111 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1358 transitions. Word has length 22 [2020-02-10 19:46:57,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:57,111 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1358 transitions. [2020-02-10 19:46:57,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:57,111 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1358 transitions. [2020-02-10 19:46:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:57,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:57,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 19:46:57,112 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 19:46:57,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:57,112 INFO L82 PathProgramCache]: Analyzing trace with hash 973063492, now seen corresponding path program 453 times [2020-02-10 19:46:57,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:57,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928503841] [2020-02-10 19:46:57,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:57,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 19:46:57,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928503841] [2020-02-10 19:46:57,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:57,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:57,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541241519] [2020-02-10 19:46:57,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:57,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:57,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:57,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:57,390 INFO L87 Difference]: Start difference. First operand 395 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:46:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:57,518 INFO L93 Difference]: Finished difference Result 663 states and 1968 transitions. [2020-02-10 19:46:57,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:57,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:57,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:57,520 INFO L225 Difference]: With dead ends: 663 [2020-02-10 19:46:57,520 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 19:46:57,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 19:46:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 19:46:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 397. [2020-02-10 19:46:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:46:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1361 transitions. [2020-02-10 19:46:57,531 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1361 transitions. Word has length 22 [2020-02-10 19:46:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:57,531 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1361 transitions. [2020-02-10 19:46:57,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1361 transitions. [2020-02-10 19:46:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:57,531 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:57,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 19:46:57,532 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 19:46:57,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:57,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1544518298, now seen corresponding path program 454 times [2020-02-10 19:46:57,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:57,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443925743] [2020-02-10 19:46:57,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:57,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 19:46:57,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443925743] [2020-02-10 19:46:57,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:57,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:57,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436048736] [2020-02-10 19:46:57,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:57,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:57,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:57,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:57,810 INFO L87 Difference]: Start difference. First operand 397 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:46:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:57,924 INFO L93 Difference]: Finished difference Result 666 states and 1972 transitions. [2020-02-10 19:46:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:57,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:57,926 INFO L225 Difference]: With dead ends: 666 [2020-02-10 19:46:57,926 INFO L226 Difference]: Without dead ends: 651 [2020-02-10 19:46:57,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 19:46:57,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2020-02-10 19:46:57,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 395. [2020-02-10 19:46:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:46:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1356 transitions. [2020-02-10 19:46:57,936 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1356 transitions. Word has length 22 [2020-02-10 19:46:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:57,936 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1356 transitions. [2020-02-10 19:46:57,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1356 transitions. [2020-02-10 19:46:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:57,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:57,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 19:46:57,937 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 19:46:57,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:57,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1663428484, now seen corresponding path program 455 times [2020-02-10 19:46:57,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:57,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989583241] [2020-02-10 19:46:57,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:58,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989583241] [2020-02-10 19:46:58,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:58,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:58,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50807954] [2020-02-10 19:46:58,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:58,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:58,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:58,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:58,217 INFO L87 Difference]: Start difference. First operand 395 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:46:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:58,328 INFO L93 Difference]: Finished difference Result 674 states and 1991 transitions. [2020-02-10 19:46:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:58,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:58,330 INFO L225 Difference]: With dead ends: 674 [2020-02-10 19:46:58,330 INFO L226 Difference]: Without dead ends: 660 [2020-02-10 19:46:58,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:58,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2020-02-10 19:46:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 400. [2020-02-10 19:46:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 19:46:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1365 transitions. [2020-02-10 19:46:58,340 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1365 transitions. Word has length 22 [2020-02-10 19:46:58,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:58,341 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1365 transitions. [2020-02-10 19:46:58,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1365 transitions. [2020-02-10 19:46:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:58,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:58,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 19:46:58,341 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 19:46:58,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:58,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1142133816, now seen corresponding path program 456 times [2020-02-10 19:46:58,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:58,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110761941] [2020-02-10 19:46:58,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:58,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110761941] [2020-02-10 19:46:58,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:58,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:58,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147228979] [2020-02-10 19:46:58,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:58,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:58,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:58,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:58,631 INFO L87 Difference]: Start difference. First operand 400 states and 1365 transitions. Second operand 9 states. [2020-02-10 19:46:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:58,753 INFO L93 Difference]: Finished difference Result 673 states and 1984 transitions. [2020-02-10 19:46:58,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:58,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:58,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:58,756 INFO L225 Difference]: With dead ends: 673 [2020-02-10 19:46:58,756 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 19:46:58,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 19:46:58,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 19:46:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 388. [2020-02-10 19:46:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:46:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-02-10 19:46:58,765 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-02-10 19:46:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:58,766 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-02-10 19:46:58,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-02-10 19:46:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:58,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:58,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 19:46:58,767 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 19:46:58,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:58,767 INFO L82 PathProgramCache]: Analyzing trace with hash -780259124, now seen corresponding path program 457 times [2020-02-10 19:46:58,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:58,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571866438] [2020-02-10 19:46:58,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:59,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 19:46:59,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571866438] [2020-02-10 19:46:59,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:59,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:59,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38164963] [2020-02-10 19:46:59,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:59,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:59,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:59,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:59,041 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:46:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:59,151 INFO L93 Difference]: Finished difference Result 633 states and 1903 transitions. [2020-02-10 19:46:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:59,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:59,153 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:46:59,153 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 19:46:59,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 19:46:59,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 19:46:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 394. [2020-02-10 19:46:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:46:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1361 transitions. [2020-02-10 19:46:59,163 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1361 transitions. Word has length 22 [2020-02-10 19:46:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:59,163 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1361 transitions. [2020-02-10 19:46:59,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1361 transitions. [2020-02-10 19:46:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:59,164 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:59,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 19:46:59,164 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 19:46:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash 561673664, now seen corresponding path program 458 times [2020-02-10 19:46:59,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:59,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897060923] [2020-02-10 19:46:59,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46: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 19:46:59,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897060923] [2020-02-10 19:46:59,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:59,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:59,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77164653] [2020-02-10 19:46:59,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:59,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:59,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:59,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:59,433 INFO L87 Difference]: Start difference. First operand 394 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:46:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:59,564 INFO L93 Difference]: Finished difference Result 632 states and 1899 transitions. [2020-02-10 19:46:59,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:59,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:59,566 INFO L225 Difference]: With dead ends: 632 [2020-02-10 19:46:59,566 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 19:46:59,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 19:46:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 392. [2020-02-10 19:46:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:46:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1356 transitions. [2020-02-10 19:46:59,577 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1356 transitions. Word has length 22 [2020-02-10 19:46:59,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:59,577 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1356 transitions. [2020-02-10 19:46:59,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1356 transitions. [2020-02-10 19:46:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:59,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:59,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 19:46:59,578 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 19:46:59,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:59,578 INFO L82 PathProgramCache]: Analyzing trace with hash 828056058, now seen corresponding path program 459 times [2020-02-10 19:46:59,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:59,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619331263] [2020-02-10 19:46:59,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:59,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 19:46:59,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619331263] [2020-02-10 19:46:59,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:59,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:46:59,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649621154] [2020-02-10 19:46:59,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:46:59,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:59,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:46:59,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:59,854 INFO L87 Difference]: Start difference. First operand 392 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:46:59,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:59,964 INFO L93 Difference]: Finished difference Result 638 states and 1912 transitions. [2020-02-10 19:46:59,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:46:59,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:46:59,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:59,966 INFO L225 Difference]: With dead ends: 638 [2020-02-10 19:46:59,966 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 19:46:59,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 19:46:59,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 19:46:59,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 395. [2020-02-10 19:46:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:46:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1361 transitions. [2020-02-10 19:46:59,976 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1361 transitions. Word has length 22 [2020-02-10 19:46:59,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:59,976 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1361 transitions. [2020-02-10 19:46:59,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:46:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1361 transitions. [2020-02-10 19:46:59,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:46:59,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:59,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 19:46:59,977 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 19:46:59,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:59,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1694616042, now seen corresponding path program 460 times [2020-02-10 19:46:59,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:59,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388243106] [2020-02-10 19:46:59,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:00,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388243106] [2020-02-10 19:47:00,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:00,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:00,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114524333] [2020-02-10 19:47:00,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:00,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:00,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:00,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:00,317 INFO L87 Difference]: Start difference. First operand 395 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:47:00,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:00,422 INFO L93 Difference]: Finished difference Result 641 states and 1915 transitions. [2020-02-10 19:47:00,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:00,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:00,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:00,424 INFO L225 Difference]: With dead ends: 641 [2020-02-10 19:47:00,425 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 19:47:00,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 19:47:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 19:47:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 392. [2020-02-10 19:47:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-02-10 19:47:00,435 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-02-10 19:47:00,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:00,435 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-02-10 19:47:00,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:00,435 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-02-10 19:47:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:00,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:00,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 19:47:00,436 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 19:47:00,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:00,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1096903466, now seen corresponding path program 461 times [2020-02-10 19:47:00,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:00,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743749803] [2020-02-10 19:47:00,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47: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 19:47:00,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743749803] [2020-02-10 19:47:00,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:00,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:00,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060831183] [2020-02-10 19:47:00,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:00,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:00,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:00,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:00,697 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:47:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:00,823 INFO L93 Difference]: Finished difference Result 635 states and 1903 transitions. [2020-02-10 19:47:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:00,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:00,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:00,825 INFO L225 Difference]: With dead ends: 635 [2020-02-10 19:47:00,825 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 19:47:00,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 19:47:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 19:47:00,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 394. [2020-02-10 19:47:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1357 transitions. [2020-02-10 19:47:00,836 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1357 transitions. Word has length 22 [2020-02-10 19:47:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:00,836 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1357 transitions. [2020-02-10 19:47:00,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1357 transitions. [2020-02-10 19:47:00,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:00,836 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:00,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 19:47:00,837 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 19:47:00,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:00,837 INFO L82 PathProgramCache]: Analyzing trace with hash 178953276, now seen corresponding path program 462 times [2020-02-10 19:47:00,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:00,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876112358] [2020-02-10 19:47:00,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:01,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 19:47:01,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876112358] [2020-02-10 19:47:01,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:01,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:01,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375154998] [2020-02-10 19:47:01,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:01,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:01,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:01,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:01,102 INFO L87 Difference]: Start difference. First operand 394 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:47:01,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:01,220 INFO L93 Difference]: Finished difference Result 639 states and 1909 transitions. [2020-02-10 19:47:01,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:01,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:01,222 INFO L225 Difference]: With dead ends: 639 [2020-02-10 19:47:01,222 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 19:47:01,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 19:47:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 19:47:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 390. [2020-02-10 19:47:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-02-10 19:47:01,232 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-02-10 19:47:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:01,232 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-02-10 19:47:01,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-02-10 19:47:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:01,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:01,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:01,233 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 19:47:01,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:01,233 INFO L82 PathProgramCache]: Analyzing trace with hash 313832464, now seen corresponding path program 463 times [2020-02-10 19:47:01,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:01,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649044157] [2020-02-10 19:47:01,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:01,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:01,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649044157] [2020-02-10 19:47:01,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:01,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:01,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670390584] [2020-02-10 19:47:01,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:01,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:01,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:01,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:01,527 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:47:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:01,647 INFO L93 Difference]: Finished difference Result 632 states and 1899 transitions. [2020-02-10 19:47:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:01,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:01,649 INFO L225 Difference]: With dead ends: 632 [2020-02-10 19:47:01,649 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 19:47:01,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 19:47:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 19:47:01,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 394. [2020-02-10 19:47:01,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:01,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1359 transitions. [2020-02-10 19:47:01,660 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1359 transitions. Word has length 22 [2020-02-10 19:47:01,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:01,660 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1359 transitions. [2020-02-10 19:47:01,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:01,661 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1359 transitions. [2020-02-10 19:47:01,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:01,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:01,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 19:47:01,661 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 19:47:01,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:01,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1655765252, now seen corresponding path program 464 times [2020-02-10 19:47:01,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:01,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648761495] [2020-02-10 19:47:01,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:01,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 19:47:01,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648761495] [2020-02-10 19:47:01,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:01,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:01,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794897667] [2020-02-10 19:47:01,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:01,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:01,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:01,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:01,929 INFO L87 Difference]: Start difference. First operand 394 states and 1359 transitions. Second operand 9 states. [2020-02-10 19:47:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:02,036 INFO L93 Difference]: Finished difference Result 631 states and 1895 transitions. [2020-02-10 19:47:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:02,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:02,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:02,038 INFO L225 Difference]: With dead ends: 631 [2020-02-10 19:47:02,038 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 19:47:02,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 19:47:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 19:47:02,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 392. [2020-02-10 19:47:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-02-10 19:47:02,048 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-02-10 19:47:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:02,049 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-02-10 19:47:02,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-02-10 19:47:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:02,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:02,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 19:47:02,049 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 19:47:02,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:02,050 INFO L82 PathProgramCache]: Analyzing trace with hash 849062266, now seen corresponding path program 465 times [2020-02-10 19:47:02,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:02,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636167518] [2020-02-10 19:47:02,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:02,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 19:47:02,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636167518] [2020-02-10 19:47:02,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:02,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:02,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310366672] [2020-02-10 19:47:02,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:02,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:02,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:02,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:02,318 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:47:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:02,426 INFO L93 Difference]: Finished difference Result 636 states and 1906 transitions. [2020-02-10 19:47:02,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:02,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:02,428 INFO L225 Difference]: With dead ends: 636 [2020-02-10 19:47:02,429 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 19:47:02,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 19:47:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 19:47:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 395. [2020-02-10 19:47:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:47:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1359 transitions. [2020-02-10 19:47:02,439 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1359 transitions. Word has length 22 [2020-02-10 19:47:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:02,439 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1359 transitions. [2020-02-10 19:47:02,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1359 transitions. [2020-02-10 19:47:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:02,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:02,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 19:47:02,440 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 19:47:02,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:02,440 INFO L82 PathProgramCache]: Analyzing trace with hash 620673258, now seen corresponding path program 466 times [2020-02-10 19:47:02,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:02,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201722042] [2020-02-10 19:47:02,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:02,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 19:47:02,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201722042] [2020-02-10 19:47:02,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:02,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:02,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341435370] [2020-02-10 19:47:02,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:02,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:02,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:02,707 INFO L87 Difference]: Start difference. First operand 395 states and 1359 transitions. Second operand 9 states. [2020-02-10 19:47:02,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:02,818 INFO L93 Difference]: Finished difference Result 638 states and 1907 transitions. [2020-02-10 19:47:02,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:02,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:02,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:02,820 INFO L225 Difference]: With dead ends: 638 [2020-02-10 19:47:02,820 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 19:47:02,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 19:47:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 19:47:02,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 392. [2020-02-10 19:47:02,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:02,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1352 transitions. [2020-02-10 19:47:02,830 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1352 transitions. Word has length 22 [2020-02-10 19:47:02,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:02,830 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1352 transitions. [2020-02-10 19:47:02,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1352 transitions. [2020-02-10 19:47:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:02,831 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:02,831 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:02,831 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 19:47:02,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:02,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1117909674, now seen corresponding path program 467 times [2020-02-10 19:47:02,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:02,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421175940] [2020-02-10 19:47:02,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:03,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 19:47:03,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421175940] [2020-02-10 19:47:03,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:03,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:03,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155109410] [2020-02-10 19:47:03,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:03,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:03,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:03,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:03,103 INFO L87 Difference]: Start difference. First operand 392 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:47:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:03,212 INFO L93 Difference]: Finished difference Result 633 states and 1897 transitions. [2020-02-10 19:47:03,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:03,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:03,214 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:47:03,214 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 19:47:03,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 19:47:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 394. [2020-02-10 19:47:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1355 transitions. [2020-02-10 19:47:03,224 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1355 transitions. Word has length 22 [2020-02-10 19:47:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:03,224 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1355 transitions. [2020-02-10 19:47:03,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1355 transitions. [2020-02-10 19:47:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:03,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:03,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 19:47:03,225 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 19:47:03,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:03,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1689364480, now seen corresponding path program 468 times [2020-02-10 19:47:03,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:03,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163335374] [2020-02-10 19:47:03,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:03,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 19:47:03,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163335374] [2020-02-10 19:47:03,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:03,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:03,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845808282] [2020-02-10 19:47:03,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:03,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:03,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:03,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:03,495 INFO L87 Difference]: Start difference. First operand 394 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:47:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:03,608 INFO L93 Difference]: Finished difference Result 636 states and 1901 transitions. [2020-02-10 19:47:03,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:03,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:03,610 INFO L225 Difference]: With dead ends: 636 [2020-02-10 19:47:03,611 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 19:47:03,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 19:47:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 19:47:03,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 390. [2020-02-10 19:47:03,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1347 transitions. [2020-02-10 19:47:03,620 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1347 transitions. Word has length 22 [2020-02-10 19:47:03,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:03,621 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1347 transitions. [2020-02-10 19:47:03,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:03,621 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1347 transitions. [2020-02-10 19:47:03,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:03,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:03,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 19:47:03,621 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 19:47:03,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:03,622 INFO L82 PathProgramCache]: Analyzing trace with hash 240310736, now seen corresponding path program 469 times [2020-02-10 19:47:03,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:03,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687230557] [2020-02-10 19:47:03,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:03,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 19:47:03,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687230557] [2020-02-10 19:47:03,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:03,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:03,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982251650] [2020-02-10 19:47:03,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:03,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:03,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:03,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:03,893 INFO L87 Difference]: Start difference. First operand 390 states and 1347 transitions. Second operand 9 states. [2020-02-10 19:47:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:04,001 INFO L93 Difference]: Finished difference Result 646 states and 1932 transitions. [2020-02-10 19:47:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:04,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:04,003 INFO L225 Difference]: With dead ends: 646 [2020-02-10 19:47:04,003 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 19:47:04,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 19:47:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 19:47:04,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 396. [2020-02-10 19:47:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:47:04,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1363 transitions. [2020-02-10 19:47:04,013 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1363 transitions. Word has length 22 [2020-02-10 19:47:04,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:04,013 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1363 transitions. [2020-02-10 19:47:04,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1363 transitions. [2020-02-10 19:47:04,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:04,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:04,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 19:47:04,014 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 19:47:04,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:04,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1106870720, now seen corresponding path program 470 times [2020-02-10 19:47:04,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:04,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872980510] [2020-02-10 19:47:04,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:04,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 19:47:04,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872980510] [2020-02-10 19:47:04,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:04,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:04,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507167828] [2020-02-10 19:47:04,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:04,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:04,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:04,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:04,291 INFO L87 Difference]: Start difference. First operand 396 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:47:04,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:04,410 INFO L93 Difference]: Finished difference Result 649 states and 1935 transitions. [2020-02-10 19:47:04,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:04,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:04,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:04,412 INFO L225 Difference]: With dead ends: 649 [2020-02-10 19:47:04,412 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 19:47:04,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 19:47:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 19:47:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 393. [2020-02-10 19:47:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:47:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1355 transitions. [2020-02-10 19:47:04,422 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1355 transitions. Word has length 22 [2020-02-10 19:47:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:04,422 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1355 transitions. [2020-02-10 19:47:04,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1355 transitions. [2020-02-10 19:47:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:04,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:04,423 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:04,423 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 19:47:04,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:04,424 INFO L82 PathProgramCache]: Analyzing trace with hash -832774644, now seen corresponding path program 471 times [2020-02-10 19:47:04,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:04,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462685385] [2020-02-10 19:47:04,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:04,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 19:47:04,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462685385] [2020-02-10 19:47:04,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:04,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:04,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670842304] [2020-02-10 19:47:04,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:04,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:04,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:04,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:04,693 INFO L87 Difference]: Start difference. First operand 393 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:47:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:04,799 INFO L93 Difference]: Finished difference Result 645 states and 1927 transitions. [2020-02-10 19:47:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:04,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:04,801 INFO L225 Difference]: With dead ends: 645 [2020-02-10 19:47:04,801 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 19:47:04,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 19:47:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 19:47:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 396. [2020-02-10 19:47:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:47:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1360 transitions. [2020-02-10 19:47:04,811 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1360 transitions. Word has length 22 [2020-02-10 19:47:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:04,811 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1360 transitions. [2020-02-10 19:47:04,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1360 transitions. [2020-02-10 19:47:04,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:04,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:04,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 19:47:04,812 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 19:47:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:04,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1061163652, now seen corresponding path program 472 times [2020-02-10 19:47:04,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:04,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959982077] [2020-02-10 19:47:04,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:05,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 19:47:05,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959982077] [2020-02-10 19:47:05,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:05,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:05,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841481150] [2020-02-10 19:47:05,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:05,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:05,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:05,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:05,084 INFO L87 Difference]: Start difference. First operand 396 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:47:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:05,208 INFO L93 Difference]: Finished difference Result 647 states and 1928 transitions. [2020-02-10 19:47:05,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:05,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:05,210 INFO L225 Difference]: With dead ends: 647 [2020-02-10 19:47:05,210 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 19:47:05,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 19:47:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 19:47:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 393. [2020-02-10 19:47:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:47:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1352 transitions. [2020-02-10 19:47:05,226 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1352 transitions. Word has length 22 [2020-02-10 19:47:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:05,226 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1352 transitions. [2020-02-10 19:47:05,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1352 transitions. [2020-02-10 19:47:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:05,227 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:05,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 19:47:05,227 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 19:47:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:05,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1678221232, now seen corresponding path program 473 times [2020-02-10 19:47:05,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:05,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820240514] [2020-02-10 19:47:05,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:05,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 19:47:05,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820240514] [2020-02-10 19:47:05,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:05,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:05,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239316687] [2020-02-10 19:47:05,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:05,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:05,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:05,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:05,495 INFO L87 Difference]: Start difference. First operand 393 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:47:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:05,599 INFO L93 Difference]: Finished difference Result 653 states and 1942 transitions. [2020-02-10 19:47:05,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:05,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:05,601 INFO L225 Difference]: With dead ends: 653 [2020-02-10 19:47:05,601 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 19:47:05,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:05,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 19:47:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 398. [2020-02-10 19:47:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:47:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1361 transitions. [2020-02-10 19:47:05,610 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1361 transitions. Word has length 22 [2020-02-10 19:47:05,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:05,610 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1361 transitions. [2020-02-10 19:47:05,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1361 transitions. [2020-02-10 19:47:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:05,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:05,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 19:47:05,611 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 19:47:05,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:05,611 INFO L82 PathProgramCache]: Analyzing trace with hash 32392076, now seen corresponding path program 474 times [2020-02-10 19:47:05,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:05,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709374784] [2020-02-10 19:47:05,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:05,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 19:47:05,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709374784] [2020-02-10 19:47:05,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:05,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:05,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696559922] [2020-02-10 19:47:05,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:05,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:05,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:05,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:05,880 INFO L87 Difference]: Start difference. First operand 398 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:47:05,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:05,990 INFO L93 Difference]: Finished difference Result 652 states and 1935 transitions. [2020-02-10 19:47:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:05,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:05,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:05,992 INFO L225 Difference]: With dead ends: 652 [2020-02-10 19:47:05,992 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 19:47:05,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 19:47:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 19:47:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 390. [2020-02-10 19:47:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1345 transitions. [2020-02-10 19:47:06,002 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1345 transitions. Word has length 22 [2020-02-10 19:47:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:06,003 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1345 transitions. [2020-02-10 19:47:06,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1345 transitions. [2020-02-10 19:47:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:06,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:06,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 19:47:06,003 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 19:47:06,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:06,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1603249732, now seen corresponding path program 475 times [2020-02-10 19:47:06,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:06,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370110860] [2020-02-10 19:47:06,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:06,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 19:47:06,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370110860] [2020-02-10 19:47:06,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:06,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:06,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63672414] [2020-02-10 19:47:06,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:06,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:06,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:06,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:06,259 INFO L87 Difference]: Start difference. First operand 390 states and 1345 transitions. Second operand 9 states. [2020-02-10 19:47:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:06,368 INFO L93 Difference]: Finished difference Result 639 states and 1911 transitions. [2020-02-10 19:47:06,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:06,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:06,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:06,370 INFO L225 Difference]: With dead ends: 639 [2020-02-10 19:47:06,371 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 19:47:06,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 19:47:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 394. [2020-02-10 19:47:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1355 transitions. [2020-02-10 19:47:06,381 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1355 transitions. Word has length 22 [2020-02-10 19:47:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:06,381 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1355 transitions. [2020-02-10 19:47:06,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1355 transitions. [2020-02-10 19:47:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:06,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:06,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:06,382 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 19:47:06,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:06,382 INFO L82 PathProgramCache]: Analyzing trace with hash 685299542, now seen corresponding path program 476 times [2020-02-10 19:47:06,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:06,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26416703] [2020-02-10 19:47:06,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:06,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 19:47:06,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26416703] [2020-02-10 19:47:06,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:06,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:06,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020754202] [2020-02-10 19:47:06,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:06,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:06,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:06,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:06,638 INFO L87 Difference]: Start difference. First operand 394 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:47:06,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:06,748 INFO L93 Difference]: Finished difference Result 643 states and 1917 transitions. [2020-02-10 19:47:06,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:06,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:06,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:06,750 INFO L225 Difference]: With dead ends: 643 [2020-02-10 19:47:06,750 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 19:47:06,750 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 19:47:06,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 392. [2020-02-10 19:47:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1350 transitions. [2020-02-10 19:47:06,760 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1350 transitions. Word has length 22 [2020-02-10 19:47:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:06,760 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1350 transitions. [2020-02-10 19:47:06,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1350 transitions. [2020-02-10 19:47:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:06,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:06,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 19:47:06,761 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 19:47:06,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:06,761 INFO L82 PathProgramCache]: Analyzing trace with hash 530164352, now seen corresponding path program 477 times [2020-02-10 19:47:06,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:06,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500955372] [2020-02-10 19:47:06,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:07,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 19:47:07,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500955372] [2020-02-10 19:47:07,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:07,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:07,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737558908] [2020-02-10 19:47:07,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:07,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:07,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:07,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:07,029 INFO L87 Difference]: Start difference. First operand 392 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:47:07,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:07,137 INFO L93 Difference]: Finished difference Result 638 states and 1907 transitions. [2020-02-10 19:47:07,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:07,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:07,139 INFO L225 Difference]: With dead ends: 638 [2020-02-10 19:47:07,139 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 19:47:07,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 19:47:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 394. [2020-02-10 19:47:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1353 transitions. [2020-02-10 19:47:07,148 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1353 transitions. Word has length 22 [2020-02-10 19:47:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:07,148 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1353 transitions. [2020-02-10 19:47:07,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1353 transitions. [2020-02-10 19:47:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:07,149 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:07,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:07,149 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 19:47:07,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:07,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1101619158, now seen corresponding path program 478 times [2020-02-10 19:47:07,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:07,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001876894] [2020-02-10 19:47:07,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:07,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 19:47:07,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001876894] [2020-02-10 19:47:07,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:07,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:07,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713606695] [2020-02-10 19:47:07,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:07,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:07,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:07,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:07,415 INFO L87 Difference]: Start difference. First operand 394 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:47:07,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:07,527 INFO L93 Difference]: Finished difference Result 641 states and 1911 transitions. [2020-02-10 19:47:07,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:07,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:07,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:07,529 INFO L225 Difference]: With dead ends: 641 [2020-02-10 19:47:07,529 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 19:47:07,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 19:47:07,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 19:47:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 392. [2020-02-10 19:47:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1348 transitions. [2020-02-10 19:47:07,539 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1348 transitions. Word has length 22 [2020-02-10 19:47:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:07,539 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1348 transitions. [2020-02-10 19:47:07,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1348 transitions. [2020-02-10 19:47:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:07,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:07,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 19:47:07,540 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 19:47:07,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:07,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1220529344, now seen corresponding path program 479 times [2020-02-10 19:47:07,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:07,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123506830] [2020-02-10 19:47:07,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:07,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 19:47:07,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123506830] [2020-02-10 19:47:07,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:07,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:07,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753524066] [2020-02-10 19:47:07,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:07,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:07,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:07,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:07,811 INFO L87 Difference]: Start difference. First operand 392 states and 1348 transitions. Second operand 9 states. [2020-02-10 19:47:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:07,930 INFO L93 Difference]: Finished difference Result 649 states and 1930 transitions. [2020-02-10 19:47:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:07,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:07,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:07,932 INFO L225 Difference]: With dead ends: 649 [2020-02-10 19:47:07,932 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 19:47:07,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 19:47:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 19:47:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 397. [2020-02-10 19:47:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:47:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1357 transitions. [2020-02-10 19:47:07,942 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1357 transitions. Word has length 22 [2020-02-10 19:47:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:07,942 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1357 transitions. [2020-02-10 19:47:07,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1357 transitions. [2020-02-10 19:47:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:07,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:07,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 19:47:07,943 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 19:47:07,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:07,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1585032956, now seen corresponding path program 480 times [2020-02-10 19:47:07,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:07,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495301461] [2020-02-10 19:47:07,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:08,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 19:47:08,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495301461] [2020-02-10 19:47:08,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:08,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:08,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595323646] [2020-02-10 19:47:08,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:08,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:08,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:08,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:08,208 INFO L87 Difference]: Start difference. First operand 397 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:47:08,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:08,322 INFO L93 Difference]: Finished difference Result 648 states and 1923 transitions. [2020-02-10 19:47:08,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:08,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:08,324 INFO L225 Difference]: With dead ends: 648 [2020-02-10 19:47:08,324 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 19:47:08,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 19:47:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 19:47:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 383. [2020-02-10 19:47:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:47:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1332 transitions. [2020-02-10 19:47:08,334 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1332 transitions. Word has length 22 [2020-02-10 19:47:08,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:08,334 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1332 transitions. [2020-02-10 19:47:08,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1332 transitions. [2020-02-10 19:47:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:08,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:08,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 19:47:08,335 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 19:47:08,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:08,335 INFO L82 PathProgramCache]: Analyzing trace with hash -241342128, now seen corresponding path program 481 times [2020-02-10 19:47:08,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:08,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84370339] [2020-02-10 19:47:08,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:08,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 19:47:08,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84370339] [2020-02-10 19:47:08,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:08,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:08,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809477406] [2020-02-10 19:47:08,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:08,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:08,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:08,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:08,643 INFO L87 Difference]: Start difference. First operand 383 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:47:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:08,738 INFO L93 Difference]: Finished difference Result 620 states and 1827 transitions. [2020-02-10 19:47:08,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:08,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:08,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:08,740 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:47:08,740 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 19:47:08,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 19:47:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 19:47:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 394. [2020-02-10 19:47:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1368 transitions. [2020-02-10 19:47:08,750 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1368 transitions. Word has length 22 [2020-02-10 19:47:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:08,751 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1368 transitions. [2020-02-10 19:47:08,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1368 transitions. [2020-02-10 19:47:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:08,751 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:08,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 19:47:08,751 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 19:47:08,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:08,752 INFO L82 PathProgramCache]: Analyzing trace with hash 319726364, now seen corresponding path program 482 times [2020-02-10 19:47:08,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:08,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034562909] [2020-02-10 19:47:08,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:09,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 19:47:09,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034562909] [2020-02-10 19:47:09,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:09,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:09,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833255770] [2020-02-10 19:47:09,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:09,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:09,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:09,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:09,055 INFO L87 Difference]: Start difference. First operand 394 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:47:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:09,135 INFO L93 Difference]: Finished difference Result 613 states and 1812 transitions. [2020-02-10 19:47:09,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:09,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:09,137 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:47:09,137 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:47:09,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 19:47:09,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:47:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 392. [2020-02-10 19:47:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-02-10 19:47:09,147 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-02-10 19:47:09,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:09,147 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-02-10 19:47:09,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-02-10 19:47:09,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:09,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:09,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 19:47:09,148 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 19:47:09,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:09,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1841779982, now seen corresponding path program 483 times [2020-02-10 19:47:09,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:09,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632556571] [2020-02-10 19:47:09,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:09,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 19:47:09,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632556571] [2020-02-10 19:47:09,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:09,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:09,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931854747] [2020-02-10 19:47:09,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:09,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:09,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:09,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:09,466 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:47:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:09,548 INFO L93 Difference]: Finished difference Result 622 states and 1830 transitions. [2020-02-10 19:47:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:09,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:09,550 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:47:09,550 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:47: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 19:47:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:47:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 395. [2020-02-10 19:47:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:47:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1368 transitions. [2020-02-10 19:47:09,559 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1368 transitions. Word has length 22 [2020-02-10 19:47:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:09,559 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1368 transitions. [2020-02-10 19:47:09,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1368 transitions. [2020-02-10 19:47:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:09,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:09,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 19:47:09,560 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 19:47:09,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:09,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1490983652, now seen corresponding path program 484 times [2020-02-10 19:47:09,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:09,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545868562] [2020-02-10 19:47:09,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:09,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 19:47:09,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545868562] [2020-02-10 19:47:09,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:09,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:09,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828035434] [2020-02-10 19:47:09,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:09,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:09,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:09,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:09,880 INFO L87 Difference]: Start difference. First operand 395 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:47:09,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:09,991 INFO L93 Difference]: Finished difference Result 616 states and 1816 transitions. [2020-02-10 19:47:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:09,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:09,993 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:47:09,993 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 19:47:09,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 19:47:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 392. [2020-02-10 19:47:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-02-10 19:47:10,003 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-02-10 19:47:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:10,004 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-02-10 19:47:10,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-02-10 19:47:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:10,004 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:10,004 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:10,004 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 19:47:10,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1787057756, now seen corresponding path program 485 times [2020-02-10 19:47:10,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:10,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257462523] [2020-02-10 19:47:10,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:10,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257462523] [2020-02-10 19:47:10,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:10,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:10,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237077719] [2020-02-10 19:47:10,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:10,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:10,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:10,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:10,324 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:47:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:10,401 INFO L93 Difference]: Finished difference Result 606 states and 1797 transitions. [2020-02-10 19:47:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:10,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:10,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:10,403 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:47:10,404 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 19:47:10,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 19:47:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 19:47:10,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 393. [2020-02-10 19:47:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:47:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1363 transitions. [2020-02-10 19:47:10,413 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1363 transitions. Word has length 22 [2020-02-10 19:47:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:10,413 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1363 transitions. [2020-02-10 19:47:10,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1363 transitions. [2020-02-10 19:47:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:10,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:10,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 19:47:10,414 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 19:47:10,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:10,414 INFO L82 PathProgramCache]: Analyzing trace with hash -176116798, now seen corresponding path program 486 times [2020-02-10 19:47:10,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:10,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51415635] [2020-02-10 19:47:10,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:10,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 19:47:10,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51415635] [2020-02-10 19:47:10,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:10,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:10,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126892658] [2020-02-10 19:47:10,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:10,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:10,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:10,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:10,720 INFO L87 Difference]: Start difference. First operand 393 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:47:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:10,826 INFO L93 Difference]: Finished difference Result 607 states and 1798 transitions. [2020-02-10 19:47:10,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:10,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:10,828 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:47:10,828 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:47:10,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 19:47:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:47:10,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 390. [2020-02-10 19:47:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1358 transitions. [2020-02-10 19:47:10,839 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1358 transitions. Word has length 22 [2020-02-10 19:47:10,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:10,839 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1358 transitions. [2020-02-10 19:47:10,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:10,839 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1358 transitions. [2020-02-10 19:47:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:10,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:10,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 19:47:10,840 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 19:47:10,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:10,840 INFO L82 PathProgramCache]: Analyzing trace with hash -838678786, now seen corresponding path program 487 times [2020-02-10 19:47:10,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:10,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893767747] [2020-02-10 19:47:10,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:11,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 19:47:11,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893767747] [2020-02-10 19:47:11,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:11,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:11,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252084288] [2020-02-10 19:47:11,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:11,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:11,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:11,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:11,134 INFO L87 Difference]: Start difference. First operand 390 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:47:11,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:11,214 INFO L93 Difference]: Finished difference Result 630 states and 1848 transitions. [2020-02-10 19:47:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:11,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:11,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:11,216 INFO L225 Difference]: With dead ends: 630 [2020-02-10 19:47:11,216 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 19:47:11,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 19:47:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 19:47:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 395. [2020-02-10 19:47:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:47:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1368 transitions. [2020-02-10 19:47:11,226 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1368 transitions. Word has length 22 [2020-02-10 19:47:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:11,226 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1368 transitions. [2020-02-10 19:47:11,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1368 transitions. [2020-02-10 19:47:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:11,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:11,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 19:47:11,226 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 19:47:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash -277610294, now seen corresponding path program 488 times [2020-02-10 19:47:11,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:11,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363867946] [2020-02-10 19:47:11,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:11,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 19:47:11,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363867946] [2020-02-10 19:47:11,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:11,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:11,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738493422] [2020-02-10 19:47:11,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:11,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:11,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:11,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:11,516 INFO L87 Difference]: Start difference. First operand 395 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:47:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:11,592 INFO L93 Difference]: Finished difference Result 623 states and 1833 transitions. [2020-02-10 19:47:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:11,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:11,594 INFO L225 Difference]: With dead ends: 623 [2020-02-10 19:47:11,595 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 19:47:11,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 19:47:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 393. [2020-02-10 19:47:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:47:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1364 transitions. [2020-02-10 19:47:11,605 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1364 transitions. Word has length 22 [2020-02-10 19:47:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:11,605 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1364 transitions. [2020-02-10 19:47:11,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:11,605 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1364 transitions. [2020-02-10 19:47:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:11,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:11,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 19:47:11,606 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 19:47:11,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:11,606 INFO L82 PathProgramCache]: Analyzing trace with hash 174013746, now seen corresponding path program 489 times [2020-02-10 19:47:11,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:11,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815310956] [2020-02-10 19:47:11,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:11,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 19:47:11,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815310956] [2020-02-10 19:47:11,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:11,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:11,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277921696] [2020-02-10 19:47:11,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:11,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:11,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:11,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:11,905 INFO L87 Difference]: Start difference. First operand 393 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:47:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:11,990 INFO L93 Difference]: Finished difference Result 641 states and 1872 transitions. [2020-02-10 19:47:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:11,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:11,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:11,992 INFO L225 Difference]: With dead ends: 641 [2020-02-10 19:47:11,992 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 19:47:11,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 19:47:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 19:47:12,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 401. [2020-02-10 19:47:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 19:47:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1377 transitions. [2020-02-10 19:47:12,002 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1377 transitions. Word has length 22 [2020-02-10 19:47:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:12,002 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1377 transitions. [2020-02-10 19:47:12,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:12,003 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1377 transitions. [2020-02-10 19:47:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:12,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:12,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 19:47:12,003 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 19:47:12,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:12,004 INFO L82 PathProgramCache]: Analyzing trace with hash 44043300, now seen corresponding path program 490 times [2020-02-10 19:47:12,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:12,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948368613] [2020-02-10 19:47:12,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:12,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 19:47:12,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948368613] [2020-02-10 19:47:12,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:12,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:12,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832097623] [2020-02-10 19:47:12,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:12,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:12,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:12,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:12,313 INFO L87 Difference]: Start difference. First operand 401 states and 1377 transitions. Second operand 9 states. [2020-02-10 19:47:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:12,418 INFO L93 Difference]: Finished difference Result 639 states and 1862 transitions. [2020-02-10 19:47:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:12,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:12,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:12,420 INFO L225 Difference]: With dead ends: 639 [2020-02-10 19:47:12,421 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:47:12,421 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:12,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:47:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 393. [2020-02-10 19:47:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:47:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1361 transitions. [2020-02-10 19:47:12,430 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1361 transitions. Word has length 22 [2020-02-10 19:47:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:12,430 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1361 transitions. [2020-02-10 19:47:12,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1361 transitions. [2020-02-10 19:47:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:12,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:12,431 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:12,431 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 19:47:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash 228735972, now seen corresponding path program 491 times [2020-02-10 19:47:12,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:12,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607834731] [2020-02-10 19:47:12,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:12,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 19:47:12,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607834731] [2020-02-10 19:47:12,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:12,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:12,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369975685] [2020-02-10 19:47:12,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:12,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:12,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:12,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:12,717 INFO L87 Difference]: Start difference. First operand 393 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:47:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:12,798 INFO L93 Difference]: Finished difference Result 620 states and 1825 transitions. [2020-02-10 19:47:12,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:12,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:12,800 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:47:12,800 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 19:47:12,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 19:47:12,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 19:47:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 394. [2020-02-10 19:47:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1362 transitions. [2020-02-10 19:47:12,810 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1362 transitions. Word has length 22 [2020-02-10 19:47:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:12,810 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1362 transitions. [2020-02-10 19:47:12,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1362 transitions. [2020-02-10 19:47:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:12,811 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:12,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 19:47:12,811 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 19:47:12,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash -846975184, now seen corresponding path program 492 times [2020-02-10 19:47:12,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:12,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496931159] [2020-02-10 19:47:12,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:13,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 19:47:13,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496931159] [2020-02-10 19:47:13,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:13,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:13,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97241695] [2020-02-10 19:47:13,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:13,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:13,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:13,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:13,090 INFO L87 Difference]: Start difference. First operand 394 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:47:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:13,199 INFO L93 Difference]: Finished difference Result 625 states and 1834 transitions. [2020-02-10 19:47:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:13,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:13,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:13,201 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:47:13,201 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 19:47:13,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 19:47:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 19:47:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 390. [2020-02-10 19:47:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1355 transitions. [2020-02-10 19:47:13,217 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1355 transitions. Word has length 22 [2020-02-10 19:47:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:13,217 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1355 transitions. [2020-02-10 19:47:13,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1355 transitions. [2020-02-10 19:47:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:13,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:13,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:13,218 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 19:47:13,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:13,218 INFO L82 PathProgramCache]: Analyzing trace with hash -513082562, now seen corresponding path program 493 times [2020-02-10 19:47:13,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:13,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000896276] [2020-02-10 19:47:13,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:13,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 19:47:13,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000896276] [2020-02-10 19:47:13,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:13,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:13,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878680024] [2020-02-10 19:47:13,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:13,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:13,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:13,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:13,516 INFO L87 Difference]: Start difference. First operand 390 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:47:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:13,597 INFO L93 Difference]: Finished difference Result 636 states and 1862 transitions. [2020-02-10 19:47:13,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:13,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:13,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:13,599 INFO L225 Difference]: With dead ends: 636 [2020-02-10 19:47:13,599 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 19:47:13,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 19:47:13,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 19:47:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 397. [2020-02-10 19:47:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:47:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1371 transitions. [2020-02-10 19:47:13,610 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1371 transitions. Word has length 22 [2020-02-10 19:47:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:13,610 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1371 transitions. [2020-02-10 19:47:13,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1371 transitions. [2020-02-10 19:47:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:13,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:13,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 19:47:13,611 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 19:47:13,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:13,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1475286224, now seen corresponding path program 494 times [2020-02-10 19:47:13,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:13,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376266455] [2020-02-10 19:47:13,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:13,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 19:47:13,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376266455] [2020-02-10 19:47:13,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:13,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:13,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035548183] [2020-02-10 19:47:13,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:13,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:13,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:13,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:13,905 INFO L87 Difference]: Start difference. First operand 397 states and 1371 transitions. Second operand 9 states. [2020-02-10 19:47:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:14,019 INFO L93 Difference]: Finished difference Result 630 states and 1848 transitions. [2020-02-10 19:47:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:14,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:14,021 INFO L225 Difference]: With dead ends: 630 [2020-02-10 19:47:14,021 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:47:14,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 19:47:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:47:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 394. [2020-02-10 19:47:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1364 transitions. [2020-02-10 19:47:14,032 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1364 transitions. Word has length 22 [2020-02-10 19:47:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:14,032 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1364 transitions. [2020-02-10 19:47:14,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1364 transitions. [2020-02-10 19:47:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:14,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:14,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 19:47:14,033 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 19:47:14,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2100047824, now seen corresponding path program 495 times [2020-02-10 19:47:14,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:14,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232408972] [2020-02-10 19:47:14,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:14,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 19:47:14,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232408972] [2020-02-10 19:47:14,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:14,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:14,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395714033] [2020-02-10 19:47:14,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:14,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:14,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:14,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:14,349 INFO L87 Difference]: Start difference. First operand 394 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:47:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:14,440 INFO L93 Difference]: Finished difference Result 645 states and 1880 transitions. [2020-02-10 19:47:14,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:14,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:14,442 INFO L225 Difference]: With dead ends: 645 [2020-02-10 19:47:14,442 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 19:47:14,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 19:47:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 19:47:14,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 402. [2020-02-10 19:47:14,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 19:47:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1377 transitions. [2020-02-10 19:47:14,451 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1377 transitions. Word has length 22 [2020-02-10 19:47:14,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:14,451 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1377 transitions. [2020-02-10 19:47:14,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1377 transitions. [2020-02-10 19:47:14,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:14,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:14,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 19:47:14,452 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 19:47:14,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:14,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1970077378, now seen corresponding path program 496 times [2020-02-10 19:47:14,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:14,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757773140] [2020-02-10 19:47:14,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:14,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 19:47:14,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757773140] [2020-02-10 19:47:14,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:14,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:14,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14830879] [2020-02-10 19:47:14,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:14,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:14,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:14,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:14,750 INFO L87 Difference]: Start difference. First operand 402 states and 1377 transitions. Second operand 9 states. [2020-02-10 19:47:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:14,860 INFO L93 Difference]: Finished difference Result 643 states and 1870 transitions. [2020-02-10 19:47:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:14,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:14,862 INFO L225 Difference]: With dead ends: 643 [2020-02-10 19:47:14,862 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 19:47:14,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 19:47:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 394. [2020-02-10 19:47:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1360 transitions. [2020-02-10 19:47:14,873 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1360 transitions. Word has length 22 [2020-02-10 19:47:14,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:14,874 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1360 transitions. [2020-02-10 19:47:14,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1360 transitions. [2020-02-10 19:47:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:14,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:14,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 19:47:14,875 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 19:47:14,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:14,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1205685836, now seen corresponding path program 497 times [2020-02-10 19:47:14,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:14,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191846178] [2020-02-10 19:47:14,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:15,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 19:47:15,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191846178] [2020-02-10 19:47:15,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:15,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:15,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910043062] [2020-02-10 19:47:15,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:15,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:15,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:15,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:15,167 INFO L87 Difference]: Start difference. First operand 394 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:47:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:15,277 INFO L93 Difference]: Finished difference Result 627 states and 1839 transitions. [2020-02-10 19:47:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:15,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:15,279 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:47:15,279 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:47:15,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 19:47:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:47:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 396. [2020-02-10 19:47:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:47:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1363 transitions. [2020-02-10 19:47:15,291 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1363 transitions. Word has length 22 [2020-02-10 19:47:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:15,291 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1363 transitions. [2020-02-10 19:47:15,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1363 transitions. [2020-02-10 19:47:15,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:15,291 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:15,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 19:47:15,292 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 19:47:15,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:15,292 INFO L82 PathProgramCache]: Analyzing trace with hash 287735646, now seen corresponding path program 498 times [2020-02-10 19:47:15,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:15,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239215874] [2020-02-10 19:47:15,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:15,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 19:47:15,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239215874] [2020-02-10 19:47:15,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:15,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:15,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625775264] [2020-02-10 19:47:15,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:15,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:15,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:15,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:15,582 INFO L87 Difference]: Start difference. First operand 396 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:47:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:15,708 INFO L93 Difference]: Finished difference Result 631 states and 1845 transitions. [2020-02-10 19:47:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:15,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:15,710 INFO L225 Difference]: With dead ends: 631 [2020-02-10 19:47:15,711 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 19:47:15,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 19:47:15,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 390. [2020-02-10 19:47:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1352 transitions. [2020-02-10 19:47:15,722 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1352 transitions. Word has length 22 [2020-02-10 19:47:15,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:15,722 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1352 transitions. [2020-02-10 19:47:15,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:15,722 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1352 transitions. [2020-02-10 19:47:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:15,722 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:15,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 19:47:15,723 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 19:47:15,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:15,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1024774602, now seen corresponding path program 499 times [2020-02-10 19:47:15,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:15,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931604428] [2020-02-10 19:47:15,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:16,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 19:47:16,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931604428] [2020-02-10 19:47:16,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:16,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:16,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327375254] [2020-02-10 19:47:16,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:16,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:16,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:16,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:16,020 INFO L87 Difference]: Start difference. First operand 390 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:47:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:16,105 INFO L93 Difference]: Finished difference Result 601 states and 1783 transitions. [2020-02-10 19:47:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:16,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:16,107 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:47:16,108 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:47:16,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:47:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 392. [2020-02-10 19:47:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1356 transitions. [2020-02-10 19:47:16,117 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1356 transitions. Word has length 22 [2020-02-10 19:47:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:16,117 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1356 transitions. [2020-02-10 19:47:16,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1356 transitions. [2020-02-10 19:47:16,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:16,117 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:16,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:16,118 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 19:47:16,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:16,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1659251736, now seen corresponding path program 500 times [2020-02-10 19:47:16,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:16,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588951830] [2020-02-10 19:47:16,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:16,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 19:47:16,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588951830] [2020-02-10 19:47:16,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:16,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:16,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303463050] [2020-02-10 19:47:16,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:16,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:16,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:16,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:16,413 INFO L87 Difference]: Start difference. First operand 392 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:47:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:16,548 INFO L93 Difference]: Finished difference Result 602 states and 1784 transitions. [2020-02-10 19:47:16,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:16,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:16,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:16,550 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:47:16,550 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:47:16,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 19:47:16,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:47:16,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 391. [2020-02-10 19:47:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:47:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1354 transitions. [2020-02-10 19:47:16,560 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1354 transitions. Word has length 22 [2020-02-10 19:47:16,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:16,560 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1354 transitions. [2020-02-10 19:47:16,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1354 transitions. [2020-02-10 19:47:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:16,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:16,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 19:47:16,561 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 19:47:16,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:16,561 INFO L82 PathProgramCache]: Analyzing trace with hash -657062308, now seen corresponding path program 501 times [2020-02-10 19:47:16,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:16,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763864748] [2020-02-10 19:47:16,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:16,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 19:47:16,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763864748] [2020-02-10 19:47:16,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:16,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:16,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770385969] [2020-02-10 19:47:16,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:16,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:16,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:16,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:16,851 INFO L87 Difference]: Start difference. First operand 391 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:47:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:16,940 INFO L93 Difference]: Finished difference Result 605 states and 1790 transitions. [2020-02-10 19:47:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:16,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:16,942 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:47:16,943 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:47:16,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:47:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 392. [2020-02-10 19:47:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1355 transitions. [2020-02-10 19:47:16,953 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1355 transitions. Word has length 22 [2020-02-10 19:47:16,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:16,953 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1355 transitions. [2020-02-10 19:47:16,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1355 transitions. [2020-02-10 19:47:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:16,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:16,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 19:47:16,954 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 19:47:16,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:16,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1732773464, now seen corresponding path program 502 times [2020-02-10 19:47:16,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:16,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829030213] [2020-02-10 19:47:16,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:17,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 19:47:17,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829030213] [2020-02-10 19:47:17,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:17,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:17,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627447192] [2020-02-10 19:47:17,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:17,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:17,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:17,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:17,251 INFO L87 Difference]: Start difference. First operand 392 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:47:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:17,366 INFO L93 Difference]: Finished difference Result 610 states and 1799 transitions. [2020-02-10 19:47:17,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:17,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:17,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:17,368 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:47:17,368 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 19:47:17,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 19:47:17,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 19:47:17,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 391. [2020-02-10 19:47:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:47:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1353 transitions. [2020-02-10 19:47:17,379 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1353 transitions. Word has length 22 [2020-02-10 19:47:17,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:17,379 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1353 transitions. [2020-02-10 19:47:17,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1353 transitions. [2020-02-10 19:47:17,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:17,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:17,380 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:17,380 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 19:47:17,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:17,380 INFO L82 PathProgramCache]: Analyzing trace with hash -646559204, now seen corresponding path program 503 times [2020-02-10 19:47:17,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:17,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733176530] [2020-02-10 19:47:17,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:17,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 19:47:17,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733176530] [2020-02-10 19:47:17,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:17,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:17,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184988052] [2020-02-10 19:47:17,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:17,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:17,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:17,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:17,668 INFO L87 Difference]: Start difference. First operand 391 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:47:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:17,780 INFO L93 Difference]: Finished difference Result 608 states and 1796 transitions. [2020-02-10 19:47:17,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:17,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:17,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:17,782 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:47:17,783 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:47:17,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 19:47:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:47:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 393. [2020-02-10 19:47:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:47:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1356 transitions. [2020-02-10 19:47:17,792 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1356 transitions. Word has length 22 [2020-02-10 19:47:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:17,792 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1356 transitions. [2020-02-10 19:47:17,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1356 transitions. [2020-02-10 19:47:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:17,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:17,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 19:47:17,793 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 19:47:17,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:17,793 INFO L82 PathProgramCache]: Analyzing trace with hash 961755978, now seen corresponding path program 504 times [2020-02-10 19:47:17,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:17,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391959450] [2020-02-10 19:47:17,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:18,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 19:47:18,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391959450] [2020-02-10 19:47:18,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:18,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:18,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679000194] [2020-02-10 19:47:18,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:18,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:18,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:18,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:18,071 INFO L87 Difference]: Start difference. First operand 393 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:47:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:18,186 INFO L93 Difference]: Finished difference Result 612 states and 1802 transitions. [2020-02-10 19:47:18,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:18,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:18,188 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:47:18,188 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:47:18,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 19:47:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:47:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 387. [2020-02-10 19:47:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:47:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1346 transitions. [2020-02-10 19:47:18,198 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1346 transitions. Word has length 22 [2020-02-10 19:47:18,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:18,198 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1346 transitions. [2020-02-10 19:47:18,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1346 transitions. [2020-02-10 19:47:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:18,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:18,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 19:47:18,199 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 19:47:18,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:18,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1086313580, now seen corresponding path program 505 times [2020-02-10 19:47:18,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:18,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096685806] [2020-02-10 19:47:18,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:18,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 19:47:18,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096685806] [2020-02-10 19:47:18,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:18,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:18,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742266453] [2020-02-10 19:47:18,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:18,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:18,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:18,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:18,492 INFO L87 Difference]: Start difference. First operand 387 states and 1346 transitions. Second operand 9 states. [2020-02-10 19:47:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:18,583 INFO L93 Difference]: Finished difference Result 614 states and 1811 transitions. [2020-02-10 19:47:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:18,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:18,585 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:47:18,585 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:47:18,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 19:47:18,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:47:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 393. [2020-02-10 19:47:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:47:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-02-10 19:47:18,596 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-02-10 19:47:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:18,597 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-02-10 19:47:18,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-02-10 19:47:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:18,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:18,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 19:47:18,598 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 19:47:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash -525245088, now seen corresponding path program 506 times [2020-02-10 19:47:18,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:18,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475703210] [2020-02-10 19:47:18,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:18,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 19:47:18,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475703210] [2020-02-10 19:47:18,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:18,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:18,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845780827] [2020-02-10 19:47:18,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:18,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:18,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:18,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:18,907 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:47:19,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:19,006 INFO L93 Difference]: Finished difference Result 607 states and 1796 transitions. [2020-02-10 19:47:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:19,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:19,008 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:47:19,008 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:47:19,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 19:47:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:47:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 391. [2020-02-10 19:47:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:47:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-02-10 19:47:19,018 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-02-10 19:47:19,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:19,018 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-02-10 19:47:19,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-02-10 19:47:19,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:19,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:19,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 19:47:19,019 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 19:47:19,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:19,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1608215862, now seen corresponding path program 507 times [2020-02-10 19:47:19,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:19,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567225744] [2020-02-10 19:47:19,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:19,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 19:47:19,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567225744] [2020-02-10 19:47:19,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:19,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:19,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568568756] [2020-02-10 19:47:19,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:19,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:19,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:19,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:19,312 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:47:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:19,399 INFO L93 Difference]: Finished difference Result 616 states and 1814 transitions. [2020-02-10 19:47:19,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:19,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:19,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:19,401 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:47:19,401 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:47:19,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:47:19,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 394. [2020-02-10 19:47:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1362 transitions. [2020-02-10 19:47:19,411 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1362 transitions. Word has length 22 [2020-02-10 19:47:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:19,411 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1362 transitions. [2020-02-10 19:47:19,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1362 transitions. [2020-02-10 19:47:19,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:19,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:19,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 19:47:19,412 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 19:47:19,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash 646012200, now seen corresponding path program 508 times [2020-02-10 19:47:19,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:19,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691842315] [2020-02-10 19:47:19,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:19,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 19:47:19,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691842315] [2020-02-10 19:47:19,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:19,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:19,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716250502] [2020-02-10 19:47:19,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:19,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:19,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:19,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:19,700 INFO L87 Difference]: Start difference. First operand 394 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:47:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:19,813 INFO L93 Difference]: Finished difference Result 610 states and 1800 transitions. [2020-02-10 19:47:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:19,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:19,815 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:47:19,816 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 19:47:19,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 19:47:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 19:47:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 391. [2020-02-10 19:47:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:47:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-02-10 19:47:19,825 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-02-10 19:47:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:19,825 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-02-10 19:47:19,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-02-10 19:47:19,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:19,826 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:19,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 19:47:19,826 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 19:47:19,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:19,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1662938088, now seen corresponding path program 509 times [2020-02-10 19:47:19,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:19,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793450826] [2020-02-10 19:47:19,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:20,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 19:47:20,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793450826] [2020-02-10 19:47:20,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:20,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:20,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834066708] [2020-02-10 19:47:20,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:20,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:20,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:20,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:20,135 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:47:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:20,224 INFO L93 Difference]: Finished difference Result 600 states and 1781 transitions. [2020-02-10 19:47:20,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:20,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:20,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:20,226 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:47:20,226 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:47:20,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:47:20,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 392. [2020-02-10 19:47:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1357 transitions. [2020-02-10 19:47:20,236 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1357 transitions. Word has length 22 [2020-02-10 19:47:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:20,236 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1357 transitions. [2020-02-10 19:47:20,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1357 transitions. [2020-02-10 19:47:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:20,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:20,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 19:47:20,237 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 19:47:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:20,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1021088250, now seen corresponding path program 510 times [2020-02-10 19:47:20,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:20,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224623405] [2020-02-10 19:47:20,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:20,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 19:47:20,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224623405] [2020-02-10 19:47:20,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:20,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:20,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410295471] [2020-02-10 19:47:20,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:20,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:20,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:20,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:20,539 INFO L87 Difference]: Start difference. First operand 392 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:47:20,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:20,653 INFO L93 Difference]: Finished difference Result 601 states and 1782 transitions. [2020-02-10 19:47:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:20,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:20,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:20,655 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:47:20,655 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:47:20,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 19:47:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:47:20,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 389. [2020-02-10 19:47:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:47:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1352 transitions. [2020-02-10 19:47:20,666 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1352 transitions. Word has length 22 [2020-02-10 19:47:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:20,666 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1352 transitions. [2020-02-10 19:47:20,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1352 transitions. [2020-02-10 19:47:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:20,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:20,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 19:47:20,667 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 19:47:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2126549378, now seen corresponding path program 511 times [2020-02-10 19:47:20,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:20,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456357120] [2020-02-10 19:47:20,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:20,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 19:47:20,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456357120] [2020-02-10 19:47:20,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:20,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:20,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188194402] [2020-02-10 19:47:20,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:20,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:20,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:20,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:20,965 INFO L87 Difference]: Start difference. First operand 389 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:47:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:21,053 INFO L93 Difference]: Finished difference Result 620 states and 1824 transitions. [2020-02-10 19:47:21,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:21,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:21,055 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:47:21,055 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 19:47:21,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 19:47:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 19:47:21,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 393. [2020-02-10 19:47:21,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:47:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1360 transitions. [2020-02-10 19:47:21,066 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1360 transitions. Word has length 22 [2020-02-10 19:47:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:21,066 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1360 transitions. [2020-02-10 19:47:21,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1360 transitions. [2020-02-10 19:47:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:21,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:21,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 19:47:21,067 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 19:47:21,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:21,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1565480886, now seen corresponding path program 512 times [2020-02-10 19:47:21,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:21,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846250664] [2020-02-10 19:47:21,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:21,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 19:47:21,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846250664] [2020-02-10 19:47:21,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:21,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:21,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909438896] [2020-02-10 19:47:21,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:21,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:21,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:21,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:21,362 INFO L87 Difference]: Start difference. First operand 393 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:47:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:21,472 INFO L93 Difference]: Finished difference Result 613 states and 1809 transitions. [2020-02-10 19:47:21,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:21,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:21,474 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:47:21,474 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:47:21,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 19:47:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:47:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 391. [2020-02-10 19:47:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:47:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-02-10 19:47:21,483 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-02-10 19:47:21,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:21,483 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-02-10 19:47:21,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:21,484 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-02-10 19:47:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:21,484 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:21,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:21,484 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 19:47:21,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:21,484 INFO L82 PathProgramCache]: Analyzing trace with hash -19765258, now seen corresponding path program 513 times [2020-02-10 19:47:21,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:21,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107323199] [2020-02-10 19:47:21,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:21,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 19:47:21,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107323199] [2020-02-10 19:47:21,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:21,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:21,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192972655] [2020-02-10 19:47:21,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:21,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:21,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:21,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:21,785 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:47:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:21,878 INFO L93 Difference]: Finished difference Result 628 states and 1842 transitions. [2020-02-10 19:47:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:21,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:21,880 INFO L225 Difference]: With dead ends: 628 [2020-02-10 19:47:21,880 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 19:47:21,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 19:47:21,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 397. [2020-02-10 19:47:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:47:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1366 transitions. [2020-02-10 19:47:21,890 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1366 transitions. Word has length 22 [2020-02-10 19:47:21,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:21,890 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1366 transitions. [2020-02-10 19:47:21,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1366 transitions. [2020-02-10 19:47:21,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:21,890 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:21,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 19:47:21,891 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 19:47:21,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:21,891 INFO L82 PathProgramCache]: Analyzing trace with hash 173055434, now seen corresponding path program 514 times [2020-02-10 19:47:21,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:21,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825286135] [2020-02-10 19:47:21,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:22,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 19:47:22,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825286135] [2020-02-10 19:47:22,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:22,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:22,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578906639] [2020-02-10 19:47:22,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:22,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:22,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:22,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:22,187 INFO L87 Difference]: Start difference. First operand 397 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:47:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:22,301 INFO L93 Difference]: Finished difference Result 625 states and 1831 transitions. [2020-02-10 19:47:22,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:22,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:22,303 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:47:22,303 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:47:22,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 19:47:22,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:47:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 391. [2020-02-10 19:47:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:47:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1354 transitions. [2020-02-10 19:47:22,314 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1354 transitions. Word has length 22 [2020-02-10 19:47:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:22,314 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1354 transitions. [2020-02-10 19:47:22,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1354 transitions. [2020-02-10 19:47:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:22,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47: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 19:47:22,315 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 19:47:22,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash 34956968, now seen corresponding path program 515 times [2020-02-10 19:47:22,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:22,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092939755] [2020-02-10 19:47:22,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:22,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 19:47:22,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092939755] [2020-02-10 19:47:22,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:22,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:22,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683155577] [2020-02-10 19:47:22,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:22,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:22,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:22,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:22,618 INFO L87 Difference]: Start difference. First operand 391 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:47:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:22,732 INFO L93 Difference]: Finished difference Result 609 states and 1800 transitions. [2020-02-10 19:47:22,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:22,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:22,734 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:47:22,735 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:47:22,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 19:47:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:47:22,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 392. [2020-02-10 19:47:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1355 transitions. [2020-02-10 19:47:22,745 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1355 transitions. Word has length 22 [2020-02-10 19:47:22,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:22,745 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1355 transitions. [2020-02-10 19:47:22,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1355 transitions. [2020-02-10 19:47:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:22,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:22,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 19:47:22,746 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 19:47:22,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:22,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2113839568, now seen corresponding path program 516 times [2020-02-10 19:47:22,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:22,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29349397] [2020-02-10 19:47:22,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:23,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 19:47:23,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29349397] [2020-02-10 19:47:23,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:23,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:23,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202946613] [2020-02-10 19:47:23,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:23,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:23,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:23,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:23,043 INFO L87 Difference]: Start difference. First operand 392 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:47:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:23,159 INFO L93 Difference]: Finished difference Result 613 states and 1807 transitions. [2020-02-10 19:47:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:23,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:23,161 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:47:23,161 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 19:47:23,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 19:47:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 19:47:23,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 389. [2020-02-10 19:47:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:47:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1350 transitions. [2020-02-10 19:47:23,171 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1350 transitions. Word has length 22 [2020-02-10 19:47:23,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:23,171 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1350 transitions. [2020-02-10 19:47:23,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1350 transitions. [2020-02-10 19:47:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:23,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:23,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 19:47:23,172 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 19:47:23,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:23,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1800953154, now seen corresponding path program 517 times [2020-02-10 19:47:23,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:23,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648904994] [2020-02-10 19:47:23,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:23,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 19:47:23,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648904994] [2020-02-10 19:47:23,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:23,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:23,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808215764] [2020-02-10 19:47:23,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:23,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:23,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:23,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:23,462 INFO L87 Difference]: Start difference. First operand 389 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:47:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:23,548 INFO L93 Difference]: Finished difference Result 626 states and 1839 transitions. [2020-02-10 19:47:23,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:23,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:23,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:23,550 INFO L225 Difference]: With dead ends: 626 [2020-02-10 19:47:23,550 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:47:23,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 19:47:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:47:23,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 395. [2020-02-10 19:47:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:47:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1364 transitions. [2020-02-10 19:47:23,559 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1364 transitions. Word has length 22 [2020-02-10 19:47:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:23,559 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1364 transitions. [2020-02-10 19:47:23,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1364 transitions. [2020-02-10 19:47:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:23,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:23,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 19:47:23,560 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 19:47:23,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:23,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1531810480, now seen corresponding path program 518 times [2020-02-10 19:47:23,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:23,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72001592] [2020-02-10 19:47:23,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:23,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 19:47:23,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72001592] [2020-02-10 19:47:23,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:23,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:23,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782539711] [2020-02-10 19:47:23,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:23,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:23,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:23,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:23,850 INFO L87 Difference]: Start difference. First operand 395 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:47:23,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:23,960 INFO L93 Difference]: Finished difference Result 620 states and 1825 transitions. [2020-02-10 19:47:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:23,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:23,962 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:47:23,962 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 19:47:23,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 19:47:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 19:47:23,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 392. [2020-02-10 19:47:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1357 transitions. [2020-02-10 19:47:23,972 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1357 transitions. Word has length 22 [2020-02-10 19:47:23,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:23,972 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1357 transitions. [2020-02-10 19:47:23,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1357 transitions. [2020-02-10 19:47:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:23,973 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:23,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 19:47:23,973 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 19:47:23,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:23,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1906268820, now seen corresponding path program 519 times [2020-02-10 19:47:23,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:23,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944851333] [2020-02-10 19:47:23,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:24,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 19:47:24,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944851333] [2020-02-10 19:47:24,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:24,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:24,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684378819] [2020-02-10 19:47:24,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:24,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:24,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:24,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:24,279 INFO L87 Difference]: Start difference. First operand 392 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:47:24,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:24,386 INFO L93 Difference]: Finished difference Result 632 states and 1851 transitions. [2020-02-10 19:47:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:24,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:24,388 INFO L225 Difference]: With dead ends: 632 [2020-02-10 19:47:24,388 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:47:24,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 19:47:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:47:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 398. [2020-02-10 19:47:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:47:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1367 transitions. [2020-02-10 19:47:24,399 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1367 transitions. Word has length 22 [2020-02-10 19:47:24,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:24,399 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1367 transitions. [2020-02-10 19:47:24,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:24,399 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1367 transitions. [2020-02-10 19:47:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:24,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:24,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 19:47:24,400 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 19:47:24,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:24,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2099089512, now seen corresponding path program 520 times [2020-02-10 19:47:24,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:24,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499093530] [2020-02-10 19:47:24,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:24,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 19:47:24,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499093530] [2020-02-10 19:47:24,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:24,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:24,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850878939] [2020-02-10 19:47:24,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:24,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:24,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:24,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:24,692 INFO L87 Difference]: Start difference. First operand 398 states and 1367 transitions. Second operand 9 states. [2020-02-10 19:47:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:24,825 INFO L93 Difference]: Finished difference Result 629 states and 1840 transitions. [2020-02-10 19:47:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:24,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:24,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:24,827 INFO L225 Difference]: With dead ends: 629 [2020-02-10 19:47:24,827 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:47:24,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:24,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:47:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 392. [2020-02-10 19:47:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-02-10 19:47:24,838 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-02-10 19:47:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:24,838 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-02-10 19:47:24,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-02-10 19:47:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:24,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:24,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 19:47:24,839 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 19:47:24,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:24,839 INFO L82 PathProgramCache]: Analyzing trace with hash -61178548, now seen corresponding path program 521 times [2020-02-10 19:47:24,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:24,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76138700] [2020-02-10 19:47:24,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:25,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 19:47:25,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76138700] [2020-02-10 19:47:25,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:25,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:25,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643959787] [2020-02-10 19:47:25,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:25,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:25,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:25,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:25,132 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:47:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:25,270 INFO L93 Difference]: Finished difference Result 616 states and 1815 transitions. [2020-02-10 19:47:25,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:25,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:25,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:25,272 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:47:25,272 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:47:25,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:47:25,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 394. [2020-02-10 19:47:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1357 transitions. [2020-02-10 19:47:25,282 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1357 transitions. Word has length 22 [2020-02-10 19:47:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:25,282 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1357 transitions. [2020-02-10 19:47:25,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1357 transitions. [2020-02-10 19:47:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:25,283 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:25,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:25,283 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 19:47:25,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash 510276258, now seen corresponding path program 522 times [2020-02-10 19:47:25,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:25,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656772135] [2020-02-10 19:47:25,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:25,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 19:47:25,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656772135] [2020-02-10 19:47:25,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:25,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:25,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361800236] [2020-02-10 19:47:25,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:25,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:25,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:25,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:25,584 INFO L87 Difference]: Start difference. First operand 394 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:47:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:25,700 INFO L93 Difference]: Finished difference Result 619 states and 1819 transitions. [2020-02-10 19:47:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:25,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:25,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:25,702 INFO L225 Difference]: With dead ends: 619 [2020-02-10 19:47:25,702 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 19:47:25,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 19:47:25,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 389. [2020-02-10 19:47:25,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:47:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1348 transitions. [2020-02-10 19:47:25,713 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1348 transitions. Word has length 22 [2020-02-10 19:47:25,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:25,713 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1348 transitions. [2020-02-10 19:47:25,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:25,713 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1348 transitions. [2020-02-10 19:47:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:25,713 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:25,713 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:25,713 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 19:47:25,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:25,714 INFO L82 PathProgramCache]: Analyzing trace with hash -263095990, now seen corresponding path program 523 times [2020-02-10 19:47:25,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:25,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184835053] [2020-02-10 19:47:25,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:26,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 19:47:26,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184835053] [2020-02-10 19:47:26,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:26,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:26,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038980238] [2020-02-10 19:47:26,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:26,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:26,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:26,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:26,035 INFO L87 Difference]: Start difference. First operand 389 states and 1348 transitions. Second operand 9 states. [2020-02-10 19:47:26,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:26,113 INFO L93 Difference]: Finished difference Result 594 states and 1767 transitions. [2020-02-10 19:47:26,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:26,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:26,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:26,114 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:47:26,115 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:47:26,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 19:47:26,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:47:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 391. [2020-02-10 19:47:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:47:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1352 transitions. [2020-02-10 19:47:26,127 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1352 transitions. Word has length 22 [2020-02-10 19:47:26,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:26,127 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1352 transitions. [2020-02-10 19:47:26,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1352 transitions. [2020-02-10 19:47:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:26,128 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:26,129 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:26,129 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 19:47:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:26,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1347844968, now seen corresponding path program 524 times [2020-02-10 19:47:26,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:26,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694920334] [2020-02-10 19:47:26,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:26,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694920334] [2020-02-10 19:47:26,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:26,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:26,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466675787] [2020-02-10 19:47:26,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:26,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:26,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:26,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:26,437 INFO L87 Difference]: Start difference. First operand 391 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:47:26,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:26,576 INFO L93 Difference]: Finished difference Result 595 states and 1768 transitions. [2020-02-10 19:47:26,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:26,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:26,578 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:47:26,578 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:47:26,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 19:47:26,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:47:26,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 390. [2020-02-10 19:47:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1350 transitions. [2020-02-10 19:47:26,589 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1350 transitions. Word has length 22 [2020-02-10 19:47:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:26,589 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1350 transitions. [2020-02-10 19:47:26,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1350 transitions. [2020-02-10 19:47:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:26,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:26,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 19:47:26,590 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 19:47:26,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:26,590 INFO L82 PathProgramCache]: Analyzing trace with hash -850841312, now seen corresponding path program 525 times [2020-02-10 19:47:26,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:26,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520245717] [2020-02-10 19:47:26,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:26,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520245717] [2020-02-10 19:47:26,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:26,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:26,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430285380] [2020-02-10 19:47:26,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:26,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:26,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:26,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:26,896 INFO L87 Difference]: Start difference. First operand 390 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:47:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:26,983 INFO L93 Difference]: Finished difference Result 597 states and 1772 transitions. [2020-02-10 19:47:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:26,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:26,985 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:47:26,985 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:47:26,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 19:47:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:47:27,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 391. [2020-02-10 19:47:27,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:47:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1351 transitions. [2020-02-10 19:47:27,004 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1351 transitions. Word has length 22 [2020-02-10 19:47:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:27,004 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1351 transitions. [2020-02-10 19:47:27,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1351 transitions. [2020-02-10 19:47:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:27,005 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:27,005 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:27,005 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 19:47:27,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:27,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1295329448, now seen corresponding path program 526 times [2020-02-10 19:47:27,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:27,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383488794] [2020-02-10 19:47:27,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:27,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 19:47:27,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383488794] [2020-02-10 19:47:27,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:27,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:27,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399485939] [2020-02-10 19:47:27,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:27,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:27,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:27,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:27,308 INFO L87 Difference]: Start difference. First operand 391 states and 1351 transitions. Second operand 9 states. [2020-02-10 19:47:27,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:27,426 INFO L93 Difference]: Finished difference Result 601 states and 1779 transitions. [2020-02-10 19:47:27,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:27,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:27,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:27,428 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:47:27,428 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:47:27,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 19:47:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:47:27,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 390. [2020-02-10 19:47:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-02-10 19:47:27,438 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-02-10 19:47:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:27,438 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-02-10 19:47:27,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-02-10 19:47:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:27,439 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:27,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 19:47:27,439 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 19:47:27,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:27,439 INFO L82 PathProgramCache]: Analyzing trace with hash -840338208, now seen corresponding path program 527 times [2020-02-10 19:47:27,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:27,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498870687] [2020-02-10 19:47:27,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:27,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498870687] [2020-02-10 19:47:27,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:27,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:27,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992781344] [2020-02-10 19:47:27,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:27,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:27,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:27,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:27,733 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:47:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:27,845 INFO L93 Difference]: Finished difference Result 600 states and 1778 transitions. [2020-02-10 19:47:27,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:27,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:27,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:27,847 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:47:27,847 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:47:27,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 19:47:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:47:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 392. [2020-02-10 19:47:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1352 transitions. [2020-02-10 19:47:27,858 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1352 transitions. Word has length 22 [2020-02-10 19:47:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:27,859 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1352 transitions. [2020-02-10 19:47:27,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1352 transitions. [2020-02-10 19:47:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:27,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47: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 19:47:27,859 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 19:47:27,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash -305108406, now seen corresponding path program 528 times [2020-02-10 19:47:27,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:27,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071578709] [2020-02-10 19:47:27,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:28,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 19:47:28,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071578709] [2020-02-10 19:47:28,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:28,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:28,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530862875] [2020-02-10 19:47:28,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:28,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:28,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:28,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:28,154 INFO L87 Difference]: Start difference. First operand 392 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:47:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:28,268 INFO L93 Difference]: Finished difference Result 603 states and 1782 transitions. [2020-02-10 19:47:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:28,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:28,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:28,270 INFO L225 Difference]: With dead ends: 603 [2020-02-10 19:47:28,270 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:47:28,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 19:47:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:47:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 387. [2020-02-10 19:47:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:47:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1344 transitions. [2020-02-10 19:47:28,280 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1344 transitions. Word has length 22 [2020-02-10 19:47:28,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:28,281 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1344 transitions. [2020-02-10 19:47:28,281 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1344 transitions. [2020-02-10 19:47:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:28,281 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:28,281 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:28,281 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 19:47:28,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:28,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1273749844, now seen corresponding path program 529 times [2020-02-10 19:47:28,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:28,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364578012] [2020-02-10 19:47:28,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:28,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364578012] [2020-02-10 19:47:28,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:28,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:28,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921366214] [2020-02-10 19:47:28,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:28,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:28,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:28,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:28,584 INFO L87 Difference]: Start difference. First operand 387 states and 1344 transitions. Second operand 9 states. [2020-02-10 19:47:28,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:28,671 INFO L93 Difference]: Finished difference Result 644 states and 1884 transitions. [2020-02-10 19:47:28,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:28,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:28,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:28,673 INFO L225 Difference]: With dead ends: 644 [2020-02-10 19:47:28,673 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 19:47:28,673 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 19:47:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 396. [2020-02-10 19:47:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:47:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1367 transitions. [2020-02-10 19:47:28,684 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1367 transitions. Word has length 22 [2020-02-10 19:47:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:28,684 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1367 transitions. [2020-02-10 19:47:28,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1367 transitions. [2020-02-10 19:47:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:28,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:28,685 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:28,685 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 19:47:28,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1834818336, now seen corresponding path program 530 times [2020-02-10 19:47:28,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:28,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024293465] [2020-02-10 19:47:28,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:28,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 19:47:28,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024293465] [2020-02-10 19:47:28,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:28,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:28,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926595333] [2020-02-10 19:47:28,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:28,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:28,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:28,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:28,973 INFO L87 Difference]: Start difference. First operand 396 states and 1367 transitions. Second operand 9 states. [2020-02-10 19:47:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:29,081 INFO L93 Difference]: Finished difference Result 637 states and 1869 transitions. [2020-02-10 19:47:29,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:29,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:29,083 INFO L225 Difference]: With dead ends: 637 [2020-02-10 19:47:29,083 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 19:47:29,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 19:47:29,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 19:47:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 394. [2020-02-10 19:47:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:29,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1363 transitions. [2020-02-10 19:47:29,094 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1363 transitions. Word has length 22 [2020-02-10 19:47:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:29,094 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1363 transitions. [2020-02-10 19:47:29,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1363 transitions. [2020-02-10 19:47:29,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:29,095 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:29,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 19:47:29,095 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 19:47:29,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:29,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2008524920, now seen corresponding path program 531 times [2020-02-10 19:47:29,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:29,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472685517] [2020-02-10 19:47:29,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:29,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472685517] [2020-02-10 19:47:29,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:29,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:29,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234739684] [2020-02-10 19:47:29,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:29,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:29,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:29,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:29,399 INFO L87 Difference]: Start difference. First operand 394 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:47:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:29,486 INFO L93 Difference]: Finished difference Result 655 states and 1908 transitions. [2020-02-10 19:47:29,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:29,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:29,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:29,488 INFO L225 Difference]: With dead ends: 655 [2020-02-10 19:47:29,489 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 19:47:29,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 19:47:29,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 402. [2020-02-10 19:47:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-02-10 19:47:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1376 transitions. [2020-02-10 19:47:29,498 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1376 transitions. Word has length 22 [2020-02-10 19:47:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:29,498 INFO L479 AbstractCegarLoop]: Abstraction has 402 states and 1376 transitions. [2020-02-10 19:47:29,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1376 transitions. [2020-02-10 19:47:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:29,499 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:29,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:29,499 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 19:47:29,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:29,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2138495366, now seen corresponding path program 532 times [2020-02-10 19:47:29,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:29,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734115151] [2020-02-10 19:47:29,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:29,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734115151] [2020-02-10 19:47:29,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:29,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:29,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313176801] [2020-02-10 19:47:29,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:29,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:29,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:29,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:29,800 INFO L87 Difference]: Start difference. First operand 402 states and 1376 transitions. Second operand 9 states. [2020-02-10 19:47:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:29,915 INFO L93 Difference]: Finished difference Result 653 states and 1898 transitions. [2020-02-10 19:47:29,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:29,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:29,917 INFO L225 Difference]: With dead ends: 653 [2020-02-10 19:47:29,917 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 19:47:29,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:29,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 19:47:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 394. [2020-02-10 19:47:29,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1360 transitions. [2020-02-10 19:47:29,926 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1360 transitions. Word has length 22 [2020-02-10 19:47:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:29,927 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1360 transitions. [2020-02-10 19:47:29,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1360 transitions. [2020-02-10 19:47:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:29,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:29,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:29,927 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 19:47:29,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:29,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1953802694, now seen corresponding path program 533 times [2020-02-10 19:47:29,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:29,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903178990] [2020-02-10 19:47:29,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:30,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 19:47:30,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903178990] [2020-02-10 19:47:30,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:30,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:30,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989743787] [2020-02-10 19:47:30,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:30,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:30,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:30,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:30,231 INFO L87 Difference]: Start difference. First operand 394 states and 1360 transitions. Second operand 9 states. [2020-02-10 19:47:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:30,323 INFO L93 Difference]: Finished difference Result 634 states and 1861 transitions. [2020-02-10 19:47:30,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:30,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:30,325 INFO L225 Difference]: With dead ends: 634 [2020-02-10 19:47:30,325 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 19:47:30,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 19:47:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 19:47:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 395. [2020-02-10 19:47:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:47:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1361 transitions. [2020-02-10 19:47:30,335 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1361 transitions. Word has length 22 [2020-02-10 19:47:30,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:30,335 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1361 transitions. [2020-02-10 19:47:30,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1361 transitions. [2020-02-10 19:47:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:30,336 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:30,336 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:30,336 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 19:47:30,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:30,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1265453446, now seen corresponding path program 534 times [2020-02-10 19:47:30,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:30,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241252769] [2020-02-10 19:47:30,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:30,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241252769] [2020-02-10 19:47:30,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:30,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:30,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781355476] [2020-02-10 19:47:30,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:30,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:30,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:30,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:30,621 INFO L87 Difference]: Start difference. First operand 395 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:47:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:30,755 INFO L93 Difference]: Finished difference Result 639 states and 1870 transitions. [2020-02-10 19:47:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:30,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:30,757 INFO L225 Difference]: With dead ends: 639 [2020-02-10 19:47:30,758 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 19:47:30,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 19:47:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 19:47:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 391. [2020-02-10 19:47:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:47:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1354 transitions. [2020-02-10 19:47:30,768 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1354 transitions. Word has length 22 [2020-02-10 19:47:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:30,769 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1354 transitions. [2020-02-10 19:47:30,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1354 transitions. [2020-02-10 19:47:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:30,769 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:30,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 19:47:30,769 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 19:47:30,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:30,770 INFO L82 PathProgramCache]: Analyzing trace with hash 830850704, now seen corresponding path program 535 times [2020-02-10 19:47:30,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:30,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46068434] [2020-02-10 19:47:30,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:31,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 19:47:31,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46068434] [2020-02-10 19:47:31,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:31,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:31,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805217368] [2020-02-10 19:47:31,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:31,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:31,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:31,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:31,063 INFO L87 Difference]: Start difference. First operand 391 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:47:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:31,150 INFO L93 Difference]: Finished difference Result 640 states and 1873 transitions. [2020-02-10 19:47:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:31,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:31,152 INFO L225 Difference]: With dead ends: 640 [2020-02-10 19:47:31,152 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 19:47:31,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 19:47:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 19:47:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 395. [2020-02-10 19:47:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:47:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1362 transitions. [2020-02-10 19:47:31,161 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1362 transitions. Word has length 22 [2020-02-10 19:47:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:31,161 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1362 transitions. [2020-02-10 19:47:31,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1362 transitions. [2020-02-10 19:47:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:31,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:31,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 19:47:31,162 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 19:47:31,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:31,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1391919196, now seen corresponding path program 536 times [2020-02-10 19:47:31,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:31,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352377222] [2020-02-10 19:47:31,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:31,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 19:47:31,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352377222] [2020-02-10 19:47:31,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:31,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:31,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744826093] [2020-02-10 19:47:31,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:31,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:31,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:31,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:31,466 INFO L87 Difference]: Start difference. First operand 395 states and 1362 transitions. Second operand 9 states. [2020-02-10 19:47:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:31,557 INFO L93 Difference]: Finished difference Result 633 states and 1858 transitions. [2020-02-10 19:47:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:31,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:31,559 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:47:31,559 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 19:47:31,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 19:47:31,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 19:47:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 393. [2020-02-10 19:47:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:47:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1358 transitions. [2020-02-10 19:47:31,570 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1358 transitions. Word has length 22 [2020-02-10 19:47:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:31,570 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1358 transitions. [2020-02-10 19:47:31,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1358 transitions. [2020-02-10 19:47:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:31,570 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:31,571 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:31,571 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 19:47:31,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:31,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1357332472, now seen corresponding path program 537 times [2020-02-10 19:47:31,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:31,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157822515] [2020-02-10 19:47:31,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:31,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 19:47:31,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157822515] [2020-02-10 19:47:31,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:31,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:31,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126821013] [2020-02-10 19:47:31,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:31,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:31,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:31,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:31,885 INFO L87 Difference]: Start difference. First operand 393 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:47:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:31,993 INFO L93 Difference]: Finished difference Result 648 states and 1891 transitions. [2020-02-10 19:47:31,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:31,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:31,995 INFO L225 Difference]: With dead ends: 648 [2020-02-10 19:47:31,995 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 19:47:31,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:32,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 19:47:32,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 399. [2020-02-10 19:47:32,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:47:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1368 transitions. [2020-02-10 19:47:32,005 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1368 transitions. Word has length 22 [2020-02-10 19:47:32,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:32,005 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1368 transitions. [2020-02-10 19:47:32,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1368 transitions. [2020-02-10 19:47:32,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:32,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:32,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:32,006 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 19:47:32,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:32,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1164511780, now seen corresponding path program 538 times [2020-02-10 19:47:32,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:32,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554013373] [2020-02-10 19:47:32,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:32,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 19:47:32,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554013373] [2020-02-10 19:47:32,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:32,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:32,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996406184] [2020-02-10 19:47:32,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:32,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:32,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:32,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:32,301 INFO L87 Difference]: Start difference. First operand 399 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:47:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:32,409 INFO L93 Difference]: Finished difference Result 645 states and 1880 transitions. [2020-02-10 19:47:32,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:32,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:32,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:32,411 INFO L225 Difference]: With dead ends: 645 [2020-02-10 19:47:32,411 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 19:47:32,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 19:47:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 19:47:32,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 393. [2020-02-10 19:47:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:47:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1356 transitions. [2020-02-10 19:47:32,421 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1356 transitions. Word has length 22 [2020-02-10 19:47:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:32,421 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1356 transitions. [2020-02-10 19:47:32,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1356 transitions. [2020-02-10 19:47:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:32,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:32,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 19:47:32,422 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 19:47:32,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1302610246, now seen corresponding path program 539 times [2020-02-10 19:47:32,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:32,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121431081] [2020-02-10 19:47:32,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:32,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 19:47:32,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121431081] [2020-02-10 19:47:32,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:32,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:32,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931607279] [2020-02-10 19:47:32,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:32,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:32,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:32,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:32,719 INFO L87 Difference]: Start difference. First operand 393 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:47:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:32,812 INFO L93 Difference]: Finished difference Result 629 states and 1849 transitions. [2020-02-10 19:47:32,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:32,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:32,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:32,814 INFO L225 Difference]: With dead ends: 629 [2020-02-10 19:47:32,814 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 19:47:32,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 19:47:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 19:47:32,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 394. [2020-02-10 19:47:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1357 transitions. [2020-02-10 19:47:32,824 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1357 transitions. Word has length 22 [2020-02-10 19:47:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:32,825 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1357 transitions. [2020-02-10 19:47:32,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1357 transitions. [2020-02-10 19:47:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:32,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:32,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 19:47:32,826 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 19:47:32,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:32,826 INFO L82 PathProgramCache]: Analyzing trace with hash 843560514, now seen corresponding path program 540 times [2020-02-10 19:47:32,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:32,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015121460] [2020-02-10 19:47:32,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:33,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 19:47:33,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015121460] [2020-02-10 19:47:33,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:33,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:33,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175648989] [2020-02-10 19:47:33,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:33,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:33,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:33,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:33,131 INFO L87 Difference]: Start difference. First operand 394 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:47:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:33,247 INFO L93 Difference]: Finished difference Result 633 states and 1856 transitions. [2020-02-10 19:47:33,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:33,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:33,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:33,249 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:47:33,249 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:47:33,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:47:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 391. [2020-02-10 19:47:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:47:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1352 transitions. [2020-02-10 19:47:33,258 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1352 transitions. Word has length 22 [2020-02-10 19:47:33,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:33,258 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1352 transitions. [2020-02-10 19:47:33,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1352 transitions. [2020-02-10 19:47:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:33,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:33,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 19:47:33,259 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 19:47:33,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:33,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1122726640, now seen corresponding path program 541 times [2020-02-10 19:47:33,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:33,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291850013] [2020-02-10 19:47:33,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:33,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 19:47:33,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291850013] [2020-02-10 19:47:33,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:33,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:33,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704909203] [2020-02-10 19:47:33,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:33,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:33,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:33,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:33,586 INFO L87 Difference]: Start difference. First operand 391 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:47:33,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:33,663 INFO L93 Difference]: Finished difference Result 672 states and 1954 transitions. [2020-02-10 19:47:33,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:33,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:33,665 INFO L225 Difference]: With dead ends: 672 [2020-02-10 19:47:33,665 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 19:47:33,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:33,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 19:47:33,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 407. [2020-02-10 19:47:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-02-10 19:47:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1390 transitions. [2020-02-10 19:47:33,676 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1390 transitions. Word has length 22 [2020-02-10 19:47:33,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:33,676 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 1390 transitions. [2020-02-10 19:47:33,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1390 transitions. [2020-02-10 19:47:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:33,677 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:33,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 19:47:33,677 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 19:47:33,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:33,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1252697086, now seen corresponding path program 542 times [2020-02-10 19:47:33,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:33,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622601869] [2020-02-10 19:47:33,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:33,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 19:47:33,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622601869] [2020-02-10 19:47:33,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:33,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:33,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72070640] [2020-02-10 19:47:33,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:33,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:33,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:33,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:33,983 INFO L87 Difference]: Start difference. First operand 407 states and 1390 transitions. Second operand 9 states. [2020-02-10 19:47:34,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:34,085 INFO L93 Difference]: Finished difference Result 670 states and 1944 transitions. [2020-02-10 19:47:34,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:34,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:34,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:34,087 INFO L225 Difference]: With dead ends: 670 [2020-02-10 19:47:34,087 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 19:47:34,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 19:47:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 19:47:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 399. [2020-02-10 19:47:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:47:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1370 transitions. [2020-02-10 19:47:34,097 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1370 transitions. Word has length 22 [2020-02-10 19:47:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:34,097 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1370 transitions. [2020-02-10 19:47:34,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1370 transitions. [2020-02-10 19:47:34,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:34,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:34,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 19:47:34,098 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 19:47:34,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:34,098 INFO L82 PathProgramCache]: Analyzing trace with hash -28635052, now seen corresponding path program 543 times [2020-02-10 19:47:34,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:34,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902287705] [2020-02-10 19:47:34,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:34,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 19:47:34,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902287705] [2020-02-10 19:47:34,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:34,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:34,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784462275] [2020-02-10 19:47:34,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:34,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:34,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:34,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:34,404 INFO L87 Difference]: Start difference. First operand 399 states and 1370 transitions. Second operand 9 states. [2020-02-10 19:47:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:34,480 INFO L93 Difference]: Finished difference Result 669 states and 1941 transitions. [2020-02-10 19:47:34,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:34,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:34,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:34,482 INFO L225 Difference]: With dead ends: 669 [2020-02-10 19:47:34,483 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 19:47:34,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 19:47:34,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 19:47:34,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 405. [2020-02-10 19:47:34,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-02-10 19:47:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1380 transitions. [2020-02-10 19:47:34,493 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1380 transitions. Word has length 22 [2020-02-10 19:47:34,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:34,493 INFO L479 AbstractCegarLoop]: Abstraction has 405 states and 1380 transitions. [2020-02-10 19:47:34,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:34,493 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1380 transitions. [2020-02-10 19:47:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:34,494 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:34,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 19:47:34,494 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 19:47:34,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:34,494 INFO L82 PathProgramCache]: Analyzing trace with hash 164185640, now seen corresponding path program 544 times [2020-02-10 19:47:34,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:34,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589663594] [2020-02-10 19:47:34,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:34,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 19:47:34,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589663594] [2020-02-10 19:47:34,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:34,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:34,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644826983] [2020-02-10 19:47:34,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:34,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:34,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:34,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:34,799 INFO L87 Difference]: Start difference. First operand 405 states and 1380 transitions. Second operand 9 states. [2020-02-10 19:47:34,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:34,915 INFO L93 Difference]: Finished difference Result 666 states and 1930 transitions. [2020-02-10 19:47:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:34,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:34,917 INFO L225 Difference]: With dead ends: 666 [2020-02-10 19:47:34,918 INFO L226 Difference]: Without dead ends: 647 [2020-02-10 19:47:34,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 19:47:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-02-10 19:47:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 399. [2020-02-10 19:47:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:47:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1364 transitions. [2020-02-10 19:47:34,928 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1364 transitions. Word has length 22 [2020-02-10 19:47:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:34,929 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1364 transitions. [2020-02-10 19:47:34,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1364 transitions. [2020-02-10 19:47:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:34,929 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:34,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 19:47:34,930 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 19:47:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash 454801510, now seen corresponding path program 545 times [2020-02-10 19:47:34,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:34,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992046291] [2020-02-10 19:47:34,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:35,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 19:47:35,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992046291] [2020-02-10 19:47:35,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:35,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:35,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802470051] [2020-02-10 19:47:35,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:35,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:35,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:35,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:35,235 INFO L87 Difference]: Start difference. First operand 399 states and 1364 transitions. Second operand 9 states. [2020-02-10 19:47:35,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:35,356 INFO L93 Difference]: Finished difference Result 664 states and 1927 transitions. [2020-02-10 19:47:35,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:35,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:35,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:35,358 INFO L225 Difference]: With dead ends: 664 [2020-02-10 19:47:35,358 INFO L226 Difference]: Without dead ends: 650 [2020-02-10 19:47:35,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 19:47:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-02-10 19:47:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 404. [2020-02-10 19:47:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-02-10 19:47:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1373 transitions. [2020-02-10 19:47:35,368 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1373 transitions. Word has length 22 [2020-02-10 19:47:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:35,369 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 1373 transitions. [2020-02-10 19:47:35,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1373 transitions. [2020-02-10 19:47:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:35,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:35,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 19:47:35,369 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 19:47:35,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:35,370 INFO L82 PathProgramCache]: Analyzing trace with hash 510212770, now seen corresponding path program 546 times [2020-02-10 19:47:35,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:35,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039766832] [2020-02-10 19:47:35,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:35,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 19:47:35,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039766832] [2020-02-10 19:47:35,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:35,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:35,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188800133] [2020-02-10 19:47:35,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:35,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:35,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:35,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:35,679 INFO L87 Difference]: Start difference. First operand 404 states and 1373 transitions. Second operand 9 states. [2020-02-10 19:47:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:35,782 INFO L93 Difference]: Finished difference Result 663 states and 1920 transitions. [2020-02-10 19:47:35,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:35,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:35,784 INFO L225 Difference]: With dead ends: 663 [2020-02-10 19:47:35,785 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 19:47:35,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 19:47:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 19:47:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 391. [2020-02-10 19:47:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:47:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1348 transitions. [2020-02-10 19:47:35,795 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1348 transitions. Word has length 22 [2020-02-10 19:47:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:35,795 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1348 transitions. [2020-02-10 19:47:35,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1348 transitions. [2020-02-10 19:47:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:35,796 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:35,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 19:47:35,796 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 19:47:35,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:35,796 INFO L82 PathProgramCache]: Analyzing trace with hash 415130524, now seen corresponding path program 547 times [2020-02-10 19:47:35,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:35,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734649835] [2020-02-10 19:47:35,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:36,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 19:47:36,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734649835] [2020-02-10 19:47:36,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:36,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:36,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970356977] [2020-02-10 19:47:36,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:36,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:36,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:36,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:36,089 INFO L87 Difference]: Start difference. First operand 391 states and 1348 transitions. Second operand 9 states. [2020-02-10 19:47:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:36,169 INFO L93 Difference]: Finished difference Result 625 states and 1839 transitions. [2020-02-10 19:47:36,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:36,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:36,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:36,171 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:47:36,171 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:47:36,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 19:47:36,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:47:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 393. [2020-02-10 19:47:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:47:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1352 transitions. [2020-02-10 19:47:36,181 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1352 transitions. Word has length 22 [2020-02-10 19:47:36,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:36,181 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1352 transitions. [2020-02-10 19:47:36,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1352 transitions. [2020-02-10 19:47:36,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:36,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:36,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:36,182 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 19:47:36,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:36,182 INFO L82 PathProgramCache]: Analyzing trace with hash -660580632, now seen corresponding path program 548 times [2020-02-10 19:47:36,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:36,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794523847] [2020-02-10 19:47:36,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:36,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 19:47:36,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794523847] [2020-02-10 19:47:36,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:36,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:36,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275413923] [2020-02-10 19:47:36,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:36,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:36,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:36,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:36,474 INFO L87 Difference]: Start difference. First operand 393 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:47:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:36,578 INFO L93 Difference]: Finished difference Result 630 states and 1848 transitions. [2020-02-10 19:47:36,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:36,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:36,580 INFO L225 Difference]: With dead ends: 630 [2020-02-10 19:47:36,580 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 19:47:36,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:36,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 19:47:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 392. [2020-02-10 19:47:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1350 transitions. [2020-02-10 19:47:36,589 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1350 transitions. Word has length 22 [2020-02-10 19:47:36,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:36,589 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1350 transitions. [2020-02-10 19:47:36,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:36,589 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1350 transitions. [2020-02-10 19:47:36,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:36,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:36,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 19:47:36,590 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 19:47:36,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:36,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1509222112, now seen corresponding path program 549 times [2020-02-10 19:47:36,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:36,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729243907] [2020-02-10 19:47:36,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:36,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 19:47:36,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729243907] [2020-02-10 19:47:36,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:36,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:36,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027163121] [2020-02-10 19:47:36,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:36,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:36,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:36,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:36,894 INFO L87 Difference]: Start difference. First operand 392 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:47:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:36,971 INFO L93 Difference]: Finished difference Result 624 states and 1836 transitions. [2020-02-10 19:47:36,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:36,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:36,973 INFO L225 Difference]: With dead ends: 624 [2020-02-10 19:47:36,973 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 19:47:36,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 19:47:36,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 19:47:36,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 393. [2020-02-10 19:47:36,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:47:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1351 transitions. [2020-02-10 19:47:36,983 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1351 transitions. Word has length 22 [2020-02-10 19:47:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:36,983 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1351 transitions. [2020-02-10 19:47:36,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1351 transitions. [2020-02-10 19:47:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:36,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:36,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 19:47:36,984 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 19:47:36,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:36,984 INFO L82 PathProgramCache]: Analyzing trace with hash -639574424, now seen corresponding path program 550 times [2020-02-10 19:47:36,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:36,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726550957] [2020-02-10 19:47:36,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:37,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 19:47:37,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726550957] [2020-02-10 19:47:37,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:37,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:37,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191985403] [2020-02-10 19:47:37,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:37,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:37,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:37,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:37,293 INFO L87 Difference]: Start difference. First operand 393 states and 1351 transitions. Second operand 9 states. [2020-02-10 19:47:37,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:37,424 INFO L93 Difference]: Finished difference Result 628 states and 1843 transitions. [2020-02-10 19:47:37,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:37,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:37,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:37,426 INFO L225 Difference]: With dead ends: 628 [2020-02-10 19:47:37,426 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 19:47:37,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 19:47:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 392. [2020-02-10 19:47:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1349 transitions. [2020-02-10 19:47:37,436 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1349 transitions. Word has length 22 [2020-02-10 19:47:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:37,436 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1349 transitions. [2020-02-10 19:47:37,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1349 transitions. [2020-02-10 19:47:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:37,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:37,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 19:47:37,437 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 19:47:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:37,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1446203488, now seen corresponding path program 551 times [2020-02-10 19:47:37,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:37,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686613303] [2020-02-10 19:47:37,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:37,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 19:47:37,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686613303] [2020-02-10 19:47:37,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:37,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:37,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292210817] [2020-02-10 19:47:37,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:37,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:37,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:37,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:37,738 INFO L87 Difference]: Start difference. First operand 392 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:47:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:37,847 INFO L93 Difference]: Finished difference Result 638 states and 1867 transitions. [2020-02-10 19:47:37,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:37,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:37,849 INFO L225 Difference]: With dead ends: 638 [2020-02-10 19:47:37,850 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 19:47:37,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 19:47:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 19:47:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 397. [2020-02-10 19:47:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:47:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1358 transitions. [2020-02-10 19:47:37,860 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1358 transitions. Word has length 22 [2020-02-10 19:47:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:37,860 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1358 transitions. [2020-02-10 19:47:37,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1358 transitions. [2020-02-10 19:47:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:37,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:37,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 19:47:37,861 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 19:47:37,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:37,861 INFO L82 PathProgramCache]: Analyzing trace with hash 373118108, now seen corresponding path program 552 times [2020-02-10 19:47:37,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:37,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459730766] [2020-02-10 19:47:37,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:38,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 19:47:38,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459730766] [2020-02-10 19:47:38,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:38,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:38,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758595925] [2020-02-10 19:47:38,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:38,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:38,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:38,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:38,154 INFO L87 Difference]: Start difference. First operand 397 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:47:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:38,257 INFO L93 Difference]: Finished difference Result 637 states and 1860 transitions. [2020-02-10 19:47:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:38,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:38,259 INFO L225 Difference]: With dead ends: 637 [2020-02-10 19:47:38,259 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 19:47:38,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 19:47:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 19:47:38,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 387. [2020-02-10 19:47:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:47:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-02-10 19:47:38,268 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-02-10 19:47:38,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:38,269 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-02-10 19:47:38,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-02-10 19:47:38,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:38,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:38,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 19:47:38,269 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 19:47:38,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:38,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1176860342, now seen corresponding path program 553 times [2020-02-10 19:47:38,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:38,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780603423] [2020-02-10 19:47:38,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:38,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780603423] [2020-02-10 19:47:38,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:38,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:38,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207263235] [2020-02-10 19:47:38,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:38,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:38,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:38,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:38,579 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:47:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:38,663 INFO L93 Difference]: Finished difference Result 658 states and 1925 transitions. [2020-02-10 19:47:38,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:38,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:38,665 INFO L225 Difference]: With dead ends: 658 [2020-02-10 19:47:38,665 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 19:47:38,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 19:47:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 19:47:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 399. [2020-02-10 19:47:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:47:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1374 transitions. [2020-02-10 19:47:38,675 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1374 transitions. Word has length 22 [2020-02-10 19:47:38,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:38,675 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1374 transitions. [2020-02-10 19:47:38,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1374 transitions. [2020-02-10 19:47:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:38,676 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:38,676 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:38,676 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 19:47:38,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:38,676 INFO L82 PathProgramCache]: Analyzing trace with hash 214656680, now seen corresponding path program 554 times [2020-02-10 19:47:38,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:38,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170672804] [2020-02-10 19:47:38,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:38,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 19:47:38,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170672804] [2020-02-10 19:47:38,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:38,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:38,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866742625] [2020-02-10 19:47:38,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:38,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:38,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:38,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:38,970 INFO L87 Difference]: Start difference. First operand 399 states and 1374 transitions. Second operand 9 states. [2020-02-10 19:47:39,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:39,082 INFO L93 Difference]: Finished difference Result 652 states and 1911 transitions. [2020-02-10 19:47:39,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:39,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:39,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:39,084 INFO L225 Difference]: With dead ends: 652 [2020-02-10 19:47:39,084 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 19:47:39,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 19:47:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 19:47:39,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 396. [2020-02-10 19:47:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:47:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1367 transitions. [2020-02-10 19:47:39,094 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1367 transitions. Word has length 22 [2020-02-10 19:47:39,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:39,094 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1367 transitions. [2020-02-10 19:47:39,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1367 transitions. [2020-02-10 19:47:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:39,095 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:39,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 19:47:39,095 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 19:47:39,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:39,095 INFO L82 PathProgramCache]: Analyzing trace with hash -504976568, now seen corresponding path program 555 times [2020-02-10 19:47:39,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:39,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840970252] [2020-02-10 19:47:39,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:39,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 19:47:39,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840970252] [2020-02-10 19:47:39,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:39,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:39,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112017314] [2020-02-10 19:47:39,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:39,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:39,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:39,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:39,413 INFO L87 Difference]: Start difference. First operand 396 states and 1367 transitions. Second operand 9 states. [2020-02-10 19:47:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:39,505 INFO L93 Difference]: Finished difference Result 667 states and 1943 transitions. [2020-02-10 19:47:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:39,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:39,507 INFO L225 Difference]: With dead ends: 667 [2020-02-10 19:47:39,507 INFO L226 Difference]: Without dead ends: 651 [2020-02-10 19:47:39,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 19:47:39,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2020-02-10 19:47:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 404. [2020-02-10 19:47:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-02-10 19:47:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1380 transitions. [2020-02-10 19:47:39,518 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1380 transitions. Word has length 22 [2020-02-10 19:47:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:39,518 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 1380 transitions. [2020-02-10 19:47:39,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1380 transitions. [2020-02-10 19:47:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:39,519 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:39,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 19:47:39,519 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 19:47:39,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:39,519 INFO L82 PathProgramCache]: Analyzing trace with hash -634947014, now seen corresponding path program 556 times [2020-02-10 19:47:39,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:39,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734572275] [2020-02-10 19:47:39,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:39,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 19:47:39,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734572275] [2020-02-10 19:47:39,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:39,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:39,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255858908] [2020-02-10 19:47:39,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:39,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:39,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:39,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:39,821 INFO L87 Difference]: Start difference. First operand 404 states and 1380 transitions. Second operand 9 states. [2020-02-10 19:47:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:39,931 INFO L93 Difference]: Finished difference Result 665 states and 1933 transitions. [2020-02-10 19:47:39,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:39,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:39,933 INFO L225 Difference]: With dead ends: 665 [2020-02-10 19:47:39,933 INFO L226 Difference]: Without dead ends: 643 [2020-02-10 19:47:39,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 19:47:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-02-10 19:47:39,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 396. [2020-02-10 19:47:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:47:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1363 transitions. [2020-02-10 19:47:39,944 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1363 transitions. Word has length 22 [2020-02-10 19:47:39,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:39,944 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1363 transitions. [2020-02-10 19:47:39,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1363 transitions. [2020-02-10 19:47:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:39,944 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:39,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 19:47:39,945 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 19:47:39,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1399338556, now seen corresponding path program 557 times [2020-02-10 19:47:39,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:39,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828354079] [2020-02-10 19:47:39,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:40,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 19:47:40,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828354079] [2020-02-10 19:47:40,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:40,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:40,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609695540] [2020-02-10 19:47:40,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:40,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:40,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:40,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:40,226 INFO L87 Difference]: Start difference. First operand 396 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:47:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:40,328 INFO L93 Difference]: Finished difference Result 649 states and 1902 transitions. [2020-02-10 19:47:40,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:40,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:40,330 INFO L225 Difference]: With dead ends: 649 [2020-02-10 19:47:40,330 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 19:47:40,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 19:47:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 398. [2020-02-10 19:47:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:47:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1366 transitions. [2020-02-10 19:47:40,340 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1366 transitions. Word has length 22 [2020-02-10 19:47:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:40,340 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1366 transitions. [2020-02-10 19:47:40,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1366 transitions. [2020-02-10 19:47:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:40,340 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:40,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 19:47:40,341 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 19:47:40,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:40,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1977678550, now seen corresponding path program 558 times [2020-02-10 19:47:40,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:40,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188913154] [2020-02-10 19:47:40,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:40,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 19:47:40,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188913154] [2020-02-10 19:47:40,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:40,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:40,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950814772] [2020-02-10 19:47:40,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:40,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:40,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:40,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:40,635 INFO L87 Difference]: Start difference. First operand 398 states and 1366 transitions. Second operand 9 states. [2020-02-10 19:47:40,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:40,741 INFO L93 Difference]: Finished difference Result 653 states and 1908 transitions. [2020-02-10 19:47:40,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:40,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:40,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:40,743 INFO L225 Difference]: With dead ends: 653 [2020-02-10 19:47:40,743 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 19:47:40,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 19:47:40,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 19:47:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 392. [2020-02-10 19:47:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-02-10 19:47:40,754 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-02-10 19:47:40,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:40,754 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-02-10 19:47:40,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-02-10 19:47:40,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:40,755 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47: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 19:47:40,755 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 19:47:40,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:40,755 INFO L82 PathProgramCache]: Analyzing trace with hash 733961202, now seen corresponding path program 559 times [2020-02-10 19:47:40,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:40,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468354247] [2020-02-10 19:47:40,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:41,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 19:47:41,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468354247] [2020-02-10 19:47:41,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:41,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:41,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618117199] [2020-02-10 19:47:41,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:41,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:41,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:41,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:41,043 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:47:41,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:41,125 INFO L93 Difference]: Finished difference Result 654 states and 1913 transitions. [2020-02-10 19:47:41,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:41,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:41,127 INFO L225 Difference]: With dead ends: 654 [2020-02-10 19:47:41,127 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 19:47:41,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 19:47:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 19:47:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 398. [2020-02-10 19:47:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:47:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1368 transitions. [2020-02-10 19:47:41,148 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1368 transitions. Word has length 22 [2020-02-10 19:47:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:41,149 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1368 transitions. [2020-02-10 19:47:41,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1368 transitions. [2020-02-10 19:47:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:41,149 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:41,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:41,149 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 19:47:41,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:41,150 INFO L82 PathProgramCache]: Analyzing trace with hash -228242460, now seen corresponding path program 560 times [2020-02-10 19:47:41,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:41,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078345456] [2020-02-10 19:47:41,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:41,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 19:47:41,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078345456] [2020-02-10 19:47:41,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:41,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:41,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718313182] [2020-02-10 19:47:41,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:41,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:41,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:41,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:41,440 INFO L87 Difference]: Start difference. First operand 398 states and 1368 transitions. Second operand 9 states. [2020-02-10 19:47:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:41,547 INFO L93 Difference]: Finished difference Result 648 states and 1899 transitions. [2020-02-10 19:47:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:41,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:41,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:41,549 INFO L225 Difference]: With dead ends: 648 [2020-02-10 19:47:41,549 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 19:47:41,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 19:47:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 19:47:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 395. [2020-02-10 19:47:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:47:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1361 transitions. [2020-02-10 19:47:41,558 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1361 transitions. Word has length 22 [2020-02-10 19:47:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:41,558 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1361 transitions. [2020-02-10 19:47:41,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1361 transitions. [2020-02-10 19:47:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:41,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:41,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 19:47:41,559 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 19:47:41,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:41,559 INFO L82 PathProgramCache]: Analyzing trace with hash 146215880, now seen corresponding path program 561 times [2020-02-10 19:47:41,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:41,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423879872] [2020-02-10 19:47:41,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:41,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423879872] [2020-02-10 19:47:41,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:41,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:41,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150325390] [2020-02-10 19:47:41,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:41,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:41,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:41,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:41,860 INFO L87 Difference]: Start difference. First operand 395 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:47:41,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:41,950 INFO L93 Difference]: Finished difference Result 660 states and 1925 transitions. [2020-02-10 19:47:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:41,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:41,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:41,952 INFO L225 Difference]: With dead ends: 660 [2020-02-10 19:47:41,952 INFO L226 Difference]: Without dead ends: 644 [2020-02-10 19:47:41,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-02-10 19:47:41,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 401. [2020-02-10 19:47:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-02-10 19:47:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1371 transitions. [2020-02-10 19:47:41,962 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1371 transitions. Word has length 22 [2020-02-10 19:47:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:41,962 INFO L479 AbstractCegarLoop]: Abstraction has 401 states and 1371 transitions. [2020-02-10 19:47:41,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1371 transitions. [2020-02-10 19:47:41,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:41,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:41,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 19:47:41,963 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 19:47:41,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:41,963 INFO L82 PathProgramCache]: Analyzing trace with hash 339036572, now seen corresponding path program 562 times [2020-02-10 19:47:41,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:41,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884336395] [2020-02-10 19:47:41,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:42,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884336395] [2020-02-10 19:47:42,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:42,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:42,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48852240] [2020-02-10 19:47:42,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:42,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:42,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:42,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:42,252 INFO L87 Difference]: Start difference. First operand 401 states and 1371 transitions. Second operand 9 states. [2020-02-10 19:47:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:42,363 INFO L93 Difference]: Finished difference Result 657 states and 1914 transitions. [2020-02-10 19:47:42,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:42,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:42,365 INFO L225 Difference]: With dead ends: 657 [2020-02-10 19:47:42,365 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 19:47:42,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 19:47:42,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 19:47:42,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 395. [2020-02-10 19:47:42,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:47:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1358 transitions. [2020-02-10 19:47:42,375 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1358 transitions. Word has length 22 [2020-02-10 19:47:42,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:42,375 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1358 transitions. [2020-02-10 19:47:42,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1358 transitions. [2020-02-10 19:47:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:42,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:42,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 19:47:42,376 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 19:47:42,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:42,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1821231488, now seen corresponding path program 563 times [2020-02-10 19:47:42,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:42,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659454398] [2020-02-10 19:47:42,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:42,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 19:47:42,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659454398] [2020-02-10 19:47:42,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:42,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:42,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208984768] [2020-02-10 19:47:42,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:42,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:42,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:42,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:42,663 INFO L87 Difference]: Start difference. First operand 395 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:47:42,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:42,767 INFO L93 Difference]: Finished difference Result 644 states and 1889 transitions. [2020-02-10 19:47:42,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:42,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:42,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:42,769 INFO L225 Difference]: With dead ends: 644 [2020-02-10 19:47:42,770 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 19:47:42,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 19:47:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 19:47:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 397. [2020-02-10 19:47:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:47:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1361 transitions. [2020-02-10 19:47:42,780 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1361 transitions. Word has length 22 [2020-02-10 19:47:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:42,780 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1361 transitions. [2020-02-10 19:47:42,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1361 transitions. [2020-02-10 19:47:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:42,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:42,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 19:47:42,781 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 19:47:42,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:42,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1249776682, now seen corresponding path program 564 times [2020-02-10 19:47:42,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:42,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799870911] [2020-02-10 19:47:42,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:43,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799870911] [2020-02-10 19:47:43,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:43,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:43,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744980943] [2020-02-10 19:47:43,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:43,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:43,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:43,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:43,067 INFO L87 Difference]: Start difference. First operand 397 states and 1361 transitions. Second operand 9 states. [2020-02-10 19:47:43,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:43,181 INFO L93 Difference]: Finished difference Result 647 states and 1893 transitions. [2020-02-10 19:47:43,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:43,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:43,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:43,183 INFO L225 Difference]: With dead ends: 647 [2020-02-10 19:47:43,183 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 19:47:43,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 19:47:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 19:47:43,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 392. [2020-02-10 19:47:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1351 transitions. [2020-02-10 19:47:43,194 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1351 transitions. Word has length 22 [2020-02-10 19:47:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:43,194 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1351 transitions. [2020-02-10 19:47:43,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:43,194 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1351 transitions. [2020-02-10 19:47:43,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:43,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:43,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 19:47:43,195 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 19:47:43,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:43,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1545212366, now seen corresponding path program 565 times [2020-02-10 19:47:43,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:43,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147498430] [2020-02-10 19:47:43,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:43,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 19:47:43,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147498430] [2020-02-10 19:47:43,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:43,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:43,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779180998] [2020-02-10 19:47:43,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:43,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:43,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:43,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:43,522 INFO L87 Difference]: Start difference. First operand 392 states and 1351 transitions. Second operand 9 states. [2020-02-10 19:47:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:43,608 INFO L93 Difference]: Finished difference Result 680 states and 1976 transitions. [2020-02-10 19:47:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:43,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:43,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:43,610 INFO L225 Difference]: With dead ends: 680 [2020-02-10 19:47:43,611 INFO L226 Difference]: Without dead ends: 664 [2020-02-10 19:47:43,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 19:47:43,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-02-10 19:47:43,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 408. [2020-02-10 19:47:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2020-02-10 19:47:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1389 transitions. [2020-02-10 19:47:43,621 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 1389 transitions. Word has length 22 [2020-02-10 19:47:43,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:43,621 INFO L479 AbstractCegarLoop]: Abstraction has 408 states and 1389 transitions. [2020-02-10 19:47:43,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 1389 transitions. [2020-02-10 19:47:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:43,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:43,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:43,622 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 19:47:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1675182812, now seen corresponding path program 566 times [2020-02-10 19:47:43,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:43,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647570641] [2020-02-10 19:47:43,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:43,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 19:47:43,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647570641] [2020-02-10 19:47:43,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:43,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:43,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746223668] [2020-02-10 19:47:43,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:43,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:43,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:43,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:43,930 INFO L87 Difference]: Start difference. First operand 408 states and 1389 transitions. Second operand 9 states. [2020-02-10 19:47:44,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:44,044 INFO L93 Difference]: Finished difference Result 678 states and 1966 transitions. [2020-02-10 19:47:44,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:44,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:44,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:44,046 INFO L225 Difference]: With dead ends: 678 [2020-02-10 19:47:44,046 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 19:47:44,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 19:47:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 19:47:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 400. [2020-02-10 19:47:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 19:47:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1369 transitions. [2020-02-10 19:47:44,056 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1369 transitions. Word has length 22 [2020-02-10 19:47:44,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:44,056 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1369 transitions. [2020-02-10 19:47:44,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1369 transitions. [2020-02-10 19:47:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:44,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:44,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 19:47:44,057 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 19:47:44,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:44,057 INFO L82 PathProgramCache]: Analyzing trace with hash -451120778, now seen corresponding path program 567 times [2020-02-10 19:47:44,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:44,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91608276] [2020-02-10 19:47:44,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:44,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 19:47:44,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91608276] [2020-02-10 19:47:44,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:44,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:44,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221589382] [2020-02-10 19:47:44,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:44,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:44,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:44,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:44,370 INFO L87 Difference]: Start difference. First operand 400 states and 1369 transitions. Second operand 9 states. [2020-02-10 19:47:44,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:44,451 INFO L93 Difference]: Finished difference Result 677 states and 1963 transitions. [2020-02-10 19:47:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:44,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:44,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:44,454 INFO L225 Difference]: With dead ends: 677 [2020-02-10 19:47:44,454 INFO L226 Difference]: Without dead ends: 661 [2020-02-10 19:47:44,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 19:47:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-02-10 19:47:44,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 406. [2020-02-10 19:47:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-02-10 19:47:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1379 transitions. [2020-02-10 19:47:44,464 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1379 transitions. Word has length 22 [2020-02-10 19:47:44,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:44,464 INFO L479 AbstractCegarLoop]: Abstraction has 406 states and 1379 transitions. [2020-02-10 19:47:44,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1379 transitions. [2020-02-10 19:47:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:44,464 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:44,464 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:44,465 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 19:47:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:44,465 INFO L82 PathProgramCache]: Analyzing trace with hash -258300086, now seen corresponding path program 568 times [2020-02-10 19:47:44,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:44,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362922556] [2020-02-10 19:47:44,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:44,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 19:47:44,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362922556] [2020-02-10 19:47:44,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:44,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:44,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586813032] [2020-02-10 19:47:44,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:44,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:44,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:44,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:44,761 INFO L87 Difference]: Start difference. First operand 406 states and 1379 transitions. Second operand 9 states. [2020-02-10 19:47:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:44,871 INFO L93 Difference]: Finished difference Result 674 states and 1952 transitions. [2020-02-10 19:47:44,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:44,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:44,873 INFO L225 Difference]: With dead ends: 674 [2020-02-10 19:47:44,873 INFO L226 Difference]: Without dead ends: 655 [2020-02-10 19:47:44,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 19:47:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2020-02-10 19:47:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 400. [2020-02-10 19:47:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-02-10 19:47:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1363 transitions. [2020-02-10 19:47:44,883 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1363 transitions. Word has length 22 [2020-02-10 19:47:44,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:44,883 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 1363 transitions. [2020-02-10 19:47:44,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1363 transitions. [2020-02-10 19:47:44,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:44,884 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:44,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 19:47:44,884 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 19:47:44,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:44,884 INFO L82 PathProgramCache]: Analyzing trace with hash 32315784, now seen corresponding path program 569 times [2020-02-10 19:47:44,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:44,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818751907] [2020-02-10 19:47:44,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:45,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 19:47:45,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818751907] [2020-02-10 19:47:45,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:45,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:45,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406701] [2020-02-10 19:47:45,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:45,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:45,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:45,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:45,188 INFO L87 Difference]: Start difference. First operand 400 states and 1363 transitions. Second operand 9 states. [2020-02-10 19:47:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:45,303 INFO L93 Difference]: Finished difference Result 672 states and 1949 transitions. [2020-02-10 19:47:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:45,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:45,305 INFO L225 Difference]: With dead ends: 672 [2020-02-10 19:47:45,305 INFO L226 Difference]: Without dead ends: 658 [2020-02-10 19:47:45,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-02-10 19:47:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 405. [2020-02-10 19:47:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-02-10 19:47:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1372 transitions. [2020-02-10 19:47:45,315 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1372 transitions. Word has length 22 [2020-02-10 19:47:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:45,315 INFO L479 AbstractCegarLoop]: Abstraction has 405 states and 1372 transitions. [2020-02-10 19:47:45,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1372 transitions. [2020-02-10 19:47:45,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:45,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:45,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 19:47:45,315 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 19:47:45,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:45,316 INFO L82 PathProgramCache]: Analyzing trace with hash 87727044, now seen corresponding path program 570 times [2020-02-10 19:47:45,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:45,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724464698] [2020-02-10 19:47:45,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:45,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 19:47:45,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724464698] [2020-02-10 19:47:45,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:45,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:45,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935585233] [2020-02-10 19:47:45,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:45,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:45,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:45,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:45,615 INFO L87 Difference]: Start difference. First operand 405 states and 1372 transitions. Second operand 9 states. [2020-02-10 19:47:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:45,739 INFO L93 Difference]: Finished difference Result 671 states and 1942 transitions. [2020-02-10 19:47:45,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:45,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:45,741 INFO L225 Difference]: With dead ends: 671 [2020-02-10 19:47:45,741 INFO L226 Difference]: Without dead ends: 645 [2020-02-10 19:47:45,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 19:47:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-02-10 19:47:45,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 392. [2020-02-10 19:47:45,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1346 transitions. [2020-02-10 19:47:45,751 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1346 transitions. Word has length 22 [2020-02-10 19:47:45,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:45,752 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1346 transitions. [2020-02-10 19:47:45,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:45,752 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1346 transitions. [2020-02-10 19:47:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:45,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:45,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 19:47:45,752 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 19:47:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:45,753 INFO L82 PathProgramCache]: Analyzing trace with hash 757609128, now seen corresponding path program 571 times [2020-02-10 19:47:45,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:45,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137210486] [2020-02-10 19:47:45,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:46,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 19:47:46,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137210486] [2020-02-10 19:47:46,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:46,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:46,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843803965] [2020-02-10 19:47:46,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:46,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:46,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:46,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:46,034 INFO L87 Difference]: Start difference. First operand 392 states and 1346 transitions. Second operand 9 states. [2020-02-10 19:47:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:46,141 INFO L93 Difference]: Finished difference Result 640 states and 1879 transitions. [2020-02-10 19:47:46,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:46,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:46,143 INFO L225 Difference]: With dead ends: 640 [2020-02-10 19:47:46,144 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 19:47:46,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 19:47:46,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 396. [2020-02-10 19:47:46,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:47:46,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1356 transitions. [2020-02-10 19:47:46,154 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1356 transitions. Word has length 22 [2020-02-10 19:47:46,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:46,154 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1356 transitions. [2020-02-10 19:47:46,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:46,154 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1356 transitions. [2020-02-10 19:47:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:46,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:46,155 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:46,155 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 19:47:46,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:46,155 INFO L82 PathProgramCache]: Analyzing trace with hash -160341062, now seen corresponding path program 572 times [2020-02-10 19:47:46,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:46,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975856403] [2020-02-10 19:47:46,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:46,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975856403] [2020-02-10 19:47:46,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:46,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:46,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573658328] [2020-02-10 19:47:46,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:46,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:46,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:46,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:46,436 INFO L87 Difference]: Start difference. First operand 396 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:47:46,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:46,551 INFO L93 Difference]: Finished difference Result 644 states and 1885 transitions. [2020-02-10 19:47:46,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:46,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:46,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:46,553 INFO L225 Difference]: With dead ends: 644 [2020-02-10 19:47:46,553 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 19:47:46,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 19:47:46,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 394. [2020-02-10 19:47:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1351 transitions. [2020-02-10 19:47:46,563 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1351 transitions. Word has length 22 [2020-02-10 19:47:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:46,563 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1351 transitions. [2020-02-10 19:47:46,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1351 transitions. [2020-02-10 19:47:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:46,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:46,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 19:47:46,564 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 19:47:46,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:46,564 INFO L82 PathProgramCache]: Analyzing trace with hash -315476252, now seen corresponding path program 573 times [2020-02-10 19:47:46,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:46,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844210190] [2020-02-10 19:47:46,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:46,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 19:47:46,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844210190] [2020-02-10 19:47:46,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:46,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:46,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924254126] [2020-02-10 19:47:46,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:46,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:46,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:46,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:46,853 INFO L87 Difference]: Start difference. First operand 394 states and 1351 transitions. Second operand 9 states. [2020-02-10 19:47:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:46,975 INFO L93 Difference]: Finished difference Result 639 states and 1875 transitions. [2020-02-10 19:47:46,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:46,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:46,977 INFO L225 Difference]: With dead ends: 639 [2020-02-10 19:47:46,977 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 19:47: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 19:47:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 19:47:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 396. [2020-02-10 19:47:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:47:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1354 transitions. [2020-02-10 19:47:46,988 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1354 transitions. Word has length 22 [2020-02-10 19:47:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:46,988 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1354 transitions. [2020-02-10 19:47:46,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1354 transitions. [2020-02-10 19:47:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:46,989 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:46,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 19:47:46,989 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 19:47:46,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash 255978554, now seen corresponding path program 574 times [2020-02-10 19:47:46,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:46,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434003849] [2020-02-10 19:47:46,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:47,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 19:47:47,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434003849] [2020-02-10 19:47:47,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:47,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:47,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547921784] [2020-02-10 19:47:47,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:47,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:47,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:47,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:47,271 INFO L87 Difference]: Start difference. First operand 396 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:47:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:47,393 INFO L93 Difference]: Finished difference Result 642 states and 1879 transitions. [2020-02-10 19:47:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:47,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:47,395 INFO L225 Difference]: With dead ends: 642 [2020-02-10 19:47:47,395 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 19:47:47,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 19:47:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 19:47:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 394. [2020-02-10 19:47:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1349 transitions. [2020-02-10 19:47:47,405 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1349 transitions. Word has length 22 [2020-02-10 19:47:47,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:47,405 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1349 transitions. [2020-02-10 19:47:47,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:47,405 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1349 transitions. [2020-02-10 19:47:47,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:47,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:47,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 19:47:47,406 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 19:47:47,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:47,406 INFO L82 PathProgramCache]: Analyzing trace with hash 374888740, now seen corresponding path program 575 times [2020-02-10 19:47:47,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:47,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993116820] [2020-02-10 19:47:47,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:47,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 19:47:47,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993116820] [2020-02-10 19:47:47,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:47,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:47,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201170306] [2020-02-10 19:47:47,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:47,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:47,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:47,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:47,704 INFO L87 Difference]: Start difference. First operand 394 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:47:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:47,809 INFO L93 Difference]: Finished difference Result 650 states and 1898 transitions. [2020-02-10 19:47:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:47,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:47,811 INFO L225 Difference]: With dead ends: 650 [2020-02-10 19:47:47,812 INFO L226 Difference]: Without dead ends: 636 [2020-02-10 19:47:47,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 19:47:47,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-02-10 19:47:47,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 399. [2020-02-10 19:47:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:47:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1358 transitions. [2020-02-10 19:47:47,821 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1358 transitions. Word has length 22 [2020-02-10 19:47:47,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:47,821 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1358 transitions. [2020-02-10 19:47:47,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1358 transitions. [2020-02-10 19:47:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:47,822 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:47,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 19:47:47,822 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 19:47:47,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:47,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1864293736, now seen corresponding path program 576 times [2020-02-10 19:47:47,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:47,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586121961] [2020-02-10 19:47:47,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:48,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 19:47:48,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586121961] [2020-02-10 19:47:48,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:48,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:48,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697515433] [2020-02-10 19:47:48,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:48,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:48,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:48,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:48,121 INFO L87 Difference]: Start difference. First operand 399 states and 1358 transitions. Second operand 9 states. [2020-02-10 19:47:48,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:48,234 INFO L93 Difference]: Finished difference Result 649 states and 1891 transitions. [2020-02-10 19:47:48,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:48,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:48,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:48,236 INFO L225 Difference]: With dead ends: 649 [2020-02-10 19:47:48,236 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 19:47:48,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 19:47:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 19:47:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 387. [2020-02-10 19:47:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:47:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-02-10 19:47:48,247 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-02-10 19:47:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:48,247 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-02-10 19:47:48,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-02-10 19:47:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:48,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:48,248 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:48,248 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 19:47:48,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:48,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1447260328, now seen corresponding path program 577 times [2020-02-10 19:47:48,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:48,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974194625] [2020-02-10 19:47:48,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:48,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 19:47:48,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974194625] [2020-02-10 19:47:48,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:48,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:48,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127835600] [2020-02-10 19:47:48,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:48,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:48,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:48,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:48,554 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:47:48,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:48,655 INFO L93 Difference]: Finished difference Result 586 states and 1743 transitions. [2020-02-10 19:47:48,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:48,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:48,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:48,657 INFO L225 Difference]: With dead ends: 586 [2020-02-10 19:47:48,657 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:47:48,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:47:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 390. [2020-02-10 19:47:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1344 transitions. [2020-02-10 19:47:48,667 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1344 transitions. Word has length 22 [2020-02-10 19:47:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:48,667 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1344 transitions. [2020-02-10 19:47:48,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1344 transitions. [2020-02-10 19:47:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:48,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:48,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 19:47:48,668 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 19:47:48,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:48,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1236766010, now seen corresponding path program 578 times [2020-02-10 19:47:48,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:48,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445538117] [2020-02-10 19:47:48,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:48,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445538117] [2020-02-10 19:47:48,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:48,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:48,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053378743] [2020-02-10 19:47:48,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:48,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:48,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:48,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:48,968 INFO L87 Difference]: Start difference. First operand 390 states and 1344 transitions. Second operand 9 states. [2020-02-10 19:47:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:49,087 INFO L93 Difference]: Finished difference Result 587 states and 1744 transitions. [2020-02-10 19:47:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:49,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:49,089 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:47:49,089 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:47:49,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 19:47:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:47:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2020-02-10 19:47:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:47:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1342 transitions. [2020-02-10 19:47:49,098 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1342 transitions. Word has length 22 [2020-02-10 19:47:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:49,099 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1342 transitions. [2020-02-10 19:47:49,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1342 transitions. [2020-02-10 19:47:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:49,099 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:49,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 19:47:49,099 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 19:47:49,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:49,100 INFO L82 PathProgramCache]: Analyzing trace with hash -234576582, now seen corresponding path program 579 times [2020-02-10 19:47:49,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:49,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595058784] [2020-02-10 19:47:49,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:49,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 19:47:49,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595058784] [2020-02-10 19:47:49,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:49,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:49,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111800405] [2020-02-10 19:47:49,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:49,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:49,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:49,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:49,397 INFO L87 Difference]: Start difference. First operand 389 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:47:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:49,489 INFO L93 Difference]: Finished difference Result 590 states and 1750 transitions. [2020-02-10 19:47:49,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:49,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:49,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:49,491 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:47:49,491 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 19:47:49,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:49,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 19:47:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 390. [2020-02-10 19:47:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-02-10 19:47:49,501 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-02-10 19:47:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:49,501 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-02-10 19:47:49,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-02-10 19:47:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:49,502 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:49,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:49,502 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 19:47:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:49,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1310287738, now seen corresponding path program 580 times [2020-02-10 19:47:49,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:49,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720870213] [2020-02-10 19:47:49,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:49,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 19:47:49,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720870213] [2020-02-10 19:47:49,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:49,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:49,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983792280] [2020-02-10 19:47:49,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:49,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:49,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:49,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:49,791 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:47:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:49,907 INFO L93 Difference]: Finished difference Result 595 states and 1759 transitions. [2020-02-10 19:47:49,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:49,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:49,909 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:47:49,909 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:47:49,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:47:49,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 389. [2020-02-10 19:47:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:47:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-02-10 19:47:49,920 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-02-10 19:47:49,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:49,920 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-02-10 19:47:49,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-02-10 19:47:49,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:49,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:49,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 19:47:49,921 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 19:47:49,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:49,921 INFO L82 PathProgramCache]: Analyzing trace with hash -224073478, now seen corresponding path program 581 times [2020-02-10 19:47:49,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:49,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334198690] [2020-02-10 19:47:49,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:50,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334198690] [2020-02-10 19:47:50,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:50,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:50,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118109537] [2020-02-10 19:47:50,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:50,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:50,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:50,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:50,205 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-02-10 19:47:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:50,313 INFO L93 Difference]: Finished difference Result 593 states and 1756 transitions. [2020-02-10 19:47:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:50,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:50,315 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:47:50,315 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:47:50,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 19:47:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:47:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 391. [2020-02-10 19:47:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:47:50,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1344 transitions. [2020-02-10 19:47:50,325 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1344 transitions. Word has length 22 [2020-02-10 19:47:50,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:50,325 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1344 transitions. [2020-02-10 19:47:50,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:50,325 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1344 transitions. [2020-02-10 19:47:50,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:50,326 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:50,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 19:47:50,326 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 19:47:50,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:50,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1384241704, now seen corresponding path program 582 times [2020-02-10 19:47:50,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:50,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791292600] [2020-02-10 19:47:50,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:50,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791292600] [2020-02-10 19:47:50,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:50,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:50,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712462207] [2020-02-10 19:47:50,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:50,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:50,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:50,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:50,615 INFO L87 Difference]: Start difference. First operand 391 states and 1344 transitions. Second operand 9 states. [2020-02-10 19:47:50,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:50,723 INFO L93 Difference]: Finished difference Result 597 states and 1762 transitions. [2020-02-10 19:47:50,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:50,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:50,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:50,725 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:47:50,725 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:47:50,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 19:47:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:47:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 388. [2020-02-10 19:47:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:47:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1339 transitions. [2020-02-10 19:47:50,734 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1339 transitions. Word has length 22 [2020-02-10 19:47:50,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:50,734 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1339 transitions. [2020-02-10 19:47:50,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1339 transitions. [2020-02-10 19:47:50,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:50,735 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:50,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 19:47:50,735 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 19:47:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:50,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1004361188, now seen corresponding path program 583 times [2020-02-10 19:47:50,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:50,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086825576] [2020-02-10 19:47:50,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:51,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 19:47:51,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086825576] [2020-02-10 19:47:51,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:51,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:51,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718531216] [2020-02-10 19:47:51,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:51,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:51,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:51,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:51,049 INFO L87 Difference]: Start difference. First operand 388 states and 1339 transitions. Second operand 9 states. [2020-02-10 19:47:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:51,172 INFO L93 Difference]: Finished difference Result 585 states and 1740 transitions. [2020-02-10 19:47:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:51,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:51,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:51,174 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:47:51,174 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:47:51,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 19:47:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:47:51,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 390. [2020-02-10 19:47:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-02-10 19:47:51,184 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-02-10 19:47:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:51,184 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-02-10 19:47:51,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-02-10 19:47:51,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:51,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:51,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 19:47:51,185 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 19:47:51,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:51,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1679665150, now seen corresponding path program 584 times [2020-02-10 19:47:51,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:51,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272405319] [2020-02-10 19:47:51,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:51,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272405319] [2020-02-10 19:47:51,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:51,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:51,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595396066] [2020-02-10 19:47:51,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:51,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:51,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:51,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:51,501 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:47:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:51,624 INFO L93 Difference]: Finished difference Result 586 states and 1741 transitions. [2020-02-10 19:47:51,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:51,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:51,626 INFO L225 Difference]: With dead ends: 586 [2020-02-10 19:47:51,626 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:47:51,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:51,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:47:51,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 389. [2020-02-10 19:47:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:47:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-02-10 19:47:51,636 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-02-10 19:47:51,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:51,636 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-02-10 19:47:51,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-02-10 19:47:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:51,636 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:51,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 19:47:51,637 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 19:47:51,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:51,637 INFO L82 PathProgramCache]: Analyzing trace with hash 416615866, now seen corresponding path program 585 times [2020-02-10 19:47:51,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:51,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052532121] [2020-02-10 19:47:51,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:51,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 19:47:51,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052532121] [2020-02-10 19:47:51,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:51,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:51,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792398726] [2020-02-10 19:47:51,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:51,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:51,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:51,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:51,936 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-02-10 19:47:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:52,026 INFO L93 Difference]: Finished difference Result 588 states and 1745 transitions. [2020-02-10 19:47:52,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:52,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:52,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:52,028 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:47:52,028 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:47:52,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 19:47:52,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:47:52,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 390. [2020-02-10 19:47:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1342 transitions. [2020-02-10 19:47:52,039 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1342 transitions. Word has length 22 [2020-02-10 19:47:52,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:52,039 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1342 transitions. [2020-02-10 19:47:52,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1342 transitions. [2020-02-10 19:47:52,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:52,039 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:52,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 19:47:52,040 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 19:47:52,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:52,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1732180670, now seen corresponding path program 586 times [2020-02-10 19:47:52,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:52,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777566261] [2020-02-10 19:47:52,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:52,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 19:47:52,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777566261] [2020-02-10 19:47:52,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:52,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:52,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477420969] [2020-02-10 19:47:52,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:52,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:52,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:52,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:52,339 INFO L87 Difference]: Start difference. First operand 390 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:47:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:52,463 INFO L93 Difference]: Finished difference Result 592 states and 1752 transitions. [2020-02-10 19:47:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:52,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:52,465 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:47:52,465 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:47:52,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 19:47:52,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:47:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 389. [2020-02-10 19:47:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:47:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-02-10 19:47:52,476 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-02-10 19:47:52,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:52,476 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-02-10 19:47:52,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:52,476 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-02-10 19:47:52,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:52,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:52,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 19:47:52,477 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 19:47:52,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:52,477 INFO L82 PathProgramCache]: Analyzing trace with hash 427118970, now seen corresponding path program 587 times [2020-02-10 19:47:52,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:52,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291307656] [2020-02-10 19:47:52,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:52,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 19:47:52,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291307656] [2020-02-10 19:47:52,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:52,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:52,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910023572] [2020-02-10 19:47:52,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:52,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:52,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:52,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:52,769 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:47:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:52,883 INFO L93 Difference]: Finished difference Result 591 states and 1751 transitions. [2020-02-10 19:47:52,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:52,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:52,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:52,885 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:47:52,885 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 19:47:52,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 19:47:52,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 19:47:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 391. [2020-02-10 19:47:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:47:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1343 transitions. [2020-02-10 19:47:52,895 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1343 transitions. Word has length 22 [2020-02-10 19:47:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:52,895 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1343 transitions. [2020-02-10 19:47:52,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1343 transitions. [2020-02-10 19:47:52,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:52,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:52,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:52,896 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 19:47:52,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:52,896 INFO L82 PathProgramCache]: Analyzing trace with hash 962348772, now seen corresponding path program 588 times [2020-02-10 19:47:52,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:52,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483778457] [2020-02-10 19:47:52,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:53,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 19:47:53,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483778457] [2020-02-10 19:47:53,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:53,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:53,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941772436] [2020-02-10 19:47:53,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:53,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:53,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:53,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:53,199 INFO L87 Difference]: Start difference. First operand 391 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:47:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:53,320 INFO L93 Difference]: Finished difference Result 594 states and 1755 transitions. [2020-02-10 19:47:53,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:53,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:53,322 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:47:53,323 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:47:53,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:47:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 388. [2020-02-10 19:47:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:47:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-02-10 19:47:53,333 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-02-10 19:47:53,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:53,333 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-02-10 19:47:53,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-02-10 19:47:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:53,334 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:53,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 19:47:53,334 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 19:47:53,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:53,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1274812380, now seen corresponding path program 589 times [2020-02-10 19:47:53,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:53,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164169892] [2020-02-10 19:47:53,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:53,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 19:47:53,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164169892] [2020-02-10 19:47:53,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:53,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:53,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145957774] [2020-02-10 19:47:53,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:53,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:53,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:53,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:53,621 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:47:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:53,721 INFO L93 Difference]: Finished difference Result 596 states and 1764 transitions. [2020-02-10 19:47:53,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:53,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:53,723 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:47:53,723 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:47:53,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 19:47:53,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:47:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 390. [2020-02-10 19:47:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:53,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1342 transitions. [2020-02-10 19:47:53,732 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1342 transitions. Word has length 22 [2020-02-10 19:47:53,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:53,732 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1342 transitions. [2020-02-10 19:47:53,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:53,733 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1342 transitions. [2020-02-10 19:47:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:53,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:53,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 19:47:53,733 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 19:47:53,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:53,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1944443760, now seen corresponding path program 590 times [2020-02-10 19:47:53,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:53,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203641645] [2020-02-10 19:47:53,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:54,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 19:47:54,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203641645] [2020-02-10 19:47:54,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:54,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:54,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72691315] [2020-02-10 19:47:54,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:54,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:54,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:54,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:54,019 INFO L87 Difference]: Start difference. First operand 390 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:47:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:54,135 INFO L93 Difference]: Finished difference Result 601 states and 1773 transitions. [2020-02-10 19:47:54,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:54,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:54,137 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:47:54,137 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:47:54,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 19:47:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:47:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 389. [2020-02-10 19:47:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:47:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-02-10 19:47:54,147 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-02-10 19:47:54,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:54,147 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-02-10 19:47:54,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:54,147 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-02-10 19:47:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:54,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:54,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 19:47:54,148 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 19:47:54,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:54,148 INFO L82 PathProgramCache]: Analyzing trace with hash -180720792, now seen corresponding path program 591 times [2020-02-10 19:47:54,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:54,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922179206] [2020-02-10 19:47:54,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:54,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 19:47:54,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922179206] [2020-02-10 19:47:54,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:54,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:54,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208489545] [2020-02-10 19:47:54,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:54,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:54,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:54,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:54,454 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:47:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:54,561 INFO L93 Difference]: Finished difference Result 595 states and 1761 transitions. [2020-02-10 19:47:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:54,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:54,563 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:47:54,564 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:47:54,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:47:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 390. [2020-02-10 19:47:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1341 transitions. [2020-02-10 19:47:54,574 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1341 transitions. Word has length 22 [2020-02-10 19:47:54,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:54,574 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1341 transitions. [2020-02-10 19:47:54,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1341 transitions. [2020-02-10 19:47:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:54,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:54,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 19:47:54,575 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 19:47:54,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:54,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1965449968, now seen corresponding path program 592 times [2020-02-10 19:47:54,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:54,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799550340] [2020-02-10 19:47:54,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:54,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 19:47:54,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799550340] [2020-02-10 19:47:54,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:54,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:54,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754278554] [2020-02-10 19:47:54,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:54,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:54,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:54,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:54,868 INFO L87 Difference]: Start difference. First operand 390 states and 1341 transitions. Second operand 9 states. [2020-02-10 19:47:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:54,995 INFO L93 Difference]: Finished difference Result 599 states and 1768 transitions. [2020-02-10 19:47:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:54,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:54,997 INFO L225 Difference]: With dead ends: 599 [2020-02-10 19:47:54,997 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:47:54,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 19:47:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:47:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 389. [2020-02-10 19:47:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:47:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1339 transitions. [2020-02-10 19:47:55,010 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1339 transitions. Word has length 22 [2020-02-10 19:47:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:55,010 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1339 transitions. [2020-02-10 19:47:55,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1339 transitions. [2020-02-10 19:47:55,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:55,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:55,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 19:47:55,011 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 19:47:55,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:55,012 INFO L82 PathProgramCache]: Analyzing trace with hash -243739416, now seen corresponding path program 593 times [2020-02-10 19:47:55,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:55,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6039196] [2020-02-10 19:47:55,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:55,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 19:47:55,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6039196] [2020-02-10 19:47:55,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:55,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:55,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511013999] [2020-02-10 19:47:55,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:55,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:55,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:55,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:55,310 INFO L87 Difference]: Start difference. First operand 389 states and 1339 transitions. Second operand 9 states. [2020-02-10 19:47:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:55,433 INFO L93 Difference]: Finished difference Result 609 states and 1792 transitions. [2020-02-10 19:47:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:55,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:55,435 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:47:55,435 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 19:47:55,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 19:47:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 394. [2020-02-10 19:47:55,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:47:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1348 transitions. [2020-02-10 19:47:55,446 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1348 transitions. Word has length 22 [2020-02-10 19:47:55,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:55,446 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1348 transitions. [2020-02-10 19:47:55,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:55,447 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1348 transitions. [2020-02-10 19:47:55,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:55,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:55,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 19:47:55,447 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 19:47:55,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:55,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1316824796, now seen corresponding path program 594 times [2020-02-10 19:47:55,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:55,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488799318] [2020-02-10 19:47:55,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:55,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 19:47:55,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488799318] [2020-02-10 19:47:55,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:55,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:55,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465559975] [2020-02-10 19:47:55,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:55,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:55,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:55,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:55,751 INFO L87 Difference]: Start difference. First operand 394 states and 1348 transitions. Second operand 9 states. [2020-02-10 19:47:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:55,872 INFO L93 Difference]: Finished difference Result 608 states and 1785 transitions. [2020-02-10 19:47:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:55,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:55,874 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:47:55,874 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 19:47:55,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 19:47:55,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 19:47:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 388. [2020-02-10 19:47:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:47:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1337 transitions. [2020-02-10 19:47:55,884 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1337 transitions. Word has length 22 [2020-02-10 19:47:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:55,884 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1337 transitions. [2020-02-10 19:47:55,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1337 transitions. [2020-02-10 19:47:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:55,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:55,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 19:47:55,885 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 19:47:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:55,885 INFO L82 PathProgramCache]: Analyzing trace with hash 661724802, now seen corresponding path program 595 times [2020-02-10 19:47:55,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:55,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371144156] [2020-02-10 19:47:55,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:56,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 19:47:56,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371144156] [2020-02-10 19:47:56,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:56,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:56,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672027785] [2020-02-10 19:47:56,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:56,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:56,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:56,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:56,179 INFO L87 Difference]: Start difference. First operand 388 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:47:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:56,299 INFO L93 Difference]: Finished difference Result 603 states and 1782 transitions. [2020-02-10 19:47:56,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:56,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:56,301 INFO L225 Difference]: With dead ends: 603 [2020-02-10 19:47:56,301 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:47:56,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 19:47:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:47:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 392. [2020-02-10 19:47:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1347 transitions. [2020-02-10 19:47:56,310 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1347 transitions. Word has length 22 [2020-02-10 19:47:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:56,310 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1347 transitions. [2020-02-10 19:47:56,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1347 transitions. [2020-02-10 19:47:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:56,311 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:56,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:56,311 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 19:47:56,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:56,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2024927312, now seen corresponding path program 596 times [2020-02-10 19:47:56,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:56,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995515072] [2020-02-10 19:47:56,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:56,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995515072] [2020-02-10 19:47:56,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:56,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:56,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627634712] [2020-02-10 19:47:56,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:56,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:56,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:56,622 INFO L87 Difference]: Start difference. First operand 392 states and 1347 transitions. Second operand 9 states. [2020-02-10 19:47:56,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:56,746 INFO L93 Difference]: Finished difference Result 607 states and 1788 transitions. [2020-02-10 19:47:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:56,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:56,748 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:47:56,748 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:47:56,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 19:47:56,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:47:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 390. [2020-02-10 19:47:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1342 transitions. [2020-02-10 19:47:56,759 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1342 transitions. Word has length 22 [2020-02-10 19:47:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:56,759 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1342 transitions. [2020-02-10 19:47:56,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1342 transitions. [2020-02-10 19:47:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:56,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:56,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 19:47:56,760 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 19:47:56,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:56,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1755816390, now seen corresponding path program 597 times [2020-02-10 19:47:56,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:56,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225454066] [2020-02-10 19:47:56,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:57,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 19:47:57,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225454066] [2020-02-10 19:47:57,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:57,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:57,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803773214] [2020-02-10 19:47:57,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:57,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:57,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:57,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:57,048 INFO L87 Difference]: Start difference. First operand 390 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:47:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:57,171 INFO L93 Difference]: Finished difference Result 602 states and 1778 transitions. [2020-02-10 19:47:57,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:57,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:57,173 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:47:57,173 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:47:57,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:47:57,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 392. [2020-02-10 19:47:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:47:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1345 transitions. [2020-02-10 19:47:57,183 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1345 transitions. Word has length 22 [2020-02-10 19:47:57,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:57,183 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1345 transitions. [2020-02-10 19:47:57,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:57,183 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1345 transitions. [2020-02-10 19:47:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:57,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:57,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 19:47:57,184 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 19:47:57,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:57,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2003921104, now seen corresponding path program 598 times [2020-02-10 19:47:57,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:57,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079018816] [2020-02-10 19:47:57,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:57,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 19:47:57,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079018816] [2020-02-10 19:47:57,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:57,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:57,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800919247] [2020-02-10 19:47:57,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:57,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:57,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:57,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:57,481 INFO L87 Difference]: Start difference. First operand 392 states and 1345 transitions. Second operand 9 states. [2020-02-10 19:47:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:57,596 INFO L93 Difference]: Finished difference Result 605 states and 1782 transitions. [2020-02-10 19:47:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:57,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:57,598 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:47:57,599 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:47:57,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 19:47:57,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:47:57,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 390. [2020-02-10 19:47:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:47:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1340 transitions. [2020-02-10 19:47:57,608 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1340 transitions. Word has length 22 [2020-02-10 19:47:57,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:57,608 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1340 transitions. [2020-02-10 19:47:57,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1340 transitions. [2020-02-10 19:47:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:57,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:57,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:57,609 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 19:47:57,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:57,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1682294662, now seen corresponding path program 599 times [2020-02-10 19:47:57,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:57,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774577695] [2020-02-10 19:47:57,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47: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 19:47:57,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774577695] [2020-02-10 19:47:57,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:57,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:57,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602450495] [2020-02-10 19:47:57,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:57,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:57,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:57,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:57,901 INFO L87 Difference]: Start difference. First operand 390 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:47:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:58,011 INFO L93 Difference]: Finished difference Result 613 states and 1801 transitions. [2020-02-10 19:47:58,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:58,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:58,013 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:47:58,014 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:47:58,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:47:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 395. [2020-02-10 19:47:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:47:58,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1349 transitions. [2020-02-10 19:47:58,024 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1349 transitions. Word has length 22 [2020-02-10 19:47:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:58,024 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1349 transitions. [2020-02-10 19:47:58,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1349 transitions. [2020-02-10 19:47:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:58,024 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:58,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 19:47:58,025 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 19:47:58,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:58,025 INFO L82 PathProgramCache]: Analyzing trace with hash 609209282, now seen corresponding path program 600 times [2020-02-10 19:47:58,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:58,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022187873] [2020-02-10 19:47:58,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:58,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 19:47:58,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022187873] [2020-02-10 19:47:58,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:58,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:58,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392673309] [2020-02-10 19:47:58,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:58,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:58,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:58,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:58,329 INFO L87 Difference]: Start difference. First operand 395 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:47:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:58,476 INFO L93 Difference]: Finished difference Result 612 states and 1794 transitions. [2020-02-10 19:47:58,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:58,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:58,478 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:47:58,478 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:47:58,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 19:47:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:47:58,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 383. [2020-02-10 19:47:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:47:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1328 transitions. [2020-02-10 19:47:58,489 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1328 transitions. Word has length 22 [2020-02-10 19:47:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:58,489 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1328 transitions. [2020-02-10 19:47:58,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1328 transitions. [2020-02-10 19:47:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:58,490 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:58,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 19:47:58,490 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 19:47:58,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:58,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1147153134, now seen corresponding path program 601 times [2020-02-10 19:47:58,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:58,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001729269] [2020-02-10 19:47:58,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:58,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 19:47:58,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001729269] [2020-02-10 19:47:58,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:58,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:58,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790024273] [2020-02-10 19:47:58,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:58,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:58,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:58,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:58,778 INFO L87 Difference]: Start difference. First operand 383 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:47:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:58,904 INFO L93 Difference]: Finished difference Result 543 states and 1635 transitions. [2020-02-10 19:47:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:58,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:58,906 INFO L225 Difference]: With dead ends: 543 [2020-02-10 19:47:58,906 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 19:47:58,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 19:47:58,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 19:47:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 387. [2020-02-10 19:47:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:47:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1341 transitions. [2020-02-10 19:47:58,915 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1341 transitions. Word has length 22 [2020-02-10 19:47:58,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:58,916 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1341 transitions. [2020-02-10 19:47:58,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1341 transitions. [2020-02-10 19:47:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:58,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:58,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 19:47:58,916 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 19:47:58,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:58,917 INFO L82 PathProgramCache]: Analyzing trace with hash -298363876, now seen corresponding path program 602 times [2020-02-10 19:47:58,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:58,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333080955] [2020-02-10 19:47:58,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:59,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333080955] [2020-02-10 19:47:59,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:59,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:59,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035959087] [2020-02-10 19:47:59,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:59,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:59,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:59,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:59,217 INFO L87 Difference]: Start difference. First operand 387 states and 1341 transitions. Second operand 9 states. [2020-02-10 19:47:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:59,320 INFO L93 Difference]: Finished difference Result 541 states and 1630 transitions. [2020-02-10 19:47:59,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:59,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:59,322 INFO L225 Difference]: With dead ends: 541 [2020-02-10 19:47:59,322 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:47:59,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 19:47:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:47:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 386. [2020-02-10 19:47:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:47:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1339 transitions. [2020-02-10 19:47:59,332 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1339 transitions. Word has length 22 [2020-02-10 19:47:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:59,333 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1339 transitions. [2020-02-10 19:47:59,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1339 transitions. [2020-02-10 19:47:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:59,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:59,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 19:47:59,333 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 19:47:59,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:59,334 INFO L82 PathProgramCache]: Analyzing trace with hash -453284720, now seen corresponding path program 603 times [2020-02-10 19:47:59,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:59,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155673933] [2020-02-10 19:47:59,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:59,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 19:47:59,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155673933] [2020-02-10 19:47:59,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:59,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:47:59,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085205882] [2020-02-10 19:47:59,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:47:59,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:59,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:47:59,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:59,620 INFO L87 Difference]: Start difference. First operand 386 states and 1339 transitions. Second operand 9 states. [2020-02-10 19:47:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:59,730 INFO L93 Difference]: Finished difference Result 545 states and 1639 transitions. [2020-02-10 19:47:59,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:47:59,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:47:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:59,732 INFO L225 Difference]: With dead ends: 545 [2020-02-10 19:47:59,732 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 19:47:59,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 19:47:59,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 19:47:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 388. [2020-02-10 19:47:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:47:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-02-10 19:47:59,742 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-02-10 19:47:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:59,743 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-02-10 19:47:59,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:47:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-02-10 19:47:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:47:59,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:59,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 19:47:59,743 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 19:47:59,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:59,744 INFO L82 PathProgramCache]: Analyzing trace with hash -200191968, now seen corresponding path program 604 times [2020-02-10 19:47:59,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:59,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111078797] [2020-02-10 19:47:59,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:00,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 19:48:00,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111078797] [2020-02-10 19:48:00,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:00,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:00,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415822715] [2020-02-10 19:48:00,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:00,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:00,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:00,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:00,052 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:48:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:00,179 INFO L93 Difference]: Finished difference Result 544 states and 1635 transitions. [2020-02-10 19:48:00,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:00,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:00,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:00,181 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:48:00,181 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 19:48:00,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 19:48:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 19:48:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 386. [2020-02-10 19:48:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1338 transitions. [2020-02-10 19:48:00,190 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1338 transitions. Word has length 22 [2020-02-10 19:48:00,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:00,191 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1338 transitions. [2020-02-10 19:48:00,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1338 transitions. [2020-02-10 19:48:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:00,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:00,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:00,191 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 19:48:00,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:00,192 INFO L82 PathProgramCache]: Analyzing trace with hash 795727712, now seen corresponding path program 605 times [2020-02-10 19:48:00,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:00,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695824405] [2020-02-10 19:48:00,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:00,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 19:48:00,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695824405] [2020-02-10 19:48:00,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:00,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:00,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373191675] [2020-02-10 19:48:00,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:00,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:00,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:00,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:00,492 INFO L87 Difference]: Start difference. First operand 386 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:48:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:00,601 INFO L93 Difference]: Finished difference Result 540 states and 1627 transitions. [2020-02-10 19:48:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:00,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:00,605 INFO L225 Difference]: With dead ends: 540 [2020-02-10 19:48:00,605 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:48:00,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 19:48:00,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:48:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 387. [2020-02-10 19:48:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-02-10 19:48:00,615 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-02-10 19:48:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:00,615 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-02-10 19:48:00,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-02-10 19:48:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:00,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:00,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 19:48:00,616 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 19:48:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:00,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1888298626, now seen corresponding path program 606 times [2020-02-10 19:48:00,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:00,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116048011] [2020-02-10 19:48:00,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:00,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 19:48:00,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116048011] [2020-02-10 19:48:00,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:00,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:00,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123931976] [2020-02-10 19:48:00,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:00,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:00,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:00,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:00,912 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-02-10 19:48:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:01,022 INFO L93 Difference]: Finished difference Result 541 states and 1628 transitions. [2020-02-10 19:48:01,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:01,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:01,024 INFO L225 Difference]: With dead ends: 541 [2020-02-10 19:48:01,024 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 19:48: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 19:48:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 19:48:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 385. [2020-02-10 19:48:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:48:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1336 transitions. [2020-02-10 19:48:01,043 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1336 transitions. Word has length 22 [2020-02-10 19:48:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:01,044 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1336 transitions. [2020-02-10 19:48:01,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1336 transitions. [2020-02-10 19:48:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:01,044 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:01,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:01,044 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 19:48:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash 549816476, now seen corresponding path program 607 times [2020-02-10 19:48:01,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:01,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720038865] [2020-02-10 19:48:01,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:01,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 19:48:01,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720038865] [2020-02-10 19:48:01,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:01,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:01,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156004917] [2020-02-10 19:48:01,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:01,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:01,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:01,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:01,345 INFO L87 Difference]: Start difference. First operand 385 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:48:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:01,479 INFO L93 Difference]: Finished difference Result 548 states and 1645 transitions. [2020-02-10 19:48:01,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:01,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:01,481 INFO L225 Difference]: With dead ends: 548 [2020-02-10 19:48:01,481 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:48:01,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 19:48:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:48:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 387. [2020-02-10 19:48:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-02-10 19:48:01,491 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-02-10 19:48:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:01,491 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-02-10 19:48:01,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-02-10 19:48:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:01,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:01,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 19:48:01,492 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 19:48:01,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:01,492 INFO L82 PathProgramCache]: Analyzing trace with hash -895700534, now seen corresponding path program 608 times [2020-02-10 19:48:01,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:01,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661275160] [2020-02-10 19:48:01,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:01,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 19:48:01,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661275160] [2020-02-10 19:48:01,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:01,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:01,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867014908] [2020-02-10 19:48:01,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:01,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:01,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:01,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:01,785 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:48:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:01,870 INFO L93 Difference]: Finished difference Result 546 states and 1640 transitions. [2020-02-10 19:48:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:01,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:01,872 INFO L225 Difference]: With dead ends: 546 [2020-02-10 19:48:01,872 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 19:48:01,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 19:48:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 19:48:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 386. [2020-02-10 19:48:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1338 transitions. [2020-02-10 19:48:01,883 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1338 transitions. Word has length 22 [2020-02-10 19:48:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:01,883 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1338 transitions. [2020-02-10 19:48:01,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1338 transitions. [2020-02-10 19:48:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:01,884 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:01,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 19:48:01,884 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 19:48:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1562509008, now seen corresponding path program 609 times [2020-02-10 19:48:01,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:01,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142396600] [2020-02-10 19:48:01,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:02,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 19:48:02,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142396600] [2020-02-10 19:48:02,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:02,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:02,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860466971] [2020-02-10 19:48:02,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:02,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:02,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:02,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:02,172 INFO L87 Difference]: Start difference. First operand 386 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:48:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:02,275 INFO L93 Difference]: Finished difference Result 555 states and 1660 transitions. [2020-02-10 19:48:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:02,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:02,277 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:48:02,277 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:48:02,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 19:48:02,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:48:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 389. [2020-02-10 19:48:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:48:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1343 transitions. [2020-02-10 19:48:02,288 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1343 transitions. Word has length 22 [2020-02-10 19:48:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:02,288 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1343 transitions. [2020-02-10 19:48:02,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1343 transitions. [2020-02-10 19:48:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:02,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:02,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 19:48:02,289 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 19:48:02,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:02,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1346423158, now seen corresponding path program 610 times [2020-02-10 19:48:02,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:02,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633713038] [2020-02-10 19:48:02,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:02,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 19:48:02,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633713038] [2020-02-10 19:48:02,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:02,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:02,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921608459] [2020-02-10 19:48:02,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:02,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:02,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:02,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:02,571 INFO L87 Difference]: Start difference. First operand 389 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:48:02,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:02,686 INFO L93 Difference]: Finished difference Result 558 states and 1663 transitions. [2020-02-10 19:48:02,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:02,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:02,688 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:48:02,688 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:48:02,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 19:48:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:48:02,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 386. [2020-02-10 19:48:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-02-10 19:48:02,698 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-02-10 19:48:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:02,698 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-02-10 19:48:02,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-02-10 19:48:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:02,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:02,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 19:48:02,699 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 19:48:02,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1483445856, now seen corresponding path program 611 times [2020-02-10 19:48:02,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:02,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329834755] [2020-02-10 19:48:02,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:02,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 19:48:02,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329834755] [2020-02-10 19:48:02,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:02,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:02,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937128877] [2020-02-10 19:48:02,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:02,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:02,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:02,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:02,991 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:48:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:03,084 INFO L93 Difference]: Finished difference Result 549 states and 1645 transitions. [2020-02-10 19:48:03,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:03,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:03,086 INFO L225 Difference]: With dead ends: 549 [2020-02-10 19:48:03,086 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 19:48:03,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 19:48:03,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 19:48:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 387. [2020-02-10 19:48:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-02-10 19:48:03,096 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-02-10 19:48:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:03,096 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-02-10 19:48:03,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-02-10 19:48:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:03,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:03,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 19:48:03,097 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 19:48:03,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:03,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1735810284, now seen corresponding path program 612 times [2020-02-10 19:48:03,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:03,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343911014] [2020-02-10 19:48:03,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:03,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 19:48:03,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343911014] [2020-02-10 19:48:03,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:03,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:03,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469726859] [2020-02-10 19:48:03,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:03,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:03,365 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:48:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:03,497 INFO L93 Difference]: Finished difference Result 554 states and 1654 transitions. [2020-02-10 19:48:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:03,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:03,499 INFO L225 Difference]: With dead ends: 554 [2020-02-10 19:48:03,499 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 19:48:03,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 19:48:03,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 19:48:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 385. [2020-02-10 19:48:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:48:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1335 transitions. [2020-02-10 19:48:03,509 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1335 transitions. Word has length 22 [2020-02-10 19:48:03,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:03,509 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1335 transitions. [2020-02-10 19:48:03,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:03,509 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1335 transitions. [2020-02-10 19:48:03,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:03,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48: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 19:48:03,510 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 19:48:03,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:03,510 INFO L82 PathProgramCache]: Analyzing trace with hash 875412700, now seen corresponding path program 613 times [2020-02-10 19:48:03,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:03,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699592976] [2020-02-10 19:48:03,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:03,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 19:48:03,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699592976] [2020-02-10 19:48:03,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:03,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:03,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767305699] [2020-02-10 19:48:03,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:03,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:03,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:03,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:03,794 INFO L87 Difference]: Start difference. First operand 385 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:48:03,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:03,921 INFO L93 Difference]: Finished difference Result 554 states and 1661 transitions. [2020-02-10 19:48:03,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:03,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:03,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:03,923 INFO L225 Difference]: With dead ends: 554 [2020-02-10 19:48:03,923 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 19:48:03,923 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 19:48:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 389. [2020-02-10 19:48:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:48:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1345 transitions. [2020-02-10 19:48:03,934 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1345 transitions. Word has length 22 [2020-02-10 19:48:03,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:03,934 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1345 transitions. [2020-02-10 19:48:03,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1345 transitions. [2020-02-10 19:48:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:03,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:03,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 19:48:03,935 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 19:48:03,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1128505452, now seen corresponding path program 614 times [2020-02-10 19:48:03,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:03,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172355609] [2020-02-10 19:48:03,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:04,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:04,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172355609] [2020-02-10 19:48:04,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:04,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:04,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797607888] [2020-02-10 19:48:04,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:04,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:04,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:04,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:04,223 INFO L87 Difference]: Start difference. First operand 389 states and 1345 transitions. Second operand 9 states. [2020-02-10 19:48:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:04,343 INFO L93 Difference]: Finished difference Result 553 states and 1657 transitions. [2020-02-10 19:48:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:04,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:04,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:04,345 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:48:04,345 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:48:04,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 19:48:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:48:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 387. [2020-02-10 19:48:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-02-10 19:48:04,355 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-02-10 19:48:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:04,355 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-02-10 19:48:04,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-02-10 19:48:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:04,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:04,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 19:48:04,356 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 19:48:04,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:04,356 INFO L82 PathProgramCache]: Analyzing trace with hash -806424210, now seen corresponding path program 615 times [2020-02-10 19:48:04,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:04,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926228616] [2020-02-10 19:48:04,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:04,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 19:48:04,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926228616] [2020-02-10 19:48:04,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:04,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:04,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336586726] [2020-02-10 19:48:04,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:04,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:04,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:04,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:04,635 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:48:04,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:04,769 INFO L93 Difference]: Finished difference Result 559 states and 1670 transitions. [2020-02-10 19:48:04,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:04,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:04,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:04,771 INFO L225 Difference]: With dead ends: 559 [2020-02-10 19:48:04,771 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:48:04,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 19:48:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:48:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 390. [2020-02-10 19:48:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:48:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1345 transitions. [2020-02-10 19:48:04,780 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1345 transitions. Word has length 22 [2020-02-10 19:48:04,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:04,780 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1345 transitions. [2020-02-10 19:48:04,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1345 transitions. [2020-02-10 19:48:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:04,781 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:04,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 19:48:04,781 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 19:48:04,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:04,781 INFO L82 PathProgramCache]: Analyzing trace with hash 579610920, now seen corresponding path program 616 times [2020-02-10 19:48:04,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:04,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268307266] [2020-02-10 19:48:04,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:05,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 19:48:05,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268307266] [2020-02-10 19:48:05,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:05,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:05,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557031289] [2020-02-10 19:48:05,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:05,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:05,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:05,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:05,062 INFO L87 Difference]: Start difference. First operand 390 states and 1345 transitions. Second operand 9 states. [2020-02-10 19:48:05,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:05,180 INFO L93 Difference]: Finished difference Result 562 states and 1673 transitions. [2020-02-10 19:48:05,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:05,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:05,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:05,182 INFO L225 Difference]: With dead ends: 562 [2020-02-10 19:48:05,182 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:48:05,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 19:48:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:48:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 387. [2020-02-10 19:48:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-02-10 19:48:05,192 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-02-10 19:48:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:05,192 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-02-10 19:48:05,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-02-10 19:48:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:05,193 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:05,193 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:05,193 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 19:48:05,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:05,193 INFO L82 PathProgramCache]: Analyzing trace with hash 587595596, now seen corresponding path program 617 times [2020-02-10 19:48:05,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:05,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706956205] [2020-02-10 19:48:05,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:05,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 19:48:05,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706956205] [2020-02-10 19:48:05,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:05,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:05,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202541271] [2020-02-10 19:48:05,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:05,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:05,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:05,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:05,468 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:48:05,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:05,585 INFO L93 Difference]: Finished difference Result 556 states and 1661 transitions. [2020-02-10 19:48:05,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:05,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:05,587 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:48:05,587 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:48:05,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 19:48:05,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:48:05,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 389. [2020-02-10 19:48:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:48:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-02-10 19:48:05,603 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-02-10 19:48:05,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:05,604 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-02-10 19:48:05,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-02-10 19:48:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:05,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:05,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 19:48:05,604 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 19:48:05,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:05,605 INFO L82 PathProgramCache]: Analyzing trace with hash -330354594, now seen corresponding path program 618 times [2020-02-10 19:48:05,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:05,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822910222] [2020-02-10 19:48:05,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:05,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 19:48:05,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822910222] [2020-02-10 19:48:05,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:05,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:05,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952024991] [2020-02-10 19:48:05,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:05,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:05,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:05,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:05,879 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-02-10 19:48:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:06,003 INFO L93 Difference]: Finished difference Result 560 states and 1667 transitions. [2020-02-10 19:48:06,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:06,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:06,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:06,005 INFO L225 Difference]: With dead ends: 560 [2020-02-10 19:48:06,005 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 19:48:06,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 19:48:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 19:48:06,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 385. [2020-02-10 19:48:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:48:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1334 transitions. [2020-02-10 19:48:06,015 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1334 transitions. Word has length 22 [2020-02-10 19:48:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:06,015 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1334 transitions. [2020-02-10 19:48:06,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1334 transitions. [2020-02-10 19:48:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:06,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:06,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 19:48:06,016 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 19:48:06,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:06,016 INFO L82 PathProgramCache]: Analyzing trace with hash -244508086, now seen corresponding path program 619 times [2020-02-10 19:48:06,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:06,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260624491] [2020-02-10 19:48:06,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48: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 19:48:06,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260624491] [2020-02-10 19:48:06,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:06,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:06,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918239168] [2020-02-10 19:48:06,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:06,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:06,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:06,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:06,311 INFO L87 Difference]: Start difference. First operand 385 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:48:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:06,409 INFO L93 Difference]: Finished difference Result 543 states and 1632 transitions. [2020-02-10 19:48:06,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:06,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:06,411 INFO L225 Difference]: With dead ends: 543 [2020-02-10 19:48:06,411 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 19:48:06,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 19:48:06,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 19:48:06,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 387. [2020-02-10 19:48:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-02-10 19:48:06,419 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-02-10 19:48:06,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:06,420 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-02-10 19:48:06,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:06,420 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-02-10 19:48:06,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:06,420 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:06,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 19:48:06,420 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 19:48:06,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:06,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1366432872, now seen corresponding path program 620 times [2020-02-10 19:48:06,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:06,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794071363] [2020-02-10 19:48:06,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:06,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 19:48:06,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794071363] [2020-02-10 19:48:06,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:06,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:06,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890680333] [2020-02-10 19:48:06,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:06,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:06,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:06,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:06,716 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:48:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:06,843 INFO L93 Difference]: Finished difference Result 544 states and 1633 transitions. [2020-02-10 19:48:06,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:06,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:06,845 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:48:06,845 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:48:06,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:48:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 386. [2020-02-10 19:48:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1336 transitions. [2020-02-10 19:48:06,855 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1336 transitions. Word has length 22 [2020-02-10 19:48:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:06,855 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1336 transitions. [2020-02-10 19:48:06,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1336 transitions. [2020-02-10 19:48:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:06,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:06,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 19:48:06,856 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 19:48:06,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:06,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1926344996, now seen corresponding path program 621 times [2020-02-10 19:48:06,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:06,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344051083] [2020-02-10 19:48:06,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:07,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 19:48:07,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344051083] [2020-02-10 19:48:07,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:07,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:07,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706593291] [2020-02-10 19:48:07,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:07,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:07,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:07,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:07,146 INFO L87 Difference]: Start difference. First operand 386 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:48:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:07,238 INFO L93 Difference]: Finished difference Result 547 states and 1639 transitions. [2020-02-10 19:48:07,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:07,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:07,240 INFO L225 Difference]: With dead ends: 547 [2020-02-10 19:48:07,240 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 19:48:07,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 19:48:07,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 387. [2020-02-10 19:48:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-02-10 19:48:07,251 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-02-10 19:48:07,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:07,251 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-02-10 19:48:07,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-02-10 19:48:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:07,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48: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 19:48:07,252 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 19:48:07,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:07,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1292911144, now seen corresponding path program 622 times [2020-02-10 19:48:07,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:07,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807836951] [2020-02-10 19:48:07,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48: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 19:48:07,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807836951] [2020-02-10 19:48:07,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:07,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:07,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373167136] [2020-02-10 19:48:07,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:07,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:07,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:07,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:07,524 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:48:07,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:07,639 INFO L93 Difference]: Finished difference Result 552 states and 1648 transitions. [2020-02-10 19:48:07,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:07,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:07,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:07,641 INFO L225 Difference]: With dead ends: 552 [2020-02-10 19:48:07,641 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:48:07,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 19:48:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:48:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 386. [2020-02-10 19:48:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-02-10 19:48:07,651 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-02-10 19:48:07,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:07,651 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-02-10 19:48:07,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-02-10 19:48:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:07,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:07,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 19:48:07,652 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 19:48:07,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:07,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1915841892, now seen corresponding path program 623 times [2020-02-10 19:48:07,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:07,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549226555] [2020-02-10 19:48:07,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:07,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 19:48:07,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549226555] [2020-02-10 19:48:07,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:07,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:07,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574878955] [2020-02-10 19:48:07,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:07,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:07,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:07,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:07,925 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:48:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:08,047 INFO L93 Difference]: Finished difference Result 550 states and 1645 transitions. [2020-02-10 19:48:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:08,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:08,049 INFO L225 Difference]: With dead ends: 550 [2020-02-10 19:48:08,049 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 19:48:08,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 19:48:08,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 388. [2020-02-10 19:48:08,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:08,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-02-10 19:48:08,059 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-02-10 19:48:08,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:08,060 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-02-10 19:48:08,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-02-10 19:48:08,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:08,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:08,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 19:48:08,060 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 19:48:08,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:08,061 INFO L82 PathProgramCache]: Analyzing trace with hash -307526710, now seen corresponding path program 624 times [2020-02-10 19:48:08,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:08,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984897677] [2020-02-10 19:48:08,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:08,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 19:48:08,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984897677] [2020-02-10 19:48:08,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:08,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:08,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788975410] [2020-02-10 19:48:08,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:08,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:08,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:08,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:08,342 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:48:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:08,459 INFO L93 Difference]: Finished difference Result 554 states and 1651 transitions. [2020-02-10 19:48:08,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:08,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:08,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:08,461 INFO L225 Difference]: With dead ends: 554 [2020-02-10 19:48:08,461 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 19:48:08,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 19:48:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 384. [2020-02-10 19:48:08,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:48:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1332 transitions. [2020-02-10 19:48:08,470 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1332 transitions. Word has length 22 [2020-02-10 19:48:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:08,470 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1332 transitions. [2020-02-10 19:48:08,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:08,470 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1332 transitions. [2020-02-10 19:48:08,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:08,471 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:08,471 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:08,471 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 19:48:08,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:08,471 INFO L82 PathProgramCache]: Analyzing trace with hash 302181682, now seen corresponding path program 625 times [2020-02-10 19:48:08,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:08,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287822959] [2020-02-10 19:48:08,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:08,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 19:48:08,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287822959] [2020-02-10 19:48:08,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:08,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:08,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33565723] [2020-02-10 19:48:08,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:08,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:08,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:08,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:08,767 INFO L87 Difference]: Start difference. First operand 384 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:48:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:08,888 INFO L93 Difference]: Finished difference Result 542 states and 1632 transitions. [2020-02-10 19:48:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:08,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:08,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:08,890 INFO L225 Difference]: With dead ends: 542 [2020-02-10 19:48:08,890 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:48:08,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:48:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 387. [2020-02-10 19:48:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-02-10 19:48:08,900 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-02-10 19:48:08,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:08,900 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-02-10 19:48:08,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:08,900 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-02-10 19:48:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:08,901 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:08,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 19:48:08,901 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 19:48:08,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:08,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1143335328, now seen corresponding path program 626 times [2020-02-10 19:48:08,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:08,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322923736] [2020-02-10 19:48:08,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:09,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 19:48:09,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322923736] [2020-02-10 19:48:09,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:09,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:09,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984376188] [2020-02-10 19:48:09,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:09,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:09,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:09,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:09,204 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:48:09,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:09,291 INFO L93 Difference]: Finished difference Result 540 states and 1627 transitions. [2020-02-10 19:48:09,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:09,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:09,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:09,293 INFO L225 Difference]: With dead ends: 540 [2020-02-10 19:48:09,293 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 19:48:09,293 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 19:48:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 386. [2020-02-10 19:48:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1338 transitions. [2020-02-10 19:48:09,302 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1338 transitions. Word has length 22 [2020-02-10 19:48:09,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:09,302 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1338 transitions. [2020-02-10 19:48:09,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1338 transitions. [2020-02-10 19:48:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:09,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:09,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 19:48:09,308 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 19:48:09,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:09,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1298256172, now seen corresponding path program 627 times [2020-02-10 19:48:09,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:09,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480296835] [2020-02-10 19:48:09,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:09,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 19:48:09,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480296835] [2020-02-10 19:48:09,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:09,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:09,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012125637] [2020-02-10 19:48:09,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:09,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:09,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:09,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:09,600 INFO L87 Difference]: Start difference. First operand 386 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:48:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:09,722 INFO L93 Difference]: Finished difference Result 544 states and 1636 transitions. [2020-02-10 19:48:09,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:09,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:09,724 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:48:09,724 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:48:09,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:48:09,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 388. [2020-02-10 19:48:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1341 transitions. [2020-02-10 19:48:09,734 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1341 transitions. Word has length 22 [2020-02-10 19:48:09,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:09,734 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1341 transitions. [2020-02-10 19:48:09,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1341 transitions. [2020-02-10 19:48:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:09,735 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:09,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 19:48:09,735 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 19:48:09,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:09,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1045163420, now seen corresponding path program 628 times [2020-02-10 19:48:09,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:09,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339953045] [2020-02-10 19:48:09,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:10,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 19:48:10,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339953045] [2020-02-10 19:48:10,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:10,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:10,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410503976] [2020-02-10 19:48:10,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:10,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:10,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:10,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:10,031 INFO L87 Difference]: Start difference. First operand 388 states and 1341 transitions. Second operand 9 states. [2020-02-10 19:48:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:10,142 INFO L93 Difference]: Finished difference Result 543 states and 1632 transitions. [2020-02-10 19:48:10,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:10,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:10,144 INFO L225 Difference]: With dead ends: 543 [2020-02-10 19:48:10,144 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:48:10,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:48:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 386. [2020-02-10 19:48:10,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-02-10 19:48:10,154 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-02-10 19:48:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:10,155 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-02-10 19:48:10,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:10,155 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-02-10 19:48:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:10,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:10,155 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:10,155 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 19:48:10,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash -49243740, now seen corresponding path program 629 times [2020-02-10 19:48:10,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:10,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917479405] [2020-02-10 19:48:10,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:10,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 19:48:10,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917479405] [2020-02-10 19:48:10,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:10,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:10,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413931123] [2020-02-10 19:48:10,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:10,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:10,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:10,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:10,461 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:48:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:10,559 INFO L93 Difference]: Finished difference Result 539 states and 1624 transitions. [2020-02-10 19:48:10,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:10,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:10,561 INFO L225 Difference]: With dead ends: 539 [2020-02-10 19:48:10,561 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 19:48:10,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:10,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 19:48:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 387. [2020-02-10 19:48:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-02-10 19:48:10,571 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-02-10 19:48:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:10,571 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-02-10 19:48:10,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-02-10 19:48:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:10,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:10,571 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:10,572 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 19:48:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1561697218, now seen corresponding path program 630 times [2020-02-10 19:48:10,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:10,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284928657] [2020-02-10 19:48:10,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:10,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 19:48:10,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284928657] [2020-02-10 19:48:10,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:10,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:10,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170608375] [2020-02-10 19:48:10,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:10,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:10,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:10,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:10,880 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:48:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:10,999 INFO L93 Difference]: Finished difference Result 540 states and 1625 transitions. [2020-02-10 19:48:10,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:10,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:10,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:11,001 INFO L225 Difference]: With dead ends: 540 [2020-02-10 19:48:11,001 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 19:48:11,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 19:48:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 385. [2020-02-10 19:48:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:48:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1335 transitions. [2020-02-10 19:48:11,010 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1335 transitions. Word has length 22 [2020-02-10 19:48:11,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:11,010 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1335 transitions. [2020-02-10 19:48:11,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1335 transitions. [2020-02-10 19:48:11,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:11,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:11,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 19:48:11,011 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 19:48:11,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:11,012 INFO L82 PathProgramCache]: Analyzing trace with hash -738054116, now seen corresponding path program 631 times [2020-02-10 19:48:11,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:11,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740196137] [2020-02-10 19:48:11,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:11,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 19:48:11,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740196137] [2020-02-10 19:48:11,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:11,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:11,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087140434] [2020-02-10 19:48:11,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:11,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:11,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:11,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:11,309 INFO L87 Difference]: Start difference. First operand 385 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:48:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:11,431 INFO L93 Difference]: Finished difference Result 546 states and 1640 transitions. [2020-02-10 19:48:11,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:11,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:11,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:11,433 INFO L225 Difference]: With dead ends: 546 [2020-02-10 19:48:11,433 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:48:11,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:48:11,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 387. [2020-02-10 19:48:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-02-10 19:48:11,443 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-02-10 19:48:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:11,443 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-02-10 19:48:11,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-02-10 19:48:11,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:11,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:11,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 19:48:11,444 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 19:48:11,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:11,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2111396170, now seen corresponding path program 632 times [2020-02-10 19:48:11,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:11,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303942955] [2020-02-10 19:48:11,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:11,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 19:48:11,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303942955] [2020-02-10 19:48:11,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:11,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:11,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68964302] [2020-02-10 19:48:11,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:11,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:11,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:11,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:11,749 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-02-10 19:48:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:11,846 INFO L93 Difference]: Finished difference Result 544 states and 1635 transitions. [2020-02-10 19:48:11,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:11,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:11,847 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:48:11,848 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 19:48:11,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 19:48:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 19:48:11,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 386. [2020-02-10 19:48:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-02-10 19:48:11,858 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-02-10 19:48:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:11,858 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-02-10 19:48:11,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-02-10 19:48:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:11,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:11,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 19:48:11,859 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 19:48:11,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:11,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1368730004, now seen corresponding path program 633 times [2020-02-10 19:48:11,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:11,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231315974] [2020-02-10 19:48:11,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:12,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 19:48:12,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231315974] [2020-02-10 19:48:12,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:12,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:12,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968986065] [2020-02-10 19:48:12,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:12,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:12,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:12,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:12,141 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:48:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:12,271 INFO L93 Difference]: Finished difference Result 552 states and 1653 transitions. [2020-02-10 19:48:12,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:12,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:12,272 INFO L225 Difference]: With dead ends: 552 [2020-02-10 19:48:12,273 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:48:12,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:48:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 389. [2020-02-10 19:48:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:48:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1342 transitions. [2020-02-10 19:48:12,282 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1342 transitions. Word has length 22 [2020-02-10 19:48:12,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:12,282 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1342 transitions. [2020-02-10 19:48:12,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1342 transitions. [2020-02-10 19:48:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:12,283 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:12,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:12,283 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 19:48:12,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:12,283 INFO L82 PathProgramCache]: Analyzing trace with hash 586730762, now seen corresponding path program 634 times [2020-02-10 19:48:12,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:12,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383614648] [2020-02-10 19:48:12,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:12,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 19:48:12,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383614648] [2020-02-10 19:48:12,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:12,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:12,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69867944] [2020-02-10 19:48:12,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:12,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:12,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:12,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:12,565 INFO L87 Difference]: Start difference. First operand 389 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:48:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:12,680 INFO L93 Difference]: Finished difference Result 554 states and 1654 transitions. [2020-02-10 19:48:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:12,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:12,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:12,681 INFO L225 Difference]: With dead ends: 554 [2020-02-10 19:48:12,682 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 19:48:12,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:12,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 19:48:12,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 386. [2020-02-10 19:48:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1336 transitions. [2020-02-10 19:48:12,698 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1336 transitions. Word has length 22 [2020-02-10 19:48:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:12,699 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1336 transitions. [2020-02-10 19:48:12,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1336 transitions. [2020-02-10 19:48:12,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:12,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:12,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 19:48:12,699 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 19:48:12,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1677224860, now seen corresponding path program 635 times [2020-02-10 19:48:12,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:12,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907955899] [2020-02-10 19:48:12,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:12,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 19:48:12,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907955899] [2020-02-10 19:48:12,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:12,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:12,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600720025] [2020-02-10 19:48:12,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:12,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:12,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:12,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:12,975 INFO L87 Difference]: Start difference. First operand 386 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:48:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:13,076 INFO L93 Difference]: Finished difference Result 546 states and 1638 transitions. [2020-02-10 19:48:13,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:13,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:13,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:13,078 INFO L225 Difference]: With dead ends: 546 [2020-02-10 19:48:13,078 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:48:13,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:48:13,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 387. [2020-02-10 19:48:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-02-10 19:48:13,089 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-02-10 19:48:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:13,089 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-02-10 19:48:13,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-02-10 19:48:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:13,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48: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 19:48:13,090 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 19:48:13,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:13,090 INFO L82 PathProgramCache]: Analyzing trace with hash 468945900, now seen corresponding path program 636 times [2020-02-10 19:48:13,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:13,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887564900] [2020-02-10 19:48:13,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:13,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 19:48:13,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887564900] [2020-02-10 19:48:13,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:13,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:13,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025408387] [2020-02-10 19:48:13,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:13,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:13,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:13,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:13,375 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:48:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:13,497 INFO L93 Difference]: Finished difference Result 550 states and 1645 transitions. [2020-02-10 19:48:13,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:13,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:13,499 INFO L225 Difference]: With dead ends: 550 [2020-02-10 19:48:13,499 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:48:13,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 19:48:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:48:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 385. [2020-02-10 19:48:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:48:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1334 transitions. [2020-02-10 19:48:13,509 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1334 transitions. Word has length 22 [2020-02-10 19:48:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:13,509 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1334 transitions. [2020-02-10 19:48:13,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1334 transitions. [2020-02-10 19:48:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:13,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:13,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 19:48:13,510 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 19:48:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash -412457892, now seen corresponding path program 637 times [2020-02-10 19:48:13,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:13,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718967112] [2020-02-10 19:48:13,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:13,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 19:48:13,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718967112] [2020-02-10 19:48:13,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:13,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:13,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217506784] [2020-02-10 19:48:13,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:13,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:13,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:13,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:13,798 INFO L87 Difference]: Start difference. First operand 385 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:48:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:13,905 INFO L93 Difference]: Finished difference Result 552 states and 1656 transitions. [2020-02-10 19:48:13,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:13,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:13,907 INFO L225 Difference]: With dead ends: 552 [2020-02-10 19:48:13,907 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:48:13,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 19:48:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:48:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 389. [2020-02-10 19:48:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:48:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1344 transitions. [2020-02-10 19:48:13,917 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1344 transitions. Word has length 22 [2020-02-10 19:48:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:13,917 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1344 transitions. [2020-02-10 19:48:13,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1344 transitions. [2020-02-10 19:48:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:13,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:13,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 19:48:13,918 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 19:48:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:13,918 INFO L82 PathProgramCache]: Analyzing trace with hash -159365140, now seen corresponding path program 638 times [2020-02-10 19:48:13,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:13,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494613488] [2020-02-10 19:48:13,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:14,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 19:48:14,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494613488] [2020-02-10 19:48:14,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:14,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:14,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009648755] [2020-02-10 19:48:14,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:14,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:14,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:14,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:14,203 INFO L87 Difference]: Start difference. First operand 389 states and 1344 transitions. Second operand 9 states. [2020-02-10 19:48:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:14,321 INFO L93 Difference]: Finished difference Result 551 states and 1652 transitions. [2020-02-10 19:48:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:14,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:14,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:14,322 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:48:14,323 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 19:48:14,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 19:48:14,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 387. [2020-02-10 19:48:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-02-10 19:48:14,332 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-02-10 19:48:14,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:14,332 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-02-10 19:48:14,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-02-10 19:48:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:14,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:14,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 19:48:14,333 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 19:48:14,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:14,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1000203214, now seen corresponding path program 639 times [2020-02-10 19:48:14,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:14,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712533071] [2020-02-10 19:48:14,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:14,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 19:48:14,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712533071] [2020-02-10 19:48:14,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:14,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:14,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515280849] [2020-02-10 19:48:14,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:14,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:14,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:14,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:14,612 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-02-10 19:48:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:14,732 INFO L93 Difference]: Finished difference Result 556 states and 1663 transitions. [2020-02-10 19:48:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:14,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:14,734 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:48:14,734 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:48:14,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:48:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 390. [2020-02-10 19:48:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:48:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1344 transitions. [2020-02-10 19:48:14,743 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1344 transitions. Word has length 22 [2020-02-10 19:48:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:14,744 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1344 transitions. [2020-02-10 19:48:14,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1344 transitions. [2020-02-10 19:48:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:14,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:14,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 19:48:14,744 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 19:48:14,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:14,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1782202456, now seen corresponding path program 640 times [2020-02-10 19:48:14,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:14,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954421335] [2020-02-10 19:48:14,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:15,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 19:48:15,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954421335] [2020-02-10 19:48:15,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:15,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:15,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985784644] [2020-02-10 19:48:15,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:15,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:15,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:15,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:15,046 INFO L87 Difference]: Start difference. First operand 390 states and 1344 transitions. Second operand 9 states. [2020-02-10 19:48:15,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:15,176 INFO L93 Difference]: Finished difference Result 558 states and 1664 transitions. [2020-02-10 19:48:15,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:15,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:15,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:15,178 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:48:15,178 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 19:48:15,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 19:48:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 19:48:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 387. [2020-02-10 19:48:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-02-10 19:48:15,187 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-02-10 19:48:15,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:15,187 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-02-10 19:48:15,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-02-10 19:48:15,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:15,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:15,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 19:48:15,188 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 19:48:15,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:15,188 INFO L82 PathProgramCache]: Analyzing trace with hash -679268788, now seen corresponding path program 641 times [2020-02-10 19:48:15,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:15,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610580853] [2020-02-10 19:48:15,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:15,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 19:48:15,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610580853] [2020-02-10 19:48:15,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:15,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:15,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321410364] [2020-02-10 19:48:15,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:15,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:15,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:15,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:15,468 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:48:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:15,587 INFO L93 Difference]: Finished difference Result 553 states and 1654 transitions. [2020-02-10 19:48:15,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:15,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:15,589 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:48:15,589 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 19:48:15,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 19:48:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 19:48:15,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 389. [2020-02-10 19:48:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:48:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-02-10 19:48:15,600 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-02-10 19:48:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:15,600 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-02-10 19:48:15,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-02-10 19:48:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:15,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:15,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 19:48:15,601 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 19:48:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:15,601 INFO L82 PathProgramCache]: Analyzing trace with hash -107813982, now seen corresponding path program 642 times [2020-02-10 19:48:15,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:15,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451792141] [2020-02-10 19:48:15,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:15,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 19:48:15,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451792141] [2020-02-10 19:48:15,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:15,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:15,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529376843] [2020-02-10 19:48:15,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:15,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:15,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:15,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:15,883 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:48:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:16,002 INFO L93 Difference]: Finished difference Result 556 states and 1658 transitions. [2020-02-10 19:48:16,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:16,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:16,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:16,004 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:48:16,004 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 19:48:16,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 19:48:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 19:48:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 385. [2020-02-10 19:48:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:48:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1333 transitions. [2020-02-10 19:48:16,014 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1333 transitions. Word has length 22 [2020-02-10 19:48:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:16,014 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1333 transitions. [2020-02-10 19:48:16,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:16,014 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1333 transitions. [2020-02-10 19:48:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:16,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48: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 19:48:16,015 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 19:48:16,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1532378678, now seen corresponding path program 643 times [2020-02-10 19:48:16,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:16,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240124026] [2020-02-10 19:48:16,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:16,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240124026] [2020-02-10 19:48:16,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:16,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:16,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422139708] [2020-02-10 19:48:16,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:16,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:16,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:16,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:16,317 INFO L87 Difference]: Start difference. First operand 385 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:48:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:16,403 INFO L93 Difference]: Finished difference Result 541 states and 1627 transitions. [2020-02-10 19:48:16,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:16,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:16,405 INFO L225 Difference]: With dead ends: 541 [2020-02-10 19:48:16,405 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 19:48:16,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 19:48:16,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 19:48:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 387. [2020-02-10 19:48:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-02-10 19:48:16,414 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-02-10 19:48:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:16,414 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-02-10 19:48:16,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-02-10 19:48:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:16,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:16,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 19:48:16,415 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 19:48:16,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:16,416 INFO L82 PathProgramCache]: Analyzing trace with hash 78562280, now seen corresponding path program 644 times [2020-02-10 19:48:16,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:16,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077032153] [2020-02-10 19:48:16,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:16,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077032153] [2020-02-10 19:48:16,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:16,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:16,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400114510] [2020-02-10 19:48:16,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:16,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:16,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:16,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:16,721 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:48:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:16,844 INFO L93 Difference]: Finished difference Result 542 states and 1628 transitions. [2020-02-10 19:48:16,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:16,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:16,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:16,846 INFO L225 Difference]: With dead ends: 542 [2020-02-10 19:48:16,846 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:48:16,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:16,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:48:16,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 386. [2020-02-10 19:48:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-02-10 19:48:16,856 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-02-10 19:48:16,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:16,856 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-02-10 19:48:16,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-02-10 19:48:16,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:16,857 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:16,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:16,857 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 19:48:16,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:16,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2120124000, now seen corresponding path program 645 times [2020-02-10 19:48:16,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:16,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062726577] [2020-02-10 19:48:16,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:17,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062726577] [2020-02-10 19:48:17,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:17,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:17,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972607373] [2020-02-10 19:48:17,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:17,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:17,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:17,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:17,150 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:48:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:17,241 INFO L93 Difference]: Finished difference Result 544 states and 1632 transitions. [2020-02-10 19:48:17,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:17,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:17,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:17,243 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:48:17,243 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:48:17,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:48:17,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 387. [2020-02-10 19:48:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-02-10 19:48:17,252 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-02-10 19:48:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:17,252 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-02-10 19:48:17,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-02-10 19:48:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:17,253 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:17,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 19:48:17,253 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 19:48:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:17,253 INFO L82 PathProgramCache]: Analyzing trace with hash 26046760, now seen corresponding path program 646 times [2020-02-10 19:48:17,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:17,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250337404] [2020-02-10 19:48:17,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:17,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 19:48:17,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250337404] [2020-02-10 19:48:17,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:17,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:17,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106892209] [2020-02-10 19:48:17,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:17,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:17,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:17,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:17,545 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:48:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:17,670 INFO L93 Difference]: Finished difference Result 548 states and 1639 transitions. [2020-02-10 19:48:17,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:17,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:17,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:17,672 INFO L225 Difference]: With dead ends: 548 [2020-02-10 19:48:17,672 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 19:48:17,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 19:48:17,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 19:48:17,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 386. [2020-02-10 19:48:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:17,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-02-10 19:48:17,682 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-02-10 19:48:17,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:17,682 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-02-10 19:48:17,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:17,682 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-02-10 19:48:17,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:17,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:17,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 19:48:17,683 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 19:48:17,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:17,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2109620896, now seen corresponding path program 647 times [2020-02-10 19:48:17,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:17,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961208082] [2020-02-10 19:48:17,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:17,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 19:48:17,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961208082] [2020-02-10 19:48:17,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:17,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:17,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767776719] [2020-02-10 19:48:17,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:17,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:17,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:17,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:17,976 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:48:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:18,095 INFO L93 Difference]: Finished difference Result 547 states and 1638 transitions. [2020-02-10 19:48:18,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:18,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:18,097 INFO L225 Difference]: With dead ends: 547 [2020-02-10 19:48:18,097 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:48:18,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:48:18,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 388. [2020-02-10 19:48:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1337 transitions. [2020-02-10 19:48:18,107 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1337 transitions. Word has length 22 [2020-02-10 19:48:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:18,107 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1337 transitions. [2020-02-10 19:48:18,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:18,107 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1337 transitions. [2020-02-10 19:48:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:18,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:18,108 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:18,108 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 19:48:18,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:18,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1574391094, now seen corresponding path program 648 times [2020-02-10 19:48:18,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:18,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75259043] [2020-02-10 19:48:18,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:18,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 19:48:18,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75259043] [2020-02-10 19:48:18,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:18,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:18,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401716474] [2020-02-10 19:48:18,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:18,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:18,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:18,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:18,396 INFO L87 Difference]: Start difference. First operand 388 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:48:18,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:18,514 INFO L93 Difference]: Finished difference Result 550 states and 1642 transitions. [2020-02-10 19:48:18,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:18,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:18,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:18,516 INFO L225 Difference]: With dead ends: 550 [2020-02-10 19:48:18,516 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:48:18,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 19:48:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:48:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 384. [2020-02-10 19:48:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:48:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1331 transitions. [2020-02-10 19:48:18,526 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1331 transitions. Word has length 22 [2020-02-10 19:48:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:18,526 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1331 transitions. [2020-02-10 19:48:18,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1331 transitions. [2020-02-10 19:48:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:18,527 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:18,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 19:48:18,527 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 19:48:18,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:18,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1632722190, now seen corresponding path program 649 times [2020-02-10 19:48:18,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:18,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250236826] [2020-02-10 19:48:18,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:18,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 19:48:18,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250236826] [2020-02-10 19:48:18,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:18,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:18,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140255365] [2020-02-10 19:48:18,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:18,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:18,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:18,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:18,802 INFO L87 Difference]: Start difference. First operand 384 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:48:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:18,928 INFO L93 Difference]: Finished difference Result 556 states and 1666 transitions. [2020-02-10 19:48:18,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:18,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:18,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:18,930 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:48:18,931 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:48:18,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 19:48:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:48:18,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 387. [2020-02-10 19:48:18,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-02-10 19:48:18,940 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-02-10 19:48:18,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:18,940 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-02-10 19:48:18,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-02-10 19:48:18,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:18,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:18,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 19:48:18,941 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 19:48:18,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:18,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1216728096, now seen corresponding path program 650 times [2020-02-10 19:48:18,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:18,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201065647] [2020-02-10 19:48:18,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:19,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 19:48:19,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201065647] [2020-02-10 19:48:19,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:19,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:19,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577500599] [2020-02-10 19:48:19,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:19,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:19,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:19,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:19,220 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-02-10 19:48:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:19,301 INFO L93 Difference]: Finished difference Result 554 states and 1661 transitions. [2020-02-10 19:48:19,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:19,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:19,303 INFO L225 Difference]: With dead ends: 554 [2020-02-10 19:48:19,303 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:48:19,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 19:48:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:48:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 386. [2020-02-10 19:48:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-02-10 19:48:19,313 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-02-10 19:48:19,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:19,313 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-02-10 19:48:19,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-02-10 19:48:19,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:19,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:19,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 19:48:19,313 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 19:48:19,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:19,314 INFO L82 PathProgramCache]: Analyzing trace with hash -620029658, now seen corresponding path program 651 times [2020-02-10 19:48:19,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:19,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846015343] [2020-02-10 19:48:19,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:19,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 19:48:19,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846015343] [2020-02-10 19:48:19,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:19,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:19,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915579218] [2020-02-10 19:48:19,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:19,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:19,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:19,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:19,580 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:48:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:19,705 INFO L93 Difference]: Finished difference Result 563 states and 1681 transitions. [2020-02-10 19:48:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:19,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:19,707 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:48:19,707 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:48:19,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 19:48:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:48:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 389. [2020-02-10 19:48:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:48:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1342 transitions. [2020-02-10 19:48:19,717 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1342 transitions. Word has length 22 [2020-02-10 19:48:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:19,717 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1342 transitions. [2020-02-10 19:48:19,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1342 transitions. [2020-02-10 19:48:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:19,718 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:19,718 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:19,718 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 19:48:19,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:19,718 INFO L82 PathProgramCache]: Analyzing trace with hash 766005472, now seen corresponding path program 652 times [2020-02-10 19:48:19,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:19,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076840142] [2020-02-10 19:48:19,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:19,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 19:48:19,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076840142] [2020-02-10 19:48:19,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:19,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:19,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736991129] [2020-02-10 19:48:19,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:19,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:19,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:19,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:19,987 INFO L87 Difference]: Start difference. First operand 389 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:48:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:20,107 INFO L93 Difference]: Finished difference Result 566 states and 1684 transitions. [2020-02-10 19:48:20,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:20,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:20,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:20,109 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:48:20,110 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 19:48:20,110 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:20,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 19:48:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 386. [2020-02-10 19:48:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1336 transitions. [2020-02-10 19:48:20,118 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1336 transitions. Word has length 22 [2020-02-10 19:48:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:20,119 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1336 transitions. [2020-02-10 19:48:20,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1336 transitions. [2020-02-10 19:48:20,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:20,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:20,119 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:20,119 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 19:48:20,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:20,119 INFO L82 PathProgramCache]: Analyzing trace with hash 628982774, now seen corresponding path program 653 times [2020-02-10 19:48:20,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:20,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118210009] [2020-02-10 19:48:20,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:20,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 19:48:20,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118210009] [2020-02-10 19:48:20,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:20,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:20,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983753565] [2020-02-10 19:48:20,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:20,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:20,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:20,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:20,383 INFO L87 Difference]: Start difference. First operand 386 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:48:20,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:20,473 INFO L93 Difference]: Finished difference Result 557 states and 1666 transitions. [2020-02-10 19:48:20,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:20,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:20,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:20,475 INFO L225 Difference]: With dead ends: 557 [2020-02-10 19:48:20,475 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:48:20,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 19:48:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:48:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 387. [2020-02-10 19:48:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-02-10 19:48:20,484 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-02-10 19:48:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:20,485 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-02-10 19:48:20,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-02-10 19:48:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:20,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:20,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 19:48:20,485 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 19:48:20,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:20,486 INFO L82 PathProgramCache]: Analyzing trace with hash -446728382, now seen corresponding path program 654 times [2020-02-10 19:48:20,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:20,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065109552] [2020-02-10 19:48:20,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:20,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 19:48:20,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065109552] [2020-02-10 19:48:20,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:20,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:20,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802023094] [2020-02-10 19:48:20,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:20,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:20,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:20,746 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:48:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:20,861 INFO L93 Difference]: Finished difference Result 562 states and 1675 transitions. [2020-02-10 19:48:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:20,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:20,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:20,863 INFO L225 Difference]: With dead ends: 562 [2020-02-10 19:48:20,863 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:48:20,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 19:48:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:48:20,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 385. [2020-02-10 19:48:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:48:20,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1334 transitions. [2020-02-10 19:48:20,873 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1334 transitions. Word has length 22 [2020-02-10 19:48:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:20,873 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1334 transitions. [2020-02-10 19:48:20,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1334 transitions. [2020-02-10 19:48:20,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:20,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:20,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 19:48:20,874 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 19:48:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:20,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2075621330, now seen corresponding path program 655 times [2020-02-10 19:48:20,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:20,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476608498] [2020-02-10 19:48:20,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:21,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 19:48:21,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476608498] [2020-02-10 19:48:21,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:21,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:21,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187447067] [2020-02-10 19:48:21,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:21,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:21,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:21,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:21,148 INFO L87 Difference]: Start difference. First operand 385 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:48:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:21,275 INFO L93 Difference]: Finished difference Result 555 states and 1663 transitions. [2020-02-10 19:48:21,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:21,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:21,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:21,277 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:48:21,277 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:48:21,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:48:21,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 387. [2020-02-10 19:48:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-02-10 19:48:21,287 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-02-10 19:48:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:21,287 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-02-10 19:48:21,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-02-10 19:48:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:21,287 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:21,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 19:48:21,288 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 19:48:21,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:21,288 INFO L82 PathProgramCache]: Analyzing trace with hash 773828956, now seen corresponding path program 656 times [2020-02-10 19:48:21,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:21,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169633184] [2020-02-10 19:48:21,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:21,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 19:48:21,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169633184] [2020-02-10 19:48:21,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:21,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:21,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279410888] [2020-02-10 19:48:21,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:21,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:21,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:21,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:21,585 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:48:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:21,672 INFO L93 Difference]: Finished difference Result 553 states and 1658 transitions. [2020-02-10 19:48:21,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:21,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:21,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:21,674 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:48:21,674 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 19:48:21,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 19:48:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 386. [2020-02-10 19:48:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1336 transitions. [2020-02-10 19:48:21,684 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1336 transitions. Word has length 22 [2020-02-10 19:48:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:21,684 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1336 transitions. [2020-02-10 19:48:21,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1336 transitions. [2020-02-10 19:48:21,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:21,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:21,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 19:48:21,685 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 19:48:21,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:21,685 INFO L82 PathProgramCache]: Analyzing trace with hash 31162790, now seen corresponding path program 657 times [2020-02-10 19:48:21,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:21,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779320900] [2020-02-10 19:48:21,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:21,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 19:48:21,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779320900] [2020-02-10 19:48:21,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:21,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:21,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980126718] [2020-02-10 19:48:21,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:21,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:21,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:21,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:21,950 INFO L87 Difference]: Start difference. First operand 386 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:48:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:22,077 INFO L93 Difference]: Finished difference Result 561 states and 1676 transitions. [2020-02-10 19:48:22,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:22,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:22,079 INFO L225 Difference]: With dead ends: 561 [2020-02-10 19:48:22,079 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 19:48:22,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 19:48:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 19:48:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 389. [2020-02-10 19:48:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:48:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-02-10 19:48:22,088 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-02-10 19:48:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:22,089 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-02-10 19:48:22,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-02-10 19:48:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:22,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:22,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 19:48:22,089 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 19:48:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:22,090 INFO L82 PathProgramCache]: Analyzing trace with hash -750836452, now seen corresponding path program 658 times [2020-02-10 19:48:22,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:22,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176925876] [2020-02-10 19:48:22,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:22,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 19:48:22,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176925876] [2020-02-10 19:48:22,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:22,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:22,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777488426] [2020-02-10 19:48:22,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:22,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:22,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:22,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:22,357 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-02-10 19:48:22,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:22,476 INFO L93 Difference]: Finished difference Result 563 states and 1677 transitions. [2020-02-10 19:48:22,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:22,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:22,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:22,478 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:48:22,478 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:48:22,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 19:48:22,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:48:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 386. [2020-02-10 19:48:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-02-10 19:48:22,487 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-02-10 19:48:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:22,487 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-02-10 19:48:22,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-02-10 19:48:22,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:22,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:22,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 19:48:22,488 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 19:48:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:22,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1280175222, now seen corresponding path program 659 times [2020-02-10 19:48:22,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:22,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107309569] [2020-02-10 19:48:22,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:22,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107309569] [2020-02-10 19:48:22,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:22,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:22,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674288098] [2020-02-10 19:48:22,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:22,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:22,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:22,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:22,757 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:48:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:22,841 INFO L93 Difference]: Finished difference Result 555 states and 1661 transitions. [2020-02-10 19:48:22,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:22,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:22,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:22,843 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:48:22,843 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:48:22,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 19:48:22,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:48:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 387. [2020-02-10 19:48:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-02-10 19:48:22,852 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-02-10 19:48:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:22,853 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-02-10 19:48:22,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-02-10 19:48:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:22,853 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:22,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 19:48:22,854 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 19:48:22,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:22,854 INFO L82 PathProgramCache]: Analyzing trace with hash -868621314, now seen corresponding path program 660 times [2020-02-10 19:48:22,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:22,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394203763] [2020-02-10 19:48:22,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:23,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 19:48:23,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394203763] [2020-02-10 19:48:23,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:23,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:23,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257658446] [2020-02-10 19:48:23,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:23,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:23,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:23,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:23,125 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:48:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:23,255 INFO L93 Difference]: Finished difference Result 559 states and 1668 transitions. [2020-02-10 19:48:23,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:23,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:23,257 INFO L225 Difference]: With dead ends: 559 [2020-02-10 19:48:23,257 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:48:23,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 19:48:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:48:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 385. [2020-02-10 19:48:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:48:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1333 transitions. [2020-02-10 19:48:23,267 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1333 transitions. Word has length 22 [2020-02-10 19:48:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:23,267 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1333 transitions. [2020-02-10 19:48:23,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1333 transitions. [2020-02-10 19:48:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:23,267 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:23,267 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:23,268 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 19:48:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:23,268 INFO L82 PathProgramCache]: Analyzing trace with hash 265768622, now seen corresponding path program 661 times [2020-02-10 19:48:23,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:23,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609167640] [2020-02-10 19:48:23,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:23,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 19:48:23,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609167640] [2020-02-10 19:48:23,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:23,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:23,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819118136] [2020-02-10 19:48:23,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:23,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:23,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:23,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:23,532 INFO L87 Difference]: Start difference. First operand 385 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:48:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:23,655 INFO L93 Difference]: Finished difference Result 575 states and 1714 transitions. [2020-02-10 19:48:23,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:23,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:23,657 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:48:23,657 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:48:23,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:48:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 391. [2020-02-10 19:48:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:48:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1349 transitions. [2020-02-10 19:48:23,666 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1349 transitions. Word has length 22 [2020-02-10 19:48:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:23,667 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1349 transitions. [2020-02-10 19:48:23,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1349 transitions. [2020-02-10 19:48:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:23,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:23,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 19:48:23,667 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 19:48:23,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:23,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1651803752, now seen corresponding path program 662 times [2020-02-10 19:48:23,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:23,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089014754] [2020-02-10 19:48:23,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:23,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 19:48:23,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089014754] [2020-02-10 19:48:23,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:23,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:23,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058677120] [2020-02-10 19:48:23,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:23,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:23,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:23,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:23,935 INFO L87 Difference]: Start difference. First operand 391 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:48:24,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:24,042 INFO L93 Difference]: Finished difference Result 578 states and 1717 transitions. [2020-02-10 19:48:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:24,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:24,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:24,044 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:48:24,044 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:48:24,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 19:48:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:48:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 388. [2020-02-10 19:48:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1341 transitions. [2020-02-10 19:48:24,053 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1341 transitions. Word has length 22 [2020-02-10 19:48:24,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:24,053 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1341 transitions. [2020-02-10 19:48:24,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:24,054 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1341 transitions. [2020-02-10 19:48:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:24,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:24,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 19:48:24,054 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 19:48:24,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:24,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1359860210, now seen corresponding path program 663 times [2020-02-10 19:48:24,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:24,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749889544] [2020-02-10 19:48:24,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:24,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 19:48:24,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749889544] [2020-02-10 19:48:24,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:24,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:24,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852423419] [2020-02-10 19:48:24,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:24,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:24,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:24,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:24,318 INFO L87 Difference]: Start difference. First operand 388 states and 1341 transitions. Second operand 9 states. [2020-02-10 19:48:24,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:24,436 INFO L93 Difference]: Finished difference Result 574 states and 1709 transitions. [2020-02-10 19:48:24,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:24,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:24,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:24,438 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:48:24,438 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:48:24,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 19:48:24,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:48:24,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 391. [2020-02-10 19:48:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:48:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1346 transitions. [2020-02-10 19:48:24,447 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1346 transitions. Word has length 22 [2020-02-10 19:48:24,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:24,447 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1346 transitions. [2020-02-10 19:48:24,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1346 transitions. [2020-02-10 19:48:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:24,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:24,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 19:48:24,448 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 19:48:24,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:24,448 INFO L82 PathProgramCache]: Analyzing trace with hash 577860968, now seen corresponding path program 664 times [2020-02-10 19:48:24,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:24,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220053045] [2020-02-10 19:48:24,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:24,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 19:48:24,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220053045] [2020-02-10 19:48:24,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:24,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:24,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768122560] [2020-02-10 19:48:24,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:24,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:24,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:24,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:24,716 INFO L87 Difference]: Start difference. First operand 391 states and 1346 transitions. Second operand 9 states. [2020-02-10 19:48:24,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:24,845 INFO L93 Difference]: Finished difference Result 576 states and 1710 transitions. [2020-02-10 19:48:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:24,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:24,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:24,847 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:48:24,847 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:48:24,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 19:48:24,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:48:24,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 388. [2020-02-10 19:48:24,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-02-10 19:48:24,857 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-02-10 19:48:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:24,857 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-02-10 19:48:24,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-02-10 19:48:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:24,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:24,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 19:48:24,858 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 19:48:24,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:24,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1115336270, now seen corresponding path program 665 times [2020-02-10 19:48:24,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:24,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388731076] [2020-02-10 19:48:24,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:25,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 19:48:25,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388731076] [2020-02-10 19:48:25,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:25,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:25,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931156051] [2020-02-10 19:48:25,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:25,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:25,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:25,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:25,131 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:48:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:25,238 INFO L93 Difference]: Finished difference Result 582 states and 1724 transitions. [2020-02-10 19:48:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:25,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:25,240 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:48:25,240 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:48:25,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:48:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 393. [2020-02-10 19:48:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:48:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1347 transitions. [2020-02-10 19:48:25,250 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1347 transitions. Word has length 22 [2020-02-10 19:48:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:25,250 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1347 transitions. [2020-02-10 19:48:25,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1347 transitions. [2020-02-10 19:48:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:25,256 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:25,256 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:25,256 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 19:48:25,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:25,256 INFO L82 PathProgramCache]: Analyzing trace with hash 595277038, now seen corresponding path program 666 times [2020-02-10 19:48:25,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:25,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561525894] [2020-02-10 19:48:25,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:25,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 19:48:25,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561525894] [2020-02-10 19:48:25,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:25,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:25,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506049207] [2020-02-10 19:48:25,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:25,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:25,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:25,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:25,544 INFO L87 Difference]: Start difference. First operand 393 states and 1347 transitions. Second operand 9 states. [2020-02-10 19:48:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:25,664 INFO L93 Difference]: Finished difference Result 581 states and 1717 transitions. [2020-02-10 19:48:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:25,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:25,666 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:48:25,666 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:48:25,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:25,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:48:25,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 385. [2020-02-10 19:48:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:48:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1332 transitions. [2020-02-10 19:48:25,677 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1332 transitions. Word has length 22 [2020-02-10 19:48:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:25,677 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1332 transitions. [2020-02-10 19:48:25,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1332 transitions. [2020-02-10 19:48:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:25,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:25,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 19:48:25,678 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 19:48:25,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:25,678 INFO L82 PathProgramCache]: Analyzing trace with hash -854152164, now seen corresponding path program 667 times [2020-02-10 19:48:25,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:25,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853664404] [2020-02-10 19:48:25,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:25,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 19:48:25,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853664404] [2020-02-10 19:48:25,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:25,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:25,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319331739] [2020-02-10 19:48:25,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:25,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:25,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:25,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:25,940 INFO L87 Difference]: Start difference. First operand 385 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:48:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:26,043 INFO L93 Difference]: Finished difference Result 561 states and 1675 transitions. [2020-02-10 19:48:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:26,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:26,044 INFO L225 Difference]: With dead ends: 561 [2020-02-10 19:48:26,045 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:48:26,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:26,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:48:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 387. [2020-02-10 19:48:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-02-10 19:48:26,060 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-02-10 19:48:26,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:26,060 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-02-10 19:48:26,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-02-10 19:48:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:26,061 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:26,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 19:48:26,061 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 19:48:26,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:26,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1929863320, now seen corresponding path program 668 times [2020-02-10 19:48:26,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:26,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630423022] [2020-02-10 19:48:26,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:26,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 19:48:26,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630423022] [2020-02-10 19:48:26,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:26,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:26,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708518750] [2020-02-10 19:48:26,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:26,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:26,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:26,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:26,324 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:48:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:26,446 INFO L93 Difference]: Finished difference Result 566 states and 1684 transitions. [2020-02-10 19:48:26,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:26,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:26,448 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:48:26,448 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:48:26,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 19:48:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:48:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 386. [2020-02-10 19:48:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-02-10 19:48:26,458 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-02-10 19:48:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:26,458 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-02-10 19:48:26,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-02-10 19:48:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:26,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48: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 19:48:26,459 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 19:48:26,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:26,459 INFO L82 PathProgramCache]: Analyzing trace with hash 239939424, now seen corresponding path program 669 times [2020-02-10 19:48:26,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:26,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581131863] [2020-02-10 19:48:26,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:26,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 19:48:26,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581131863] [2020-02-10 19:48:26,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:26,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:26,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681732502] [2020-02-10 19:48:26,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:26,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:26,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:26,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:26,743 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:48:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:26,836 INFO L93 Difference]: Finished difference Result 560 states and 1672 transitions. [2020-02-10 19:48:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:26,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:26,838 INFO L225 Difference]: With dead ends: 560 [2020-02-10 19:48:26,838 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:48:26,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:48:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 387. [2020-02-10 19:48:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-02-10 19:48:26,849 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-02-10 19:48:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:26,849 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-02-10 19:48:26,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-02-10 19:48:26,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:26,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:26,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 19:48:26,850 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 19:48:26,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:26,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1908857112, now seen corresponding path program 670 times [2020-02-10 19:48:26,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:26,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105451742] [2020-02-10 19:48:26,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:27,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105451742] [2020-02-10 19:48:27,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:27,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:27,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860581115] [2020-02-10 19:48:27,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:27,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:27,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:27,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:27,128 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:48:27,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:27,255 INFO L93 Difference]: Finished difference Result 564 states and 1679 transitions. [2020-02-10 19:48:27,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:27,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:27,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:27,257 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:48:27,258 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 19:48:27,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 19:48:27,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 19:48:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 386. [2020-02-10 19:48:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:27,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-02-10 19:48:27,267 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-02-10 19:48:27,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:27,267 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-02-10 19:48:27,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-02-10 19:48:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:27,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:27,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 19:48:27,268 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 19:48:27,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:27,268 INFO L82 PathProgramCache]: Analyzing trace with hash 176920800, now seen corresponding path program 671 times [2020-02-10 19:48:27,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:27,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094139466] [2020-02-10 19:48:27,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:27,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 19:48:27,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094139466] [2020-02-10 19:48:27,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:27,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:27,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274817823] [2020-02-10 19:48:27,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:27,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:27,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:27,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:27,542 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:48:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:27,646 INFO L93 Difference]: Finished difference Result 574 states and 1703 transitions. [2020-02-10 19:48:27,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:27,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:27,648 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:48:27,648 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:48:27,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 19:48:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:48:27,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 391. [2020-02-10 19:48:27,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:48:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1342 transitions. [2020-02-10 19:48:27,659 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1342 transitions. Word has length 22 [2020-02-10 19:48:27,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:27,659 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1342 transitions. [2020-02-10 19:48:27,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1342 transitions. [2020-02-10 19:48:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:27,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:27,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:27,660 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 19:48:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash -896164580, now seen corresponding path program 672 times [2020-02-10 19:48:27,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:27,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498872090] [2020-02-10 19:48:27,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:27,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 19:48:27,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498872090] [2020-02-10 19:48:27,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:27,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:27,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123504092] [2020-02-10 19:48:27,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:27,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:27,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:27,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:27,939 INFO L87 Difference]: Start difference. First operand 391 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:48:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:28,071 INFO L93 Difference]: Finished difference Result 573 states and 1696 transitions. [2020-02-10 19:48:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:28,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:28,073 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:48:28,073 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:48:28,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 19:48:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:48:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 384. [2020-02-10 19:48:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:48:28,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1330 transitions. [2020-02-10 19:48:28,083 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1330 transitions. Word has length 22 [2020-02-10 19:48:28,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:28,083 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1330 transitions. [2020-02-10 19:48:28,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:28,083 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1330 transitions. [2020-02-10 19:48:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:28,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:28,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 19:48:28,084 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 19:48:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1729611692, now seen corresponding path program 673 times [2020-02-10 19:48:28,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:28,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423687699] [2020-02-10 19:48:28,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:28,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 19:48:28,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423687699] [2020-02-10 19:48:28,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:28,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:28,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325863835] [2020-02-10 19:48:28,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:28,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:28,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:28,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:28,355 INFO L87 Difference]: Start difference. First operand 384 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:48:28,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:28,466 INFO L93 Difference]: Finished difference Result 570 states and 1710 transitions. [2020-02-10 19:48:28,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:28,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:28,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:28,468 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:48:28,468 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:48:28,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:28,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:48:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 390. [2020-02-10 19:48:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:48:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-02-10 19:48:28,478 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-02-10 19:48:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:28,478 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-02-10 19:48:28,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-02-10 19:48:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:28,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:28,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 19:48:28,479 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 19:48:28,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:28,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1476518940, now seen corresponding path program 674 times [2020-02-10 19:48:28,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:28,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23812955] [2020-02-10 19:48:28,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:28,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 19:48:28,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23812955] [2020-02-10 19:48:28,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:28,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:28,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610331338] [2020-02-10 19:48:28,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:28,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:28,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:28,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:28,753 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:48:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:28,859 INFO L93 Difference]: Finished difference Result 569 states and 1706 transitions. [2020-02-10 19:48:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:28,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:28,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:28,861 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:48:28,861 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:48:28,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 19:48:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:48:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 388. [2020-02-10 19:48:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1344 transitions. [2020-02-10 19:48:28,870 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1344 transitions. Word has length 22 [2020-02-10 19:48:28,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:28,870 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1344 transitions. [2020-02-10 19:48:28,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1344 transitions. [2020-02-10 19:48:28,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:28,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:28,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 19:48:28,871 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 19:48:28,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:28,871 INFO L82 PathProgramCache]: Analyzing trace with hash 883518694, now seen corresponding path program 675 times [2020-02-10 19:48:28,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:28,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189840848] [2020-02-10 19:48:28,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:29,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 19:48:29,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189840848] [2020-02-10 19:48:29,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:29,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:29,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937377940] [2020-02-10 19:48:29,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:29,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:29,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:29,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:29,140 INFO L87 Difference]: Start difference. First operand 388 states and 1344 transitions. Second operand 9 states. [2020-02-10 19:48:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:29,252 INFO L93 Difference]: Finished difference Result 575 states and 1719 transitions. [2020-02-10 19:48:29,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:29,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:29,254 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:48:29,254 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:48:29,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 19:48:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:48:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 391. [2020-02-10 19:48:29,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:48:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1349 transitions. [2020-02-10 19:48:29,263 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1349 transitions. Word has length 22 [2020-02-10 19:48:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:29,264 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1349 transitions. [2020-02-10 19:48:29,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1349 transitions. [2020-02-10 19:48:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:29,264 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:29,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 19:48:29,264 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 19:48:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:29,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2025413472, now seen corresponding path program 676 times [2020-02-10 19:48:29,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:29,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438305043] [2020-02-10 19:48:29,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:29,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438305043] [2020-02-10 19:48:29,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:29,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:29,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940227321] [2020-02-10 19:48:29,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:29,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:29,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:29,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:29,536 INFO L87 Difference]: Start difference. First operand 391 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:48:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:29,653 INFO L93 Difference]: Finished difference Result 578 states and 1722 transitions. [2020-02-10 19:48:29,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:29,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:29,655 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:48:29,655 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:48:29,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 19:48:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:48:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 388. [2020-02-10 19:48:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-02-10 19:48:29,665 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-02-10 19:48:29,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:29,665 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-02-10 19:48:29,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:29,665 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-02-10 19:48:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:29,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:29,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 19:48:29,666 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 19:48:29,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:29,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2017428796, now seen corresponding path program 677 times [2020-02-10 19:48:29,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:29,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870139544] [2020-02-10 19:48:29,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:29,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 19:48:29,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870139544] [2020-02-10 19:48:29,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:29,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:29,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605725003] [2020-02-10 19:48:29,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:29,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:29,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:29,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:29,925 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:48:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:30,047 INFO L93 Difference]: Finished difference Result 572 states and 1710 transitions. [2020-02-10 19:48:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:30,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:30,049 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:48:30,049 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:48:30,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:48:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 390. [2020-02-10 19:48:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:48:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1345 transitions. [2020-02-10 19:48:30,059 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1345 transitions. Word has length 22 [2020-02-10 19:48:30,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:30,059 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1345 transitions. [2020-02-10 19:48:30,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1345 transitions. [2020-02-10 19:48:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:30,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:30,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 19:48:30,060 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 19:48:30,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1359588310, now seen corresponding path program 678 times [2020-02-10 19:48:30,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:30,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325185758] [2020-02-10 19:48:30,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:30,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 19:48:30,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325185758] [2020-02-10 19:48:30,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:30,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:30,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016445571] [2020-02-10 19:48:30,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:30,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:30,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:30,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:30,332 INFO L87 Difference]: Start difference. First operand 390 states and 1345 transitions. Second operand 9 states. [2020-02-10 19:48:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:30,456 INFO L93 Difference]: Finished difference Result 576 states and 1716 transitions. [2020-02-10 19:48:30,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:30,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:30,457 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:48:30,457 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:48:30,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 19:48:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:48:30,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 386. [2020-02-10 19:48:30,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-02-10 19:48:30,467 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-02-10 19:48:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:30,467 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-02-10 19:48:30,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:30,467 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-02-10 19:48:30,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:30,468 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:30,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 19:48:30,468 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 19:48:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:30,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2122456464, now seen corresponding path program 679 times [2020-02-10 19:48:30,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:30,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983056929] [2020-02-10 19:48:30,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:30,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983056929] [2020-02-10 19:48:30,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:30,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:30,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896106876] [2020-02-10 19:48:30,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:30,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:30,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:30,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:30,747 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:48:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:30,871 INFO L93 Difference]: Finished difference Result 569 states and 1706 transitions. [2020-02-10 19:48:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:30,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:30,873 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:48:30,874 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:48:30,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 19:48:30,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:48:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 390. [2020-02-10 19:48:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:48:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1347 transitions. [2020-02-10 19:48:30,883 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1347 transitions. Word has length 22 [2020-02-10 19:48:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:30,884 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1347 transitions. [2020-02-10 19:48:30,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1347 transitions. [2020-02-10 19:48:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:30,884 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:30,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 19:48:30,884 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 19:48:30,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:30,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1919418080, now seen corresponding path program 680 times [2020-02-10 19:48:30,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:30,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235003614] [2020-02-10 19:48:30,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:31,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 19:48:31,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235003614] [2020-02-10 19:48:31,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:31,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:31,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648247963] [2020-02-10 19:48:31,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:31,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:31,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:31,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:31,159 INFO L87 Difference]: Start difference. First operand 390 states and 1347 transitions. Second operand 9 states. [2020-02-10 19:48:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:31,284 INFO L93 Difference]: Finished difference Result 568 states and 1702 transitions. [2020-02-10 19:48:31,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:31,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:31,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:31,286 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:48:31,286 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:48:31,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 19:48:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:48:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 388. [2020-02-10 19:48:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-02-10 19:48:31,296 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-02-10 19:48:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:31,297 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-02-10 19:48:31,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-02-10 19:48:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:31,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:31,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 19:48:31,297 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 19:48:31,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1534711142, now seen corresponding path program 681 times [2020-02-10 19:48:31,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:31,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364515840] [2020-02-10 19:48:31,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:31,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 19:48:31,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364515840] [2020-02-10 19:48:31,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:31,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:31,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952345018] [2020-02-10 19:48:31,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:31,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:31,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:31,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:31,570 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:48:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:31,708 INFO L93 Difference]: Finished difference Result 573 states and 1713 transitions. [2020-02-10 19:48:31,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:31,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:31,710 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:48:31,710 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:48:31,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:31,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:48:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 391. [2020-02-10 19:48:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:48:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1347 transitions. [2020-02-10 19:48:31,720 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1347 transitions. Word has length 22 [2020-02-10 19:48:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:31,721 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1347 transitions. [2020-02-10 19:48:31,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1347 transitions. [2020-02-10 19:48:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:31,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:31,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:31,722 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 19:48:31,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:31,722 INFO L82 PathProgramCache]: Analyzing trace with hash 752711900, now seen corresponding path program 682 times [2020-02-10 19:48:31,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:31,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689428662] [2020-02-10 19:48:31,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:31,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 19:48:31,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689428662] [2020-02-10 19:48:31,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:31,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:31,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715952018] [2020-02-10 19:48:31,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:31,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:31,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:31,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:31,993 INFO L87 Difference]: Start difference. First operand 391 states and 1347 transitions. Second operand 9 states. [2020-02-10 19:48:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:32,134 INFO L93 Difference]: Finished difference Result 575 states and 1714 transitions. [2020-02-10 19:48:32,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:32,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:32,136 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:48:32,136 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:48:32,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:32,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:48:32,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 388. [2020-02-10 19:48:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1340 transitions. [2020-02-10 19:48:32,146 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1340 transitions. Word has length 22 [2020-02-10 19:48:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:32,146 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1340 transitions. [2020-02-10 19:48:32,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1340 transitions. [2020-02-10 19:48:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:32,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:32,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 19:48:32,147 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 19:48:32,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:32,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1855645568, now seen corresponding path program 683 times [2020-02-10 19:48:32,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:32,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892476047] [2020-02-10 19:48:32,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:32,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 19:48:32,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892476047] [2020-02-10 19:48:32,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:32,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:32,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998804777] [2020-02-10 19:48:32,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:32,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:32,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:32,417 INFO L87 Difference]: Start difference. First operand 388 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:48:32,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:32,558 INFO L93 Difference]: Finished difference Result 570 states and 1704 transitions. [2020-02-10 19:48:32,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:32,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:32,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:32,560 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:48:32,560 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:48:32,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:48:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 390. [2020-02-10 19:48:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:48:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-02-10 19:48:32,571 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-02-10 19:48:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:32,571 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-02-10 19:48:32,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-02-10 19:48:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:32,572 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:32,572 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:32,572 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 19:48:32,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:32,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1867866922, now seen corresponding path program 684 times [2020-02-10 19:48:32,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:32,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106288795] [2020-02-10 19:48:32,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:32,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 19:48:32,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106288795] [2020-02-10 19:48:32,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:32,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:32,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654065485] [2020-02-10 19:48:32,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:32,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:32,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:32,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:32,842 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:48:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:32,964 INFO L93 Difference]: Finished difference Result 573 states and 1708 transitions. [2020-02-10 19:48:32,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:32,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:32,965 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:48:32,966 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:48:32,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 19:48:32,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:48:32,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 386. [2020-02-10 19:48:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-02-10 19:48:32,976 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-02-10 19:48:32,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:32,976 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-02-10 19:48:32,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:32,976 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-02-10 19:48:32,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:32,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:32,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 19:48:32,977 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 19:48:32,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:32,977 INFO L82 PathProgramCache]: Analyzing trace with hash -156717104, now seen corresponding path program 685 times [2020-02-10 19:48:32,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:32,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440958304] [2020-02-10 19:48:32,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:33,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 19:48:33,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440958304] [2020-02-10 19:48:33,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:33,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:33,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47129229] [2020-02-10 19:48:33,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:33,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:33,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:33,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:33,239 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:48:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:33,382 INFO L93 Difference]: Finished difference Result 583 states and 1739 transitions. [2020-02-10 19:48:33,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:33,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:33,384 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:48:33,384 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:48:33,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 19:48:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:48:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 392. [2020-02-10 19:48:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:48:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1351 transitions. [2020-02-10 19:48:33,394 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1351 transitions. Word has length 22 [2020-02-10 19:48:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:33,395 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1351 transitions. [2020-02-10 19:48:33,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1351 transitions. [2020-02-10 19:48:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:33,395 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:33,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 19:48:33,395 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 19:48:33,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:33,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1229318026, now seen corresponding path program 686 times [2020-02-10 19:48:33,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:33,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135163800] [2020-02-10 19:48:33,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:33,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 19:48:33,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135163800] [2020-02-10 19:48:33,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:33,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:33,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883069331] [2020-02-10 19:48:33,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:33,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:33,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:33,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:33,662 INFO L87 Difference]: Start difference. First operand 392 states and 1351 transitions. Second operand 9 states. [2020-02-10 19:48:33,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:33,801 INFO L93 Difference]: Finished difference Result 586 states and 1742 transitions. [2020-02-10 19:48:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:33,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:33,802 INFO L225 Difference]: With dead ends: 586 [2020-02-10 19:48:33,803 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 19:48:33,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 19:48:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 389. [2020-02-10 19:48:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:48:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1343 transitions. [2020-02-10 19:48:33,812 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1343 transitions. Word has length 22 [2020-02-10 19:48:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:33,812 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1343 transitions. [2020-02-10 19:48:33,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1343 transitions. [2020-02-10 19:48:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:33,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:33,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 19:48:33,813 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 19:48:33,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:33,813 INFO L82 PathProgramCache]: Analyzing trace with hash 937374484, now seen corresponding path program 687 times [2020-02-10 19:48:33,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:33,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637775398] [2020-02-10 19:48:33,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:34,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 19:48:34,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637775398] [2020-02-10 19:48:34,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:34,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:34,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575668369] [2020-02-10 19:48:34,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:34,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:34,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:34,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:34,080 INFO L87 Difference]: Start difference. First operand 389 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:48:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:34,219 INFO L93 Difference]: Finished difference Result 582 states and 1734 transitions. [2020-02-10 19:48:34,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:34,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:34,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:34,221 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:48:34,221 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 19:48:34,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 19:48:34,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 19:48:34,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 392. [2020-02-10 19:48:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:48:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1348 transitions. [2020-02-10 19:48:34,231 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1348 transitions. Word has length 22 [2020-02-10 19:48:34,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:34,231 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1348 transitions. [2020-02-10 19:48:34,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:34,231 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1348 transitions. [2020-02-10 19:48:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:34,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:34,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:34,232 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 19:48:34,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:34,232 INFO L82 PathProgramCache]: Analyzing trace with hash 155375242, now seen corresponding path program 688 times [2020-02-10 19:48:34,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:34,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114526897] [2020-02-10 19:48:34,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:34,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114526897] [2020-02-10 19:48:34,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:34,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:34,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101769390] [2020-02-10 19:48:34,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:34,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:34,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:34,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:34,500 INFO L87 Difference]: Start difference. First operand 392 states and 1348 transitions. Second operand 9 states. [2020-02-10 19:48:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:34,640 INFO L93 Difference]: Finished difference Result 584 states and 1735 transitions. [2020-02-10 19:48:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:34,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:34,642 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:48:34,642 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:48:34,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:48:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 389. [2020-02-10 19:48:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:48:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-02-10 19:48:34,651 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-02-10 19:48:34,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:34,651 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-02-10 19:48:34,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-02-10 19:48:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:34,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:34,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 19:48:34,652 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 19:48:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:34,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1537821996, now seen corresponding path program 689 times [2020-02-10 19:48:34,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:34,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654636591] [2020-02-10 19:48:34,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:34,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654636591] [2020-02-10 19:48:34,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:34,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:34,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431597602] [2020-02-10 19:48:34,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:34,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:34,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:34,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:34,921 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:48:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:35,062 INFO L93 Difference]: Finished difference Result 590 states and 1749 transitions. [2020-02-10 19:48:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:35,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:35,064 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:48:35,064 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:48:35,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 19:48:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:48:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 394. [2020-02-10 19:48:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:48:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1349 transitions. [2020-02-10 19:48:35,074 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1349 transitions. Word has length 22 [2020-02-10 19:48:35,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:35,074 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1349 transitions. [2020-02-10 19:48:35,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1349 transitions. [2020-02-10 19:48:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:35,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:35,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:35,075 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 19:48:35,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:35,075 INFO L82 PathProgramCache]: Analyzing trace with hash 172791312, now seen corresponding path program 690 times [2020-02-10 19:48:35,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:35,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573815457] [2020-02-10 19:48:35,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:35,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 19:48:35,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573815457] [2020-02-10 19:48:35,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:35,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:35,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212742109] [2020-02-10 19:48:35,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:35,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:35,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:35,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:35,347 INFO L87 Difference]: Start difference. First operand 394 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:48:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:35,494 INFO L93 Difference]: Finished difference Result 589 states and 1742 transitions. [2020-02-10 19:48:35,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:35,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:35,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:35,496 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:48:35,496 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:48:35,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 19:48:35,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:48:35,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 386. [2020-02-10 19:48:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-02-10 19:48:35,505 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-02-10 19:48:35,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:35,505 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-02-10 19:48:35,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:35,505 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-02-10 19:48:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:35,506 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:35,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 19:48:35,506 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 19:48:35,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:35,506 INFO L82 PathProgramCache]: Analyzing trace with hash -954572700, now seen corresponding path program 691 times [2020-02-10 19:48:35,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:35,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536830494] [2020-02-10 19:48:35,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:35,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536830494] [2020-02-10 19:48:35,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:35,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:35,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831480398] [2020-02-10 19:48:35,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:35,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:35,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:35,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:35,766 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:48:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:35,891 INFO L93 Difference]: Finished difference Result 576 states and 1718 transitions. [2020-02-10 19:48:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:35,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:35,893 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:48:35,893 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:48:35,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:48:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 390. [2020-02-10 19:48:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:48:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-02-10 19:48:35,904 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-02-10 19:48:35,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:35,904 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-02-10 19:48:35,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-02-10 19:48:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:35,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:35,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:35,905 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 19:48:35,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1872522890, now seen corresponding path program 692 times [2020-02-10 19:48:35,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:35,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250188379] [2020-02-10 19:48:35,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:36,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 19:48:36,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250188379] [2020-02-10 19:48:36,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:36,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:36,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334838485] [2020-02-10 19:48:36,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:36,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:36,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:36,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:36,177 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:48:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:36,315 INFO L93 Difference]: Finished difference Result 580 states and 1724 transitions. [2020-02-10 19:48:36,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:36,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:36,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:36,317 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:48:36,317 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:48:36,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 19:48:36,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:48:36,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 388. [2020-02-10 19:48:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-02-10 19:48:36,327 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-02-10 19:48:36,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:36,327 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-02-10 19:48:36,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-02-10 19:48:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:36,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:36,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 19:48:36,328 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 19:48:36,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:36,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2027658080, now seen corresponding path program 693 times [2020-02-10 19:48:36,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:36,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380765955] [2020-02-10 19:48:36,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:36,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 19:48:36,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380765955] [2020-02-10 19:48:36,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:36,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:36,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699349052] [2020-02-10 19:48:36,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:36,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:36,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:36,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:36,589 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:48:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:36,699 INFO L93 Difference]: Finished difference Result 575 states and 1714 transitions. [2020-02-10 19:48:36,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:36,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:36,701 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:48:36,701 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:48:36,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:48:36,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 390. [2020-02-10 19:48:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:48:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1341 transitions. [2020-02-10 19:48:36,711 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1341 transitions. Word has length 22 [2020-02-10 19:48:36,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:36,711 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1341 transitions. [2020-02-10 19:48:36,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1341 transitions. [2020-02-10 19:48:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:36,711 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:36,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 19:48:36,712 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 19:48:36,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:36,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1456203274, now seen corresponding path program 694 times [2020-02-10 19:48:36,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:36,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264791010] [2020-02-10 19:48:36,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:36,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 19:48:36,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264791010] [2020-02-10 19:48:36,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:36,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:36,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940395561] [2020-02-10 19:48:36,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:36,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:36,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:36,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:36,985 INFO L87 Difference]: Start difference. First operand 390 states and 1341 transitions. Second operand 9 states. [2020-02-10 19:48:37,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:37,127 INFO L93 Difference]: Finished difference Result 578 states and 1718 transitions. [2020-02-10 19:48:37,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:37,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:37,129 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:48:37,130 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:48:37,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:48:37,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 388. [2020-02-10 19:48:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1336 transitions. [2020-02-10 19:48:37,139 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1336 transitions. Word has length 22 [2020-02-10 19:48:37,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:37,139 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1336 transitions. [2020-02-10 19:48:37,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1336 transitions. [2020-02-10 19:48:37,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:37,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:37,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 19:48:37,140 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 19:48:37,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:37,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1337293088, now seen corresponding path program 695 times [2020-02-10 19:48:37,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:37,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089971410] [2020-02-10 19:48:37,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:37,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 19:48:37,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089971410] [2020-02-10 19:48:37,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:37,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:37,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161072269] [2020-02-10 19:48:37,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:37,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:37,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:37,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:37,415 INFO L87 Difference]: Start difference. First operand 388 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:48:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:37,558 INFO L93 Difference]: Finished difference Result 586 states and 1737 transitions. [2020-02-10 19:48:37,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:37,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:37,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:37,560 INFO L225 Difference]: With dead ends: 586 [2020-02-10 19:48:37,560 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:48:37,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 19:48:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:48:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 393. [2020-02-10 19:48:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:48:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1345 transitions. [2020-02-10 19:48:37,569 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1345 transitions. Word has length 22 [2020-02-10 19:48:37,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:37,569 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1345 transitions. [2020-02-10 19:48:37,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1345 transitions. [2020-02-10 19:48:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:37,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:37,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 19:48:37,570 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 19:48:37,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:37,570 INFO L82 PathProgramCache]: Analyzing trace with hash 152111908, now seen corresponding path program 696 times [2020-02-10 19:48:37,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:37,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489225340] [2020-02-10 19:48:37,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:37,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 19:48:37,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489225340] [2020-02-10 19:48:37,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:37,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:37,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334667093] [2020-02-10 19:48:37,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:37,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:37,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:37,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:37,843 INFO L87 Difference]: Start difference. First operand 393 states and 1345 transitions. Second operand 9 states. [2020-02-10 19:48:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:37,979 INFO L93 Difference]: Finished difference Result 585 states and 1730 transitions. [2020-02-10 19:48:37,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:37,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:37,981 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:48:37,982 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:48:37,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 19:48:37,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:48:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-02-10 19:48:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:48:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1329 transitions. [2020-02-10 19:48:37,991 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1329 transitions. Word has length 22 [2020-02-10 19:48:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:37,991 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1329 transitions. [2020-02-10 19:48:37,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1329 transitions. [2020-02-10 19:48:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:37,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:37,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 19:48:37,993 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 19:48:37,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1022949092, now seen corresponding path program 697 times [2020-02-10 19:48:37,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:37,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833556798] [2020-02-10 19:48:37,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:38,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 19:48:38,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833556798] [2020-02-10 19:48:38,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:38,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:38,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970881355] [2020-02-10 19:48:38,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:38,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:38,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:38,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:38,287 INFO L87 Difference]: Start difference. First operand 384 states and 1329 transitions. Second operand 9 states. [2020-02-10 19:48:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:38,399 INFO L93 Difference]: Finished difference Result 547 states and 1641 transitions. [2020-02-10 19:48:38,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:38,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:38,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:38,401 INFO L225 Difference]: With dead ends: 547 [2020-02-10 19:48:38,401 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 19:48:38,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 19:48:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 387. [2020-02-10 19:48:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-02-10 19:48:38,411 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-02-10 19:48:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:38,411 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-02-10 19:48:38,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:38,411 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-02-10 19:48:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:38,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48: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 19:48:38,412 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 19:48:38,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:38,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1661077246, now seen corresponding path program 698 times [2020-02-10 19:48:38,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:38,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45201327] [2020-02-10 19:48:38,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:38,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 19:48:38,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45201327] [2020-02-10 19:48:38,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:38,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:38,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562523333] [2020-02-10 19:48:38,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:38,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:38,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:38,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:38,714 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:48:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:38,853 INFO L93 Difference]: Finished difference Result 548 states and 1642 transitions. [2020-02-10 19:48:38,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:38,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:38,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:38,855 INFO L225 Difference]: With dead ends: 548 [2020-02-10 19:48:38,855 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:48:38,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 19:48:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:48:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 386. [2020-02-10 19:48:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-02-10 19:48:38,865 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-02-10 19:48:38,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:38,865 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-02-10 19:48:38,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:38,865 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-02-10 19:48:38,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:38,866 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:38,866 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:38,866 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 19:48:38,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:38,866 INFO L82 PathProgramCache]: Analyzing trace with hash -658887818, now seen corresponding path program 699 times [2020-02-10 19:48:38,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:38,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401752841] [2020-02-10 19:48:38,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:39,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 19:48:39,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401752841] [2020-02-10 19:48:39,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:39,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:39,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847980841] [2020-02-10 19:48:39,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:39,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:39,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:39,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:39,144 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:48:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:39,254 INFO L93 Difference]: Finished difference Result 551 states and 1648 transitions. [2020-02-10 19:48:39,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:39,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:39,256 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:48:39,256 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 19:48:39,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 19:48:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 19:48:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 387. [2020-02-10 19:48:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-02-10 19:48:39,266 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-02-10 19:48:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:39,266 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-02-10 19:48:39,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-02-10 19:48:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:39,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:39,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 19:48:39,266 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 19:48:39,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:39,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1734598974, now seen corresponding path program 700 times [2020-02-10 19:48:39,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:39,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293448326] [2020-02-10 19:48:39,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:39,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 19:48:39,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293448326] [2020-02-10 19:48:39,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:39,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:39,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342306053] [2020-02-10 19:48:39,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:39,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:39,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:39,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:39,539 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:48:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:39,678 INFO L93 Difference]: Finished difference Result 556 states and 1657 transitions. [2020-02-10 19:48:39,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:39,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:39,680 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:48:39,680 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:48:39,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 19:48:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:48:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 386. [2020-02-10 19:48:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-02-10 19:48:39,690 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-02-10 19:48:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:39,690 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-02-10 19:48:39,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-02-10 19:48:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:39,691 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:39,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 19:48:39,691 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 19:48:39,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:39,691 INFO L82 PathProgramCache]: Analyzing trace with hash -648384714, now seen corresponding path program 701 times [2020-02-10 19:48:39,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:39,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724021709] [2020-02-10 19:48:39,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:39,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 19:48:39,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724021709] [2020-02-10 19:48:39,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:39,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:39,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477531659] [2020-02-10 19:48:39,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:39,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:39,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:39,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:39,968 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:48:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:40,076 INFO L93 Difference]: Finished difference Result 554 states and 1654 transitions. [2020-02-10 19:48:40,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:40,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:40,078 INFO L225 Difference]: With dead ends: 554 [2020-02-10 19:48:40,078 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:48:40,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:40,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:48:40,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 388. [2020-02-10 19:48:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1337 transitions. [2020-02-10 19:48:40,088 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1337 transitions. Word has length 22 [2020-02-10 19:48:40,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:40,089 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1337 transitions. [2020-02-10 19:48:40,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:40,089 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1337 transitions. [2020-02-10 19:48:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:40,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:40,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 19:48:40,089 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 19:48:40,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:40,090 INFO L82 PathProgramCache]: Analyzing trace with hash 959930468, now seen corresponding path program 702 times [2020-02-10 19:48:40,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:40,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355972964] [2020-02-10 19:48:40,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:40,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 19:48:40,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355972964] [2020-02-10 19:48:40,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:40,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:40,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368197665] [2020-02-10 19:48:40,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:40,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:40,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:40,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:40,361 INFO L87 Difference]: Start difference. First operand 388 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:48:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:40,496 INFO L93 Difference]: Finished difference Result 558 states and 1660 transitions. [2020-02-10 19:48:40,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:40,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:40,498 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:48:40,498 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:48:40,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 19:48:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:48:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 385. [2020-02-10 19:48:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:48:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1332 transitions. [2020-02-10 19:48:40,509 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1332 transitions. Word has length 22 [2020-02-10 19:48:40,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:40,509 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1332 transitions. [2020-02-10 19:48:40,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:40,509 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1332 transitions. [2020-02-10 19:48:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:40,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:40,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 19:48:40,510 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 19:48:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash 580049952, now seen corresponding path program 703 times [2020-02-10 19:48:40,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:40,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973684246] [2020-02-10 19:48:40,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:40,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 19:48:40,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973684246] [2020-02-10 19:48:40,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:40,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:40,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426343657] [2020-02-10 19:48:40,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:40,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:40,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:40,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:40,816 INFO L87 Difference]: Start difference. First operand 385 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:48:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:40,927 INFO L93 Difference]: Finished difference Result 546 states and 1638 transitions. [2020-02-10 19:48:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:40,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:40,929 INFO L225 Difference]: With dead ends: 546 [2020-02-10 19:48:40,929 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:48:40,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 19:48:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:48:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 387. [2020-02-10 19:48:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-02-10 19:48:40,939 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-02-10 19:48:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:40,939 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-02-10 19:48:40,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-02-10 19:48:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:40,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:40,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 19:48:40,940 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 19:48:40,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:40,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2103976386, now seen corresponding path program 704 times [2020-02-10 19:48:40,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:40,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940362575] [2020-02-10 19:48:40,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:41,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 19:48:41,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940362575] [2020-02-10 19:48:41,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:41,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:41,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895734792] [2020-02-10 19:48:41,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:41,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:41,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:41,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:41,235 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:48:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:41,373 INFO L93 Difference]: Finished difference Result 547 states and 1639 transitions. [2020-02-10 19:48:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:41,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:41,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:41,375 INFO L225 Difference]: With dead ends: 547 [2020-02-10 19:48:41,375 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 19:48:41,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 19:48:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 386. [2020-02-10 19:48:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-02-10 19:48:41,385 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-02-10 19:48:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:41,385 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-02-10 19:48:41,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-02-10 19:48:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:41,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:41,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 19:48:41,386 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 19:48:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:41,386 INFO L82 PathProgramCache]: Analyzing trace with hash -7695370, now seen corresponding path program 705 times [2020-02-10 19:48:41,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:41,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320240695] [2020-02-10 19:48:41,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:41,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 19:48:41,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320240695] [2020-02-10 19:48:41,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:41,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:41,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031038013] [2020-02-10 19:48:41,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:41,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:41,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:41,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:41,683 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:48:41,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:41,795 INFO L93 Difference]: Finished difference Result 549 states and 1643 transitions. [2020-02-10 19:48:41,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:41,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:41,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:41,797 INFO L225 Difference]: With dead ends: 549 [2020-02-10 19:48:41,797 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 19:48:41,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 19:48:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 19:48:41,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 387. [2020-02-10 19:48:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-02-10 19:48:41,807 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-02-10 19:48:41,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:41,807 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-02-10 19:48:41,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-02-10 19:48:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:41,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:41,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 19:48:41,808 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 19:48:41,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:41,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2138475390, now seen corresponding path program 706 times [2020-02-10 19:48:41,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:41,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924327488] [2020-02-10 19:48:41,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:42,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 19:48:42,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924327488] [2020-02-10 19:48:42,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:42,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:42,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299244844] [2020-02-10 19:48:42,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:42,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:42,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:42,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:42,097 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:48:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:42,234 INFO L93 Difference]: Finished difference Result 553 states and 1650 transitions. [2020-02-10 19:48:42,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:42,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:42,236 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:48:42,236 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 19:48:42,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 19:48:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 19:48:42,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 386. [2020-02-10 19:48:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-02-10 19:48:42,253 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-02-10 19:48:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:42,253 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-02-10 19:48:42,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-02-10 19:48:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:42,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:42,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 19:48:42,254 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 19:48:42,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:42,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2807734, now seen corresponding path program 707 times [2020-02-10 19:48:42,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:42,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130191075] [2020-02-10 19:48:42,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:42,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 19:48:42,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130191075] [2020-02-10 19:48:42,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:42,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:42,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209339185] [2020-02-10 19:48:42,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:42,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:42,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:42,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:42,540 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:48:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:42,671 INFO L93 Difference]: Finished difference Result 552 states and 1649 transitions. [2020-02-10 19:48:42,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:42,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:42,672 INFO L225 Difference]: With dead ends: 552 [2020-02-10 19:48:42,673 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 19:48:42,673 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 19:48:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 388. [2020-02-10 19:48:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1336 transitions. [2020-02-10 19:48:42,683 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1336 transitions. Word has length 22 [2020-02-10 19:48:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:42,683 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1336 transitions. [2020-02-10 19:48:42,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:42,684 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1336 transitions. [2020-02-10 19:48:42,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:42,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:42,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 19:48:42,684 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 19:48:42,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:42,684 INFO L82 PathProgramCache]: Analyzing trace with hash 538037536, now seen corresponding path program 708 times [2020-02-10 19:48:42,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:42,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654684054] [2020-02-10 19:48:42,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:42,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654684054] [2020-02-10 19:48:42,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:42,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:42,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623727] [2020-02-10 19:48:42,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:42,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:42,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:42,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:42,967 INFO L87 Difference]: Start difference. First operand 388 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:48:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:43,109 INFO L93 Difference]: Finished difference Result 555 states and 1653 transitions. [2020-02-10 19:48:43,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:43,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:43,111 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:48:43,111 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 19:48:43,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 19:48:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 19:48:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 385. [2020-02-10 19:48:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:48:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1331 transitions. [2020-02-10 19:48:43,120 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1331 transitions. Word has length 22 [2020-02-10 19:48:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:43,121 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1331 transitions. [2020-02-10 19:48:43,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1331 transitions. [2020-02-10 19:48:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:43,121 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:43,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 19:48:43,121 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 19:48:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:43,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1699123616, now seen corresponding path program 709 times [2020-02-10 19:48:43,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:43,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275336634] [2020-02-10 19:48:43,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:43,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:43,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275336634] [2020-02-10 19:48:43,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:43,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:43,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258708861] [2020-02-10 19:48:43,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:43,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:43,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:43,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:43,400 INFO L87 Difference]: Start difference. First operand 385 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:48:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:43,495 INFO L93 Difference]: Finished difference Result 557 states and 1662 transitions. [2020-02-10 19:48:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:43,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:43,496 INFO L225 Difference]: With dead ends: 557 [2020-02-10 19:48:43,497 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:48:43,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 19:48:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:48:43,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 387. [2020-02-10 19:48:43,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-02-10 19:48:43,506 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-02-10 19:48:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:43,506 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-02-10 19:48:43,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-02-10 19:48:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:43,507 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:43,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 19:48:43,507 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 19:48:43,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:43,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1520132524, now seen corresponding path program 710 times [2020-02-10 19:48:43,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:43,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854651625] [2020-02-10 19:48:43,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:43,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854651625] [2020-02-10 19:48:43,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:43,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:43,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148912521] [2020-02-10 19:48:43,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:43,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:43,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:43,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:43,781 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:48:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:43,920 INFO L93 Difference]: Finished difference Result 562 states and 1671 transitions. [2020-02-10 19:48:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:43,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:43,922 INFO L225 Difference]: With dead ends: 562 [2020-02-10 19:48:43,922 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:48:43,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:48:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 386. [2020-02-10 19:48:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-02-10 19:48:43,931 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-02-10 19:48:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:43,931 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-02-10 19:48:43,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-02-10 19:48:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:43,932 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:43,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 19:48:43,932 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 19:48:43,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:43,932 INFO L82 PathProgramCache]: Analyzing trace with hash -605032028, now seen corresponding path program 711 times [2020-02-10 19:48:43,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:43,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52260485] [2020-02-10 19:48:43,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:44,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 19:48:44,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52260485] [2020-02-10 19:48:44,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:44,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:44,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363173001] [2020-02-10 19:48:44,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:44,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:44,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:44,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:44,220 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:48:44,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:44,330 INFO L93 Difference]: Finished difference Result 556 states and 1659 transitions. [2020-02-10 19:48:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:44,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:44,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:44,332 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:48:44,332 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:48:44,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:44,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:48:44,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 387. [2020-02-10 19:48:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1334 transitions. [2020-02-10 19:48:44,342 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1334 transitions. Word has length 22 [2020-02-10 19:48:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:44,342 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1334 transitions. [2020-02-10 19:48:44,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1334 transitions. [2020-02-10 19:48:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:44,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:44,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 19:48:44,343 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 19:48:44,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:44,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1541138732, now seen corresponding path program 712 times [2020-02-10 19:48:44,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:44,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902969560] [2020-02-10 19:48:44,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:44,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 19:48:44,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902969560] [2020-02-10 19:48:44,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:44,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:44,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201428622] [2020-02-10 19:48:44,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:44,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:44,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:44,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:44,624 INFO L87 Difference]: Start difference. First operand 387 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:48:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:44,759 INFO L93 Difference]: Finished difference Result 560 states and 1666 transitions. [2020-02-10 19:48:44,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:44,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:44,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:44,761 INFO L225 Difference]: With dead ends: 560 [2020-02-10 19:48:44,761 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:48:44,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:48:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 386. [2020-02-10 19:48:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1332 transitions. [2020-02-10 19:48:44,777 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1332 transitions. Word has length 22 [2020-02-10 19:48:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:44,777 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1332 transitions. [2020-02-10 19:48:44,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1332 transitions. [2020-02-10 19:48:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:44,778 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:44,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 19:48:44,778 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 19:48:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:44,778 INFO L82 PathProgramCache]: Analyzing trace with hash -668050652, now seen corresponding path program 713 times [2020-02-10 19:48:44,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:44,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241301451] [2020-02-10 19:48:44,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:45,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 19:48:45,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241301451] [2020-02-10 19:48:45,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:45,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:45,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427211783] [2020-02-10 19:48:45,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:45,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:45,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:45,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:45,065 INFO L87 Difference]: Start difference. First operand 386 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:48:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:45,202 INFO L93 Difference]: Finished difference Result 570 states and 1690 transitions. [2020-02-10 19:48:45,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:45,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:45,204 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:48:45,204 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:48:45,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:48:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 391. [2020-02-10 19:48:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:48:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1341 transitions. [2020-02-10 19:48:45,214 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1341 transitions. Word has length 22 [2020-02-10 19:48:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:45,214 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1341 transitions. [2020-02-10 19:48:45,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1341 transitions. [2020-02-10 19:48:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:45,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:45,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 19:48:45,215 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 19:48:45,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:45,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1741136032, now seen corresponding path program 714 times [2020-02-10 19:48:45,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:45,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943242348] [2020-02-10 19:48:45,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:45,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 19:48:45,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943242348] [2020-02-10 19:48:45,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:45,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:45,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771566018] [2020-02-10 19:48:45,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:45,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:45,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:45,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:45,499 INFO L87 Difference]: Start difference. First operand 391 states and 1341 transitions. Second operand 9 states. [2020-02-10 19:48:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:45,639 INFO L93 Difference]: Finished difference Result 569 states and 1683 transitions. [2020-02-10 19:48:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:45,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:45,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:45,641 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:48:45,641 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 19:48:45,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 19:48:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 19:48:45,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 385. [2020-02-10 19:48:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:48:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1330 transitions. [2020-02-10 19:48:45,651 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1330 transitions. Word has length 22 [2020-02-10 19:48:45,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:45,651 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1330 transitions. [2020-02-10 19:48:45,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1330 transitions. [2020-02-10 19:48:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:45,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:45,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 19:48:45,652 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 19:48:45,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:45,652 INFO L82 PathProgramCache]: Analyzing trace with hash 237413566, now seen corresponding path program 715 times [2020-02-10 19:48:45,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:45,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375930213] [2020-02-10 19:48:45,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:45,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 19:48:45,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375930213] [2020-02-10 19:48:45,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:45,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:45,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754948368] [2020-02-10 19:48:45,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:45,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:45,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:45,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:45,939 INFO L87 Difference]: Start difference. First operand 385 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:48:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:46,063 INFO L93 Difference]: Finished difference Result 564 states and 1680 transitions. [2020-02-10 19:48:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:46,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:46,065 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:48:46,065 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:48:46,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:48:46,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 389. [2020-02-10 19:48:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:48:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-02-10 19:48:46,074 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-02-10 19:48:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:46,074 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-02-10 19:48:46,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-02-10 19:48:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:46,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:46,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:46,075 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 19:48:46,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:46,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1845728748, now seen corresponding path program 716 times [2020-02-10 19:48:46,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:46,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190541748] [2020-02-10 19:48:46,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:46,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 19:48:46,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190541748] [2020-02-10 19:48:46,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:46,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:46,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991003945] [2020-02-10 19:48:46,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:46,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:46,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:46,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:46,350 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:48:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:46,491 INFO L93 Difference]: Finished difference Result 568 states and 1686 transitions. [2020-02-10 19:48:46,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:46,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:46,493 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:48:46,493 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:48:46,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:48:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 387. [2020-02-10 19:48:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-02-10 19:48:46,503 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-02-10 19:48:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:46,504 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-02-10 19:48:46,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-02-10 19:48:46,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:46,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:46,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 19:48:46,504 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 19:48:46,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:46,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1331505154, now seen corresponding path program 717 times [2020-02-10 19:48:46,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:46,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588610210] [2020-02-10 19:48:46,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:46,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 19:48:46,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588610210] [2020-02-10 19:48:46,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:46,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:46,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140153138] [2020-02-10 19:48:46,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:46,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:46,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:46,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:46,791 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:48:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:46,929 INFO L93 Difference]: Finished difference Result 563 states and 1676 transitions. [2020-02-10 19:48:46,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:46,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:46,931 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:48:46,931 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:48:46,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 19:48:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:48:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 389. [2020-02-10 19:48:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:48:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-02-10 19:48:46,941 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-02-10 19:48:46,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:46,941 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-02-10 19:48:46,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-02-10 19:48:46,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:46,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:46,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 19:48:46,942 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 19:48:46,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:46,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1866734956, now seen corresponding path program 718 times [2020-02-10 19:48:46,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:46,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310392039] [2020-02-10 19:48:46,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:47,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 19:48:47,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310392039] [2020-02-10 19:48:47,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:47,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:47,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293993930] [2020-02-10 19:48:47,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:47,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:47,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:47,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:47,227 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:48:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:47,369 INFO L93 Difference]: Finished difference Result 566 states and 1680 transitions. [2020-02-10 19:48:47,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:47,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:47,371 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:48:47,371 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:48:47,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:48:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 387. [2020-02-10 19:48:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1333 transitions. [2020-02-10 19:48:47,382 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1333 transitions. Word has length 22 [2020-02-10 19:48:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:47,382 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1333 transitions. [2020-02-10 19:48:47,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1333 transitions. [2020-02-10 19:48:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:47,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:47,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 19:48:47,383 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 19:48:47,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:47,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1257983426, now seen corresponding path program 719 times [2020-02-10 19:48:47,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:47,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675669390] [2020-02-10 19:48:47,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:47,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 19:48:47,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675669390] [2020-02-10 19:48:47,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:47,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:47,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809474220] [2020-02-10 19:48:47,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:47,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:47,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:47,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:47,673 INFO L87 Difference]: Start difference. First operand 387 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:48:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:47,816 INFO L93 Difference]: Finished difference Result 574 states and 1699 transitions. [2020-02-10 19:48:47,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:47,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:47,818 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:48:47,818 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:48:47,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:47,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:48:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 392. [2020-02-10 19:48:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:48:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1342 transitions. [2020-02-10 19:48:47,829 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1342 transitions. Word has length 22 [2020-02-10 19:48:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:47,829 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1342 transitions. [2020-02-10 19:48:47,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1342 transitions. [2020-02-10 19:48:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:47,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:47,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 19:48:47,830 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 19:48:47,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:47,830 INFO L82 PathProgramCache]: Analyzing trace with hash 184898046, now seen corresponding path program 720 times [2020-02-10 19:48:47,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:47,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962190434] [2020-02-10 19:48:47,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:48,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 19:48:48,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962190434] [2020-02-10 19:48:48,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:48,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:48,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665359196] [2020-02-10 19:48:48,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:48,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:48,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:48,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:48,117 INFO L87 Difference]: Start difference. First operand 392 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:48:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:48,277 INFO L93 Difference]: Finished difference Result 573 states and 1692 transitions. [2020-02-10 19:48:48,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:48,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:48,279 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:48:48,280 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:48:48,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 19:48:48,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:48:48,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 379. [2020-02-10 19:48:48,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:48:48,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1320 transitions. [2020-02-10 19:48:48,288 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1320 transitions. Word has length 22 [2020-02-10 19:48:48,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:48,288 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1320 transitions. [2020-02-10 19:48:48,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:48,289 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1320 transitions. [2020-02-10 19:48:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:48,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:48,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 19:48:48,289 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 19:48:48,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:48,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1940093732, now seen corresponding path program 721 times [2020-02-10 19:48:48,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:48,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202499409] [2020-02-10 19:48:48,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:48,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 19:48:48,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202499409] [2020-02-10 19:48:48,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:48,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:48,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123752429] [2020-02-10 19:48:48,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:48,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:48,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:48,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:48,597 INFO L87 Difference]: Start difference. First operand 379 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:48:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:48,717 INFO L93 Difference]: Finished difference Result 597 states and 1761 transitions. [2020-02-10 19:48:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:48,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:48,719 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:48:48,719 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 19:48:48,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 19:48:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 387. [2020-02-10 19:48:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-02-10 19:48:48,729 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-02-10 19:48:48,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:48,729 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-02-10 19:48:48,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-02-10 19:48:48,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:48,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:48,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 19:48:48,729 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 19:48:48,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:48,730 INFO L82 PathProgramCache]: Analyzing trace with hash -764607678, now seen corresponding path program 722 times [2020-02-10 19:48:48,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:48,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961800245] [2020-02-10 19:48:48,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:49,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 19:48:49,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961800245] [2020-02-10 19:48:49,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:49,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:49,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87944142] [2020-02-10 19:48:49,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:49,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:49,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:49,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:49,042 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:48:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:49,160 INFO L93 Difference]: Finished difference Result 592 states and 1748 transitions. [2020-02-10 19:48:49,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:49,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:49,162 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:48:49,162 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:48:49,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 19:48:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:48:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 383. [2020-02-10 19:48:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:48:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1332 transitions. [2020-02-10 19:48:49,172 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1332 transitions. Word has length 22 [2020-02-10 19:48:49,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:49,172 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1332 transitions. [2020-02-10 19:48:49,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1332 transitions. [2020-02-10 19:48:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:49,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:49,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 19:48:49,173 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 19:48:49,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:49,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1002323244, now seen corresponding path program 723 times [2020-02-10 19:48:49,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:49,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440145074] [2020-02-10 19:48:49,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:49,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 19:48:49,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440145074] [2020-02-10 19:48:49,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:49,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:49,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76981287] [2020-02-10 19:48:49,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:49,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:49,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:49,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:49,472 INFO L87 Difference]: Start difference. First operand 383 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:48:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:49,591 INFO L93 Difference]: Finished difference Result 593 states and 1749 transitions. [2020-02-10 19:48:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:49,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:49,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:49,593 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:48:49,593 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:48:49,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 19:48:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:48:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 385. [2020-02-10 19:48:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:48:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1334 transitions. [2020-02-10 19:48:49,603 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1334 transitions. Word has length 22 [2020-02-10 19:48:49,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:49,603 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1334 transitions. [2020-02-10 19:48:49,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1334 transitions. [2020-02-10 19:48:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:49,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:49,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 19:48:49,604 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 19:48:49,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:49,604 INFO L82 PathProgramCache]: Analyzing trace with hash -441254752, now seen corresponding path program 724 times [2020-02-10 19:48:49,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:49,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111648256] [2020-02-10 19:48:49,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:49,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 19:48:49,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111648256] [2020-02-10 19:48:49,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:49,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:49,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381316451] [2020-02-10 19:48:49,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:49,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:49,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:49,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:49,911 INFO L87 Difference]: Start difference. First operand 385 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:48:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:50,034 INFO L93 Difference]: Finished difference Result 586 states and 1734 transitions. [2020-02-10 19:48:50,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:50,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:50,036 INFO L225 Difference]: With dead ends: 586 [2020-02-10 19:48:50,036 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:48:50,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 19:48:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:48:50,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 383. [2020-02-10 19:48:50,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:48:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1330 transitions. [2020-02-10 19:48:50,046 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1330 transitions. Word has length 22 [2020-02-10 19:48:50,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:50,046 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1330 transitions. [2020-02-10 19:48:50,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1330 transitions. [2020-02-10 19:48:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:50,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:50,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 19:48:50,046 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 19:48:50,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:50,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2098353846, now seen corresponding path program 725 times [2020-02-10 19:48:50,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:50,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380913109] [2020-02-10 19:48:50,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:50,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 19:48:50,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380913109] [2020-02-10 19:48:50,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:50,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:50,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867082407] [2020-02-10 19:48:50,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:50,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:50,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:50,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:50,337 INFO L87 Difference]: Start difference. First operand 383 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:48:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:50,483 INFO L93 Difference]: Finished difference Result 582 states and 1727 transitions. [2020-02-10 19:48:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:50,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:50,485 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:48:50,485 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 19:48:50,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 19:48:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 19:48:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 384. [2020-02-10 19:48:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:48:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1331 transitions. [2020-02-10 19:48:50,495 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1331 transitions. Word has length 22 [2020-02-10 19:48:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:50,496 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1331 transitions. [2020-02-10 19:48:50,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1331 transitions. [2020-02-10 19:48:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:50,496 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:50,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 19:48:50,496 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 19:48:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:50,497 INFO L82 PathProgramCache]: Analyzing trace with hash 652836836, now seen corresponding path program 726 times [2020-02-10 19:48:50,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:50,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512465072] [2020-02-10 19:48:50,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:50,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 19:48:50,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512465072] [2020-02-10 19:48:50,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:50,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:50,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463635590] [2020-02-10 19:48:50,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:50,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:50,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:50,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:50,798 INFO L87 Difference]: Start difference. First operand 384 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:48:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:50,921 INFO L93 Difference]: Finished difference Result 580 states and 1722 transitions. [2020-02-10 19:48:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:50,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:50,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:50,923 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:48:50,923 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:48:50,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 19:48:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:48:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 381. [2020-02-10 19:48:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:48:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1326 transitions. [2020-02-10 19:48:50,933 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1326 transitions. Word has length 22 [2020-02-10 19:48:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:50,933 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1326 transitions. [2020-02-10 19:48:50,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1326 transitions. [2020-02-10 19:48:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:50,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:50,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 19:48:50,934 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 19:48:50,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:50,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1517608006, now seen corresponding path program 727 times [2020-02-10 19:48:50,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:50,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684429649] [2020-02-10 19:48:50,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48: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 19:48:51,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684429649] [2020-02-10 19:48:51,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:51,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:51,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294830696] [2020-02-10 19:48:51,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:51,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:51,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:51,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:51,242 INFO L87 Difference]: Start difference. First operand 381 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:48:51,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:51,366 INFO L93 Difference]: Finished difference Result 601 states and 1771 transitions. [2020-02-10 19:48:51,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:51,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:51,367 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:48:51,368 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:48:51,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 19:48:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:48:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 388. [2020-02-10 19:48:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-02-10 19:48:51,377 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-02-10 19:48:51,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:51,377 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-02-10 19:48:51,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-02-10 19:48:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:51,378 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:51,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 19:48:51,378 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 19:48:51,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:51,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1187093404, now seen corresponding path program 728 times [2020-02-10 19:48:51,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:51,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814398390] [2020-02-10 19:48:51,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:51,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 19:48:51,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814398390] [2020-02-10 19:48:51,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:51,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:51,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815045] [2020-02-10 19:48:51,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:51,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:51,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:51,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:51,675 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:48:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:51,792 INFO L93 Difference]: Finished difference Result 596 states and 1758 transitions. [2020-02-10 19:48:51,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:51,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:51,794 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:48:51,794 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 19:48:51,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 19:48:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 19:48:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 384. [2020-02-10 19:48:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:48:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1333 transitions. [2020-02-10 19:48:51,803 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1333 transitions. Word has length 22 [2020-02-10 19:48:51,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:51,804 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1333 transitions. [2020-02-10 19:48:51,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1333 transitions. [2020-02-10 19:48:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:51,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:51,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 19:48:51,805 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 19:48:51,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:51,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1618520178, now seen corresponding path program 729 times [2020-02-10 19:48:51,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:51,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67955192] [2020-02-10 19:48:51,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:52,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 19:48:52,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67955192] [2020-02-10 19:48:52,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:52,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:52,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721237874] [2020-02-10 19:48:52,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:52,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:52,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:52,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:52,112 INFO L87 Difference]: Start difference. First operand 384 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:48:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:52,210 INFO L93 Difference]: Finished difference Result 599 states and 1763 transitions. [2020-02-10 19:48:52,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:52,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:52,212 INFO L225 Difference]: With dead ends: 599 [2020-02-10 19:48:52,212 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:48:52,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 19:48:52,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:48:52,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 387. [2020-02-10 19:48:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:48:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-02-10 19:48:52,223 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-02-10 19:48:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:52,223 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-02-10 19:48:52,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-02-10 19:48:52,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:52,223 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:52,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 19:48:52,224 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 19:48:52,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:52,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1745156552, now seen corresponding path program 730 times [2020-02-10 19:48:52,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:52,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083014301] [2020-02-10 19:48:52,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:52,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 19:48:52,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083014301] [2020-02-10 19:48:52,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:52,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:52,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177654287] [2020-02-10 19:48:52,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:52,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:52,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:52,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:52,532 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:48:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:52,643 INFO L93 Difference]: Finished difference Result 593 states and 1749 transitions. [2020-02-10 19:48:52,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:52,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:52,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:52,645 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:48:52,645 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:48:52,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:48:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 384. [2020-02-10 19:48:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:48:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1330 transitions. [2020-02-10 19:48:52,656 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1330 transitions. Word has length 22 [2020-02-10 19:48:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:52,656 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1330 transitions. [2020-02-10 19:48:52,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1330 transitions. [2020-02-10 19:48:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:52,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:52,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 19:48:52,657 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 19:48:52,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash -669861616, now seen corresponding path program 731 times [2020-02-10 19:48:52,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:52,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279572475] [2020-02-10 19:48:52,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:52,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 19:48:52,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279572475] [2020-02-10 19:48:52,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:52,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:52,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052554717] [2020-02-10 19:48:52,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:52,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:52,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:52,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:52,956 INFO L87 Difference]: Start difference. First operand 384 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:48:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:53,066 INFO L93 Difference]: Finished difference Result 588 states and 1740 transitions. [2020-02-10 19:48:53,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:53,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:53,068 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:48:53,068 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:48:53,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 19:48:53,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:48:53,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 386. [2020-02-10 19:48:53,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-02-10 19:48:53,078 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-02-10 19:48:53,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:53,078 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-02-10 19:48:53,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-02-10 19:48:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:53,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:53,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 19:48:53,079 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 19:48:53,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:53,079 INFO L82 PathProgramCache]: Analyzing trace with hash 672071172, now seen corresponding path program 732 times [2020-02-10 19:48:53,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:53,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825394181] [2020-02-10 19:48:53,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:53,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 19:48:53,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825394181] [2020-02-10 19:48:53,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:53,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:53,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048126442] [2020-02-10 19:48:53,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:53,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:53,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:53,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:53,383 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:48:53,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:53,513 INFO L93 Difference]: Finished difference Result 587 states and 1736 transitions. [2020-02-10 19:48:53,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:53,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:53,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:53,515 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:48:53,515 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:48:53,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 19:48:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:48:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 381. [2020-02-10 19:48:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:48:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1324 transitions. [2020-02-10 19:48:53,525 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1324 transitions. Word has length 22 [2020-02-10 19:48:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:53,525 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1324 transitions. [2020-02-10 19:48:53,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1324 transitions. [2020-02-10 19:48:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:53,525 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:53,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 19:48:53,526 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 19:48:53,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:53,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1020911148, now seen corresponding path program 733 times [2020-02-10 19:48:53,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:53,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404100135] [2020-02-10 19:48:53,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:53,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404100135] [2020-02-10 19:48:53,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:53,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:53,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922359657] [2020-02-10 19:48:53,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:53,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:53,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:53,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:53,843 INFO L87 Difference]: Start difference. First operand 381 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:48:53,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:53,938 INFO L93 Difference]: Finished difference Result 591 states and 1742 transitions. [2020-02-10 19:48:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:53,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:53,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:53,940 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:48:53,940 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:48:53,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 19:48:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:48:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 385. [2020-02-10 19:48:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:48:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1332 transitions. [2020-02-10 19:48:53,950 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1332 transitions. Word has length 22 [2020-02-10 19:48:53,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:53,950 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1332 transitions. [2020-02-10 19:48:53,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1332 transitions. [2020-02-10 19:48:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:53,951 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:53,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 19:48:53,951 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 19:48:53,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:53,951 INFO L82 PathProgramCache]: Analyzing trace with hash -459842656, now seen corresponding path program 734 times [2020-02-10 19:48:53,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:53,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303697520] [2020-02-10 19:48:53,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:54,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 19:48:54,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303697520] [2020-02-10 19:48:54,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:54,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:54,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620770325] [2020-02-10 19:48:54,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:54,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:54,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:54,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:54,282 INFO L87 Difference]: Start difference. First operand 385 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:48:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:54,363 INFO L93 Difference]: Finished difference Result 584 states and 1727 transitions. [2020-02-10 19:48:54,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:54,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:54,365 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:48:54,365 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 19:48:54,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 19:48:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 19:48:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 383. [2020-02-10 19:48:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:48:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1328 transitions. [2020-02-10 19:48:54,376 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1328 transitions. Word has length 22 [2020-02-10 19:48:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:54,376 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1328 transitions. [2020-02-10 19:48:54,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1328 transitions. [2020-02-10 19:48:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:54,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:54,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 19:48:54,377 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 19:48:54,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:54,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1673618294, now seen corresponding path program 735 times [2020-02-10 19:48:54,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:54,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341520785] [2020-02-10 19:48:54,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:54,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 19:48:54,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341520785] [2020-02-10 19:48:54,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:54,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:54,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701670844] [2020-02-10 19:48:54,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:54,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:54,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:54,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:54,701 INFO L87 Difference]: Start difference. First operand 383 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:48:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:54,781 INFO L93 Difference]: Finished difference Result 593 states and 1745 transitions. [2020-02-10 19:48:54,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:54,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:54,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:54,782 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:48:54,783 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:48:54,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 19:48:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:48:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 386. [2020-02-10 19:48:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1332 transitions. [2020-02-10 19:48:54,793 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1332 transitions. Word has length 22 [2020-02-10 19:48:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:54,793 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1332 transitions. [2020-02-10 19:48:54,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1332 transitions. [2020-02-10 19:48:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:54,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:54,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 19:48:54,794 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 19:48:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:54,794 INFO L82 PathProgramCache]: Analyzing trace with hash 711414632, now seen corresponding path program 736 times [2020-02-10 19:48:54,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:54,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18210546] [2020-02-10 19:48:54,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:55,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 19:48:55,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18210546] [2020-02-10 19:48:55,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:55,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:55,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235496359] [2020-02-10 19:48:55,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:55,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:55,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:55,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:55,124 INFO L87 Difference]: Start difference. First operand 386 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:48:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:55,236 INFO L93 Difference]: Finished difference Result 587 states and 1731 transitions. [2020-02-10 19:48:55,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:55,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:55,238 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:48:55,238 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:48:55,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 19:48:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:48:55,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 383. [2020-02-10 19:48:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:48:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1326 transitions. [2020-02-10 19:48:55,248 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1326 transitions. Word has length 22 [2020-02-10 19:48:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:55,248 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1326 transitions. [2020-02-10 19:48:55,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1326 transitions. [2020-02-10 19:48:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:55,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:55,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 19:48:55,249 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 19:48:55,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:55,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1728340520, now seen corresponding path program 737 times [2020-02-10 19:48:55,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:55,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919385900] [2020-02-10 19:48:55,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:55,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 19:48:55,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919385900] [2020-02-10 19:48:55,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:55,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:55,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512239280] [2020-02-10 19:48:55,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:55,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:55,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:55,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:55,574 INFO L87 Difference]: Start difference. First operand 383 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:48:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:55,667 INFO L93 Difference]: Finished difference Result 577 states and 1712 transitions. [2020-02-10 19:48:55,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:55,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:55,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:55,669 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:48:55,669 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:48:55,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:55,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:48:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 384. [2020-02-10 19:48:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:48:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-02-10 19:48:55,679 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-02-10 19:48:55,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:55,679 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-02-10 19:48:55,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:55,679 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-02-10 19:48:55,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:55,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:55,680 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:55,680 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 19:48:55,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:55,680 INFO L82 PathProgramCache]: Analyzing trace with hash -955685818, now seen corresponding path program 738 times [2020-02-10 19:48:55,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:55,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152070837] [2020-02-10 19:48:55,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:55,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152070837] [2020-02-10 19:48:55,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:55,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:55,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779344358] [2020-02-10 19:48:55,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:55,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:55,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:55,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:55,997 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:48:56,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:56,110 INFO L93 Difference]: Finished difference Result 578 states and 1713 transitions. [2020-02-10 19:48:56,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:56,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:56,112 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:48:56,112 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:48:56,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 19:48:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:48:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 381. [2020-02-10 19:48:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:48:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1322 transitions. [2020-02-10 19:48:56,122 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1322 transitions. Word has length 22 [2020-02-10 19:48:56,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:56,122 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1322 transitions. [2020-02-10 19:48:56,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1322 transitions. [2020-02-10 19:48:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:56,123 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:56,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 19:48:56,123 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 19:48:56,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:56,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1636866802, now seen corresponding path program 739 times [2020-02-10 19:48:56,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:56,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804916825] [2020-02-10 19:48:56,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:56,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 19:48:56,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804916825] [2020-02-10 19:48:56,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:56,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:56,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739032099] [2020-02-10 19:48:56,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:56,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:56,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:56,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:56,438 INFO L87 Difference]: Start difference. First operand 381 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:48:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:56,547 INFO L93 Difference]: Finished difference Result 572 states and 1704 transitions. [2020-02-10 19:48:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:56,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:56,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:56,548 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:48:56,549 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:48:56,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 19:48:56,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:48:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 383. [2020-02-10 19:48:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:48:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1326 transitions. [2020-02-10 19:48:56,558 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1326 transitions. Word has length 22 [2020-02-10 19:48:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:56,558 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1326 transitions. [2020-02-10 19:48:56,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1326 transitions. [2020-02-10 19:48:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:56,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:56,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 19:48:56,559 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 19:48:56,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:56,559 INFO L82 PathProgramCache]: Analyzing trace with hash 191349792, now seen corresponding path program 740 times [2020-02-10 19:48:56,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:56,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549522598] [2020-02-10 19:48:56,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:56,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 19:48:56,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549522598] [2020-02-10 19:48:56,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:56,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:56,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948490737] [2020-02-10 19:48:56,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:56,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:56,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:56,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:56,880 INFO L87 Difference]: Start difference. First operand 383 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:48:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:56,968 INFO L93 Difference]: Finished difference Result 570 states and 1699 transitions. [2020-02-10 19:48:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:56,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:56,970 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:48:56,970 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:48:56,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 19:48:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:48:56,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-02-10 19:48:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:48:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1324 transitions. [2020-02-10 19:48:56,980 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1324 transitions. Word has length 22 [2020-02-10 19:48:56,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:56,980 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1324 transitions. [2020-02-10 19:48:56,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1324 transitions. [2020-02-10 19:48:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:56,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:56,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 19:48:56,981 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 19:48:56,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:56,981 INFO L82 PathProgramCache]: Analyzing trace with hash 36428948, now seen corresponding path program 741 times [2020-02-10 19:48:56,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:56,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267007724] [2020-02-10 19:48:56,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:57,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 19:48:57,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267007724] [2020-02-10 19:48:57,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:57,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:57,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497520354] [2020-02-10 19:48:57,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:57,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:57,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:57,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:57,321 INFO L87 Difference]: Start difference. First operand 382 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:48:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:57,428 INFO L93 Difference]: Finished difference Result 574 states and 1708 transitions. [2020-02-10 19:48:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:57,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:57,430 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:48:57,430 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:48:57,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 19:48:57,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:48:57,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-02-10 19:48:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:48:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-02-10 19:48:57,439 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-02-10 19:48:57,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:57,440 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-02-10 19:48:57,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-02-10 19:48:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:57,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:57,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 19:48:57,440 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 19:48:57,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:57,441 INFO L82 PathProgramCache]: Analyzing trace with hash 289521700, now seen corresponding path program 742 times [2020-02-10 19:48:57,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:57,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727647275] [2020-02-10 19:48:57,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:57,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 19:48:57,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727647275] [2020-02-10 19:48:57,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:57,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:57,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127271076] [2020-02-10 19:48:57,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:57,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:57,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:57,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:57,748 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:48:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:57,870 INFO L93 Difference]: Finished difference Result 573 states and 1704 transitions. [2020-02-10 19:48:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:57,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:57,872 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:48:57,873 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:48:57,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 19:48:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:48:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 382. [2020-02-10 19:48:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:48:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1323 transitions. [2020-02-10 19:48:57,882 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1323 transitions. Word has length 22 [2020-02-10 19:48:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:57,883 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1323 transitions. [2020-02-10 19:48:57,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1323 transitions. [2020-02-10 19:48:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:57,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:57,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 19:48:57,883 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 19:48:57,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1285441380, now seen corresponding path program 743 times [2020-02-10 19:48:57,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:57,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775534983] [2020-02-10 19:48:57,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:58,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 19:48:58,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775534983] [2020-02-10 19:48:58,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:58,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:58,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413390796] [2020-02-10 19:48:58,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:58,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:58,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:58,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:58,212 INFO L87 Difference]: Start difference. First operand 382 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:48:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:58,289 INFO L93 Difference]: Finished difference Result 569 states and 1696 transitions. [2020-02-10 19:48:58,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:58,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:58,291 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:48:58,291 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:48:58,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:48:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 383. [2020-02-10 19:48:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:48:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-02-10 19:48:58,301 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-02-10 19:48:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:58,301 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-02-10 19:48:58,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-02-10 19:48:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:58,301 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:58,301 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:58,301 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 19:48:58,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:58,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1398584958, now seen corresponding path program 744 times [2020-02-10 19:48:58,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:58,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574306546] [2020-02-10 19:48:58,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:58,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574306546] [2020-02-10 19:48:58,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:58,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:58,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366667419] [2020-02-10 19:48:58,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:58,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:58,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:58,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:58,614 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:48:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:58,725 INFO L93 Difference]: Finished difference Result 570 states and 1697 transitions. [2020-02-10 19:48:58,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:58,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:58,727 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:48:58,727 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:48:58,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 19:48:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:48:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 379. [2020-02-10 19:48:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:48:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1318 transitions. [2020-02-10 19:48:58,735 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1318 transitions. Word has length 22 [2020-02-10 19:48:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:58,736 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1318 transitions. [2020-02-10 19:48:58,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1318 transitions. [2020-02-10 19:48:58,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:58,736 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:58,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 19:48:58,736 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 19:48:58,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:58,737 INFO L82 PathProgramCache]: Analyzing trace with hash -869784238, now seen corresponding path program 745 times [2020-02-10 19:48:58,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:58,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8611770] [2020-02-10 19:48:58,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:59,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8611770] [2020-02-10 19:48:59,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:59,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:59,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227030037] [2020-02-10 19:48:59,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:59,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:59,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:59,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:59,037 INFO L87 Difference]: Start difference. First operand 379 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:48:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:59,120 INFO L93 Difference]: Finished difference Result 611 states and 1794 transitions. [2020-02-10 19:48:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:59,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:59,122 INFO L225 Difference]: With dead ends: 611 [2020-02-10 19:48:59,122 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 19:48:59,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 19:48:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 19:48:59,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 388. [2020-02-10 19:48:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:48:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1341 transitions. [2020-02-10 19:48:59,131 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1341 transitions. Word has length 22 [2020-02-10 19:48:59,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:59,132 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1341 transitions. [2020-02-10 19:48:59,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1341 transitions. [2020-02-10 19:48:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:59,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:59,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 19:48:59,132 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 19:48:59,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:59,133 INFO L82 PathProgramCache]: Analyzing trace with hash 720481648, now seen corresponding path program 746 times [2020-02-10 19:48:59,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:59,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457093330] [2020-02-10 19:48:59,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:59,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457093330] [2020-02-10 19:48:59,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:59,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:59,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087093366] [2020-02-10 19:48:59,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:59,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:59,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:59,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:59,428 INFO L87 Difference]: Start difference. First operand 388 states and 1341 transitions. Second operand 9 states. [2020-02-10 19:48:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:59,543 INFO L93 Difference]: Finished difference Result 606 states and 1781 transitions. [2020-02-10 19:48:59,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:59,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:59,545 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:48:59,545 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:48:59,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 19:48:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:48:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 384. [2020-02-10 19:48:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:48:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1333 transitions. [2020-02-10 19:48:59,556 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1333 transitions. Word has length 22 [2020-02-10 19:48:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:59,556 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1333 transitions. [2020-02-10 19:48:59,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1333 transitions. [2020-02-10 19:48:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:59,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:59,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 19:48:59,557 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 19:48:59,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:59,557 INFO L82 PathProgramCache]: Analyzing trace with hash 482766082, now seen corresponding path program 747 times [2020-02-10 19:48:59,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:59,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176412889] [2020-02-10 19:48:59,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:59,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 19:48:59,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176412889] [2020-02-10 19:48:59,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:59,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:48:59,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428525169] [2020-02-10 19:48:59,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:48:59,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:59,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:48:59,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:48:59,852 INFO L87 Difference]: Start difference. First operand 384 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:48:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:59,935 INFO L93 Difference]: Finished difference Result 607 states and 1782 transitions. [2020-02-10 19:48:59,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:48:59,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:48:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:59,936 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:48:59,936 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:48:59,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 19:48:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:48:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 386. [2020-02-10 19:48:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:48:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-02-10 19:48:59,946 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-02-10 19:48:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:59,946 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-02-10 19:48:59,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:48:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-02-10 19:48:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:48:59,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:59,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:59,947 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 19:48:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:59,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1043834574, now seen corresponding path program 748 times [2020-02-10 19:48:59,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:59,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424685628] [2020-02-10 19:48:59,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:00,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 19:49:00,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424685628] [2020-02-10 19:49:00,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:00,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:00,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751923989] [2020-02-10 19:49:00,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:00,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:00,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:00,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:00,240 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:49:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:00,330 INFO L93 Difference]: Finished difference Result 600 states and 1767 transitions. [2020-02-10 19:49:00,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:00,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:00,332 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:49:00,332 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 19:49: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 19:49:00,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 19:49:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 384. [2020-02-10 19:49:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1331 transitions. [2020-02-10 19:49:00,343 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1331 transitions. Word has length 22 [2020-02-10 19:49:00,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:00,343 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1331 transitions. [2020-02-10 19:49:00,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1331 transitions. [2020-02-10 19:49:00,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:00,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:00,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 19:49:00,344 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 19:49:00,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:00,344 INFO L82 PathProgramCache]: Analyzing trace with hash -711524124, now seen corresponding path program 749 times [2020-02-10 19:49:00,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:00,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871046439] [2020-02-10 19:49:00,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:00,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 19:49:00,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871046439] [2020-02-10 19:49:00,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:00,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:00,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062385469] [2020-02-10 19:49:00,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:00,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:00,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:00,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:00,654 INFO L87 Difference]: Start difference. First operand 384 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:49:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:00,763 INFO L93 Difference]: Finished difference Result 596 states and 1760 transitions. [2020-02-10 19:49:00,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:00,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:00,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:00,765 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:49:00,765 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:49:00,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:49:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 385. [2020-02-10 19:49:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:49:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1332 transitions. [2020-02-10 19:49:00,775 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1332 transitions. Word has length 22 [2020-02-10 19:49:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:00,776 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1332 transitions. [2020-02-10 19:49:00,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:00,776 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1332 transitions. [2020-02-10 19:49:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:00,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:00,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 19:49:00,777 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 19:49:00,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2137926162, now seen corresponding path program 750 times [2020-02-10 19:49:00,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:00,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669577818] [2020-02-10 19:49:00,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:01,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 19:49:01,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669577818] [2020-02-10 19:49:01,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:01,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:01,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058347568] [2020-02-10 19:49:01,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:01,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:01,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:01,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:01,097 INFO L87 Difference]: Start difference. First operand 385 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:49:01,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:01,181 INFO L93 Difference]: Finished difference Result 594 states and 1755 transitions. [2020-02-10 19:49:01,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:01,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:01,183 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:49:01,183 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:49:01,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 19:49:01,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:49:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 382. [2020-02-10 19:49:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1327 transitions. [2020-02-10 19:49:01,193 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1327 transitions. Word has length 22 [2020-02-10 19:49:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:01,193 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1327 transitions. [2020-02-10 19:49:01,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1327 transitions. [2020-02-10 19:49:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:01,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:01,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 19:49:01,194 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 19:49:01,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:01,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1665130118, now seen corresponding path program 751 times [2020-02-10 19:49:01,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:01,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556211706] [2020-02-10 19:49:01,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:01,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 19:49:01,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556211706] [2020-02-10 19:49:01,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:01,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:01,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055108233] [2020-02-10 19:49:01,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:01,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:01,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:01,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:01,505 INFO L87 Difference]: Start difference. First operand 382 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:49:01,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:01,587 INFO L93 Difference]: Finished difference Result 627 states and 1834 transitions. [2020-02-10 19:49:01,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:01,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:01,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:01,589 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:49:01,589 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 19:49:01,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 19:49:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 19:49:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 391. [2020-02-10 19:49:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:49:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1349 transitions. [2020-02-10 19:49:01,599 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1349 transitions. Word has length 22 [2020-02-10 19:49:01,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:01,600 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1349 transitions. [2020-02-10 19:49:01,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1349 transitions. [2020-02-10 19:49:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:01,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49: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 19:49:01,600 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 19:49:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1039571292, now seen corresponding path program 752 times [2020-02-10 19:49:01,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:01,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846382775] [2020-02-10 19:49:01,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:01,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 19:49:01,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846382775] [2020-02-10 19:49:01,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:01,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:01,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723914935] [2020-02-10 19:49:01,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:01,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:01,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:01,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:01,908 INFO L87 Difference]: Start difference. First operand 391 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:49:02,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:02,015 INFO L93 Difference]: Finished difference Result 622 states and 1821 transitions. [2020-02-10 19:49:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:02,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:02,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:02,017 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:49:02,017 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 19:49:02,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 19:49:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 19:49:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 387. [2020-02-10 19:49:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:49:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-02-10 19:49:02,026 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-02-10 19:49:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:02,026 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-02-10 19:49:02,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-02-10 19:49:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:02,027 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:02,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 19:49:02,027 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 19:49:02,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:02,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1930180982, now seen corresponding path program 753 times [2020-02-10 19:49:02,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:02,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248524460] [2020-02-10 19:49:02,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:02,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 19:49:02,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248524460] [2020-02-10 19:49:02,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:02,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:02,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610533413] [2020-02-10 19:49:02,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:02,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:02,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:02,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:02,351 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-02-10 19:49:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:02,434 INFO L93 Difference]: Finished difference Result 634 states and 1846 transitions. [2020-02-10 19:49:02,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:02,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:02,436 INFO L225 Difference]: With dead ends: 634 [2020-02-10 19:49:02,436 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 19:49:02,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:02,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 19:49:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 395. [2020-02-10 19:49:02,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:49:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1352 transitions. [2020-02-10 19:49:02,445 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1352 transitions. Word has length 22 [2020-02-10 19:49:02,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:02,445 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1352 transitions. [2020-02-10 19:49:02,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:02,445 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1352 transitions. [2020-02-10 19:49:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:02,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:02,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 19:49:02,446 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 19:49:02,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:02,446 INFO L82 PathProgramCache]: Analyzing trace with hash 432609432, now seen corresponding path program 754 times [2020-02-10 19:49:02,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:02,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171301575] [2020-02-10 19:49:02,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:02,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171301575] [2020-02-10 19:49:02,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:02,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:02,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811057001] [2020-02-10 19:49:02,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:02,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:02,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:02,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:02,776 INFO L87 Difference]: Start difference. First operand 395 states and 1352 transitions. Second operand 9 states. [2020-02-10 19:49:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:02,883 INFO L93 Difference]: Finished difference Result 632 states and 1836 transitions. [2020-02-10 19:49:02,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:02,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:02,885 INFO L225 Difference]: With dead ends: 632 [2020-02-10 19:49:02,885 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:49:02,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 19:49:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:49:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 387. [2020-02-10 19:49:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:49:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1334 transitions. [2020-02-10 19:49:02,895 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1334 transitions. Word has length 22 [2020-02-10 19:49:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:02,895 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1334 transitions. [2020-02-10 19:49:02,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1334 transitions. [2020-02-10 19:49:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:02,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:02,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:02,896 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 19:49:02,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:02,896 INFO L82 PathProgramCache]: Analyzing trace with hash 714884568, now seen corresponding path program 755 times [2020-02-10 19:49:02,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:02,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871041930] [2020-02-10 19:49:02,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:03,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 19:49:03,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871041930] [2020-02-10 19:49:03,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:03,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:03,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004906569] [2020-02-10 19:49:03,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:03,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:03,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:03,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:03,236 INFO L87 Difference]: Start difference. First operand 387 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:49:03,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:03,347 INFO L93 Difference]: Finished difference Result 619 states and 1811 transitions. [2020-02-10 19:49:03,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:03,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:03,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:03,349 INFO L225 Difference]: With dead ends: 619 [2020-02-10 19:49:03,349 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 19:49:03,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 19:49:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 390. [2020-02-10 19:49:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:49:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1339 transitions. [2020-02-10 19:49:03,358 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1339 transitions. Word has length 22 [2020-02-10 19:49:03,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:03,359 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1339 transitions. [2020-02-10 19:49:03,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:03,359 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1339 transitions. [2020-02-10 19:49:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:03,359 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:03,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 19:49:03,360 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 19:49:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash 733318594, now seen corresponding path program 756 times [2020-02-10 19:49:03,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:03,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877143846] [2020-02-10 19:49:03,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:03,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 19:49:03,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877143846] [2020-02-10 19:49:03,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:03,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:03,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805064183] [2020-02-10 19:49:03,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:03,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:03,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:03,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:03,665 INFO L87 Difference]: Start difference. First operand 390 states and 1339 transitions. Second operand 9 states. [2020-02-10 19:49:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:03,777 INFO L93 Difference]: Finished difference Result 622 states and 1814 transitions. [2020-02-10 19:49:03,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:03,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:03,779 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:49:03,779 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:49:03,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:49:03,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 382. [2020-02-10 19:49:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1324 transitions. [2020-02-10 19:49:03,789 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1324 transitions. Word has length 22 [2020-02-10 19:49:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:03,789 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1324 transitions. [2020-02-10 19:49:03,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:03,789 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1324 transitions. [2020-02-10 19:49:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:03,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:03,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:03,790 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 19:49:03,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:03,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1470725694, now seen corresponding path program 757 times [2020-02-10 19:49:03,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:03,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138582458] [2020-02-10 19:49:03,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:04,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 19:49:04,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138582458] [2020-02-10 19:49:04,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:04,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:04,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695456731] [2020-02-10 19:49:04,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:04,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:04,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:04,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:04,084 INFO L87 Difference]: Start difference. First operand 382 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:49:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:04,177 INFO L93 Difference]: Finished difference Result 615 states and 1797 transitions. [2020-02-10 19:49:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:04,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:04,179 INFO L225 Difference]: With dead ends: 615 [2020-02-10 19:49:04,179 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:49:04,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:49:04,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 387. [2020-02-10 19:49:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:49:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1334 transitions. [2020-02-10 19:49:04,189 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1334 transitions. Word has length 22 [2020-02-10 19:49:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:04,189 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1334 transitions. [2020-02-10 19:49:04,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1334 transitions. [2020-02-10 19:49:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:04,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:04,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 19:49:04,190 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 19:49:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:04,190 INFO L82 PathProgramCache]: Analyzing trace with hash -909657202, now seen corresponding path program 758 times [2020-02-10 19:49:04,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:04,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191707756] [2020-02-10 19:49:04,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:04,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 19:49:04,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191707756] [2020-02-10 19:49:04,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:04,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:04,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029066018] [2020-02-10 19:49:04,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:04,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:04,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:04,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:04,501 INFO L87 Difference]: Start difference. First operand 387 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:49:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:04,580 INFO L93 Difference]: Finished difference Result 608 states and 1782 transitions. [2020-02-10 19:49:04,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:04,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:04,582 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:49:04,582 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 19:49:04,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 19:49:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 19:49:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 385. [2020-02-10 19:49:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:49:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1330 transitions. [2020-02-10 19:49:04,592 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1330 transitions. Word has length 22 [2020-02-10 19:49:04,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:04,592 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1330 transitions. [2020-02-10 19:49:04,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1330 transitions. [2020-02-10 19:49:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:04,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:04,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 19:49:04,593 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 19:49:04,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:04,593 INFO L82 PathProgramCache]: Analyzing trace with hash -458033162, now seen corresponding path program 759 times [2020-02-10 19:49:04,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:04,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329709668] [2020-02-10 19:49:04,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:04,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 19:49:04,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329709668] [2020-02-10 19:49:04,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:04,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:04,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063756657] [2020-02-10 19:49:04,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:04,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:04,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:04,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:04,897 INFO L87 Difference]: Start difference. First operand 385 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:49:04,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:04,978 INFO L93 Difference]: Finished difference Result 626 states and 1821 transitions. [2020-02-10 19:49:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:04,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:04,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:04,980 INFO L225 Difference]: With dead ends: 626 [2020-02-10 19:49:04,980 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:49:04,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 19:49:04,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:49:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 393. [2020-02-10 19:49:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:49:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1343 transitions. [2020-02-10 19:49:04,990 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1343 transitions. Word has length 22 [2020-02-10 19:49:04,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:04,990 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1343 transitions. [2020-02-10 19:49:04,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1343 transitions. [2020-02-10 19:49:04,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:04,990 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:04,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 19:49:04,991 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 19:49:04,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:04,991 INFO L82 PathProgramCache]: Analyzing trace with hash -588003608, now seen corresponding path program 760 times [2020-02-10 19:49:04,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:04,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620737208] [2020-02-10 19:49:04,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:05,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 19:49:05,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620737208] [2020-02-10 19:49:05,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:05,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:05,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067515416] [2020-02-10 19:49:05,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:05,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:05,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:05,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:05,300 INFO L87 Difference]: Start difference. First operand 393 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:49:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:05,409 INFO L93 Difference]: Finished difference Result 624 states and 1811 transitions. [2020-02-10 19:49:05,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:05,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:05,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:05,411 INFO L225 Difference]: With dead ends: 624 [2020-02-10 19:49:05,411 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:49:05,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 19:49:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:49:05,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 385. [2020-02-10 19:49:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:49:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1327 transitions. [2020-02-10 19:49:05,420 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1327 transitions. Word has length 22 [2020-02-10 19:49:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:05,420 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1327 transitions. [2020-02-10 19:49:05,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1327 transitions. [2020-02-10 19:49:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:05,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:05,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 19:49:05,421 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 19:49:05,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:05,421 INFO L82 PathProgramCache]: Analyzing trace with hash -403310936, now seen corresponding path program 761 times [2020-02-10 19:49:05,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:05,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904152329] [2020-02-10 19:49:05,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:05,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 19:49:05,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904152329] [2020-02-10 19:49:05,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:05,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:05,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093101986] [2020-02-10 19:49:05,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:05,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:05,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:05,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:05,735 INFO L87 Difference]: Start difference. First operand 385 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:49:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:05,832 INFO L93 Difference]: Finished difference Result 605 states and 1774 transitions. [2020-02-10 19:49:05,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:05,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:05,834 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:49:05,834 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:49:05,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 19:49:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:49:05,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 386. [2020-02-10 19:49:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:49:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-02-10 19:49:05,843 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-02-10 19:49:05,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:05,843 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-02-10 19:49:05,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-02-10 19:49:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:05,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:05,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 19:49:05,844 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 19:49:05,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:05,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1479022092, now seen corresponding path program 762 times [2020-02-10 19:49:05,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:05,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465740124] [2020-02-10 19:49:05,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49: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 19:49:06,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465740124] [2020-02-10 19:49:06,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:06,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:06,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804681829] [2020-02-10 19:49:06,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:06,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:06,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:06,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:06,150 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:49:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:06,283 INFO L93 Difference]: Finished difference Result 610 states and 1783 transitions. [2020-02-10 19:49:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:06,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:06,285 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:49:06,285 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:49:06,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 19:49:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:49:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 382. [2020-02-10 19:49:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-02-10 19:49:06,296 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-02-10 19:49:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:06,296 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-02-10 19:49:06,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-02-10 19:49:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:06,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:06,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 19:49:06,297 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 19:49:06,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:06,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1187052256, now seen corresponding path program 763 times [2020-02-10 19:49:06,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:06,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814188124] [2020-02-10 19:49:06,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:06,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 19:49:06,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814188124] [2020-02-10 19:49:06,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:06,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:06,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346342708] [2020-02-10 19:49:06,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:06,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:06,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:06,598 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:49:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:06,708 INFO L93 Difference]: Finished difference Result 591 states and 1746 transitions. [2020-02-10 19:49:06,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:06,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:06,710 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:49:06,710 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:49:06,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:49:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 384. [2020-02-10 19:49:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1325 transitions. [2020-02-10 19:49:06,719 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1325 transitions. Word has length 22 [2020-02-10 19:49:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:06,720 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1325 transitions. [2020-02-10 19:49:06,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1325 transitions. [2020-02-10 19:49:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:06,720 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:06,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 19:49:06,720 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 19:49:06,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:06,721 INFO L82 PathProgramCache]: Analyzing trace with hash -258464754, now seen corresponding path program 764 times [2020-02-10 19:49:06,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:06,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193825726] [2020-02-10 19:49:06,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:07,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 19:49:07,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193825726] [2020-02-10 19:49:07,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:07,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:07,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023960382] [2020-02-10 19:49:07,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:07,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:07,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:07,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:07,034 INFO L87 Difference]: Start difference. First operand 384 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:49:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:07,121 INFO L93 Difference]: Finished difference Result 589 states and 1741 transitions. [2020-02-10 19:49:07,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:07,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:07,123 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:49:07,123 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:49:07,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 19:49:07,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:49:07,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 383. [2020-02-10 19:49:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1323 transitions. [2020-02-10 19:49:07,133 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1323 transitions. Word has length 22 [2020-02-10 19:49:07,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:07,133 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1323 transitions. [2020-02-10 19:49:07,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1323 transitions. [2020-02-10 19:49:07,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:07,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:07,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 19:49:07,134 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 19:49:07,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:07,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2095222508, now seen corresponding path program 765 times [2020-02-10 19:49:07,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:07,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366109893] [2020-02-10 19:49:07,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:07,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366109893] [2020-02-10 19:49:07,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:07,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:07,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813785499] [2020-02-10 19:49:07,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:07,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:07,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:07,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:07,436 INFO L87 Difference]: Start difference. First operand 383 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:49:07,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:07,543 INFO L93 Difference]: Finished difference Result 598 states and 1761 transitions. [2020-02-10 19:49:07,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:07,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:07,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:07,545 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:49:07,546 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:49:07,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 19:49:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:49:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 386. [2020-02-10 19:49:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:49:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-02-10 19:49:07,557 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-02-10 19:49:07,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:07,557 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-02-10 19:49:07,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-02-10 19:49:07,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:07,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:07,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 19:49:07,558 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 19:49:07,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:07,559 INFO L82 PathProgramCache]: Analyzing trace with hash -709187378, now seen corresponding path program 766 times [2020-02-10 19:49:07,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:07,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177336979] [2020-02-10 19:49:07,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:07,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 19:49:07,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177336979] [2020-02-10 19:49:07,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:07,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:07,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888273801] [2020-02-10 19:49:07,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:07,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:07,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:07,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:07,871 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:49:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:07,979 INFO L93 Difference]: Finished difference Result 601 states and 1764 transitions. [2020-02-10 19:49:07,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:07,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:07,981 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:49:07,981 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:49:07,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 19:49:07,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:49:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 383. [2020-02-10 19:49:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1322 transitions. [2020-02-10 19:49:07,992 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1322 transitions. Word has length 22 [2020-02-10 19:49:07,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:07,992 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1322 transitions. [2020-02-10 19:49:07,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1322 transitions. [2020-02-10 19:49:07,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:07,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:07,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 19:49:07,993 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 19:49:07,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:07,993 INFO L82 PathProgramCache]: Analyzing trace with hash -846210076, now seen corresponding path program 767 times [2020-02-10 19:49:07,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:07,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296583096] [2020-02-10 19:49:07,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:08,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 19:49:08,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296583096] [2020-02-10 19:49:08,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:08,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:08,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475577080] [2020-02-10 19:49:08,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:08,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:08,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:08,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:08,295 INFO L87 Difference]: Start difference. First operand 383 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:49:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:08,386 INFO L93 Difference]: Finished difference Result 592 states and 1746 transitions. [2020-02-10 19:49:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:08,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:08,388 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:49:08,389 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:49:08,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 19:49:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:49:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 384. [2020-02-10 19:49:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-02-10 19:49:08,399 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-02-10 19:49:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:08,399 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-02-10 19:49:08,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-02-10 19:49:08,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:08,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:08,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 19:49:08,400 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 19:49:08,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:08,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1921921232, now seen corresponding path program 768 times [2020-02-10 19:49:08,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:08,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805963906] [2020-02-10 19:49:08,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:08,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 19:49:08,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805963906] [2020-02-10 19:49:08,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:08,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:08,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231384390] [2020-02-10 19:49:08,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:08,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:08,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:08,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:08,693 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:49:08,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:08,803 INFO L93 Difference]: Finished difference Result 597 states and 1755 transitions. [2020-02-10 19:49:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:08,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:08,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:08,805 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:49:08,805 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:49:08,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:49:08,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 379. [2020-02-10 19:49:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:49:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1315 transitions. [2020-02-10 19:49:08,815 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1315 transitions. Word has length 22 [2020-02-10 19:49:08,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:08,815 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1315 transitions. [2020-02-10 19:49:08,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1315 transitions. [2020-02-10 19:49:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:08,815 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:08,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 19:49:08,816 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 19:49:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:08,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1504425582, now seen corresponding path program 769 times [2020-02-10 19:49:08,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:08,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391501417] [2020-02-10 19:49:08,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:09,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 19:49:09,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391501417] [2020-02-10 19:49:09,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:09,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:09,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399152602] [2020-02-10 19:49:09,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:09,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:09,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:09,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:09,110 INFO L87 Difference]: Start difference. First operand 379 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:49:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:09,199 INFO L93 Difference]: Finished difference Result 623 states and 1831 transitions. [2020-02-10 19:49:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:09,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:09,201 INFO L225 Difference]: With dead ends: 623 [2020-02-10 19:49:09,201 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 19:49:09,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 19:49:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 19:49:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 390. [2020-02-10 19:49:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:49:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1347 transitions. [2020-02-10 19:49:09,212 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1347 transitions. Word has length 22 [2020-02-10 19:49:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:09,212 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1347 transitions. [2020-02-10 19:49:09,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1347 transitions. [2020-02-10 19:49:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:09,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:09,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 19:49:09,213 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 19:49:09,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:09,213 INFO L82 PathProgramCache]: Analyzing trace with hash 85840304, now seen corresponding path program 770 times [2020-02-10 19:49:09,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:09,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932456940] [2020-02-10 19:49:09,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:09,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 19:49:09,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932456940] [2020-02-10 19:49:09,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:09,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:09,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47895603] [2020-02-10 19:49:09,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:09,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:09,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:09,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:09,519 INFO L87 Difference]: Start difference. First operand 390 states and 1347 transitions. Second operand 9 states. [2020-02-10 19:49:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:09,628 INFO L93 Difference]: Finished difference Result 618 states and 1818 transitions. [2020-02-10 19:49:09,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:09,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:09,630 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:49:09,630 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 19:49:09,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 19:49:09,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 19:49:09,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 386. [2020-02-10 19:49:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:49:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1338 transitions. [2020-02-10 19:49:09,640 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1338 transitions. Word has length 22 [2020-02-10 19:49:09,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:09,640 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1338 transitions. [2020-02-10 19:49:09,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:09,640 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1338 transitions. [2020-02-10 19:49:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:09,641 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:09,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 19:49:09,641 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 19:49:09,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1403513410, now seen corresponding path program 771 times [2020-02-10 19:49:09,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:09,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421527168] [2020-02-10 19:49:09,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:09,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 19:49:09,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421527168] [2020-02-10 19:49:09,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:09,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:09,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453683789] [2020-02-10 19:49:09,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:09,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:09,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:09,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:09,952 INFO L87 Difference]: Start difference. First operand 386 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:49:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:10,040 INFO L93 Difference]: Finished difference Result 621 states and 1823 transitions. [2020-02-10 19:49:10,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:10,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:10,042 INFO L225 Difference]: With dead ends: 621 [2020-02-10 19:49:10,042 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 19:49:10,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 19:49:10,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 19:49:10,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 389. [2020-02-10 19:49:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:49:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1342 transitions. [2020-02-10 19:49:10,053 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1342 transitions. Word has length 22 [2020-02-10 19:49:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:10,053 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1342 transitions. [2020-02-10 19:49:10,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1342 transitions. [2020-02-10 19:49:10,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:10,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:10,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:10,054 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 19:49:10,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:10,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1276877036, now seen corresponding path program 772 times [2020-02-10 19:49:10,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:10,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765371688] [2020-02-10 19:49:10,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:10,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 19:49:10,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765371688] [2020-02-10 19:49:10,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:10,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:10,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227429524] [2020-02-10 19:49:10,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:10,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:10,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:10,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:10,358 INFO L87 Difference]: Start difference. First operand 389 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:49:10,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:10,469 INFO L93 Difference]: Finished difference Result 615 states and 1809 transitions. [2020-02-10 19:49:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:10,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:10,471 INFO L225 Difference]: With dead ends: 615 [2020-02-10 19:49:10,471 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:49:10,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 19:49:10,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:49:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-02-10 19:49:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:49:10,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-02-10 19:49:10,482 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-02-10 19:49:10,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:10,482 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-02-10 19:49:10,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-02-10 19:49:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:10,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:10,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 19:49:10,483 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 19:49:10,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:10,483 INFO L82 PathProgramCache]: Analyzing trace with hash 603072092, now seen corresponding path program 773 times [2020-02-10 19:49:10,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:10,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443268402] [2020-02-10 19:49:10,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:10,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 19:49:10,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443268402] [2020-02-10 19:49:10,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:10,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:10,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301995633] [2020-02-10 19:49:10,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:10,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:10,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:10,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:10,789 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:49:10,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:10,895 INFO L93 Difference]: Finished difference Result 610 states and 1800 transitions. [2020-02-10 19:49:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:10,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:10,896 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:49:10,896 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:49:10,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 19:49:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:49:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 388. [2020-02-10 19:49:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:49:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-02-10 19:49:10,907 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-02-10 19:49:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:10,907 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-02-10 19:49:10,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-02-10 19:49:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:10,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:10,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 19:49:10,908 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 19:49:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:10,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1945004880, now seen corresponding path program 774 times [2020-02-10 19:49:10,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:10,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748529669] [2020-02-10 19:49:10,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:11,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748529669] [2020-02-10 19:49:11,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:11,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:11,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666773553] [2020-02-10 19:49:11,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:11,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:11,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:11,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:11,214 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:49:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:11,323 INFO L93 Difference]: Finished difference Result 609 states and 1796 transitions. [2020-02-10 19:49:11,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:11,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:11,325 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:49:11,326 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:49:11,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:49:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 383. [2020-02-10 19:49:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1328 transitions. [2020-02-10 19:49:11,336 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1328 transitions. Word has length 22 [2020-02-10 19:49:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:11,336 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1328 transitions. [2020-02-10 19:49:11,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1328 transitions. [2020-02-10 19:49:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:11,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:11,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:11,337 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 19:49:11,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:11,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1452974500, now seen corresponding path program 775 times [2020-02-10 19:49:11,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:11,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275268750] [2020-02-10 19:49:11,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:11,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 19:49:11,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275268750] [2020-02-10 19:49:11,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:11,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:11,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916176877] [2020-02-10 19:49:11,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:11,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:11,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:11,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:11,648 INFO L87 Difference]: Start difference. First operand 383 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:49:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:11,724 INFO L93 Difference]: Finished difference Result 635 states and 1858 transitions. [2020-02-10 19:49:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:11,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:11,726 INFO L225 Difference]: With dead ends: 635 [2020-02-10 19:49:11,726 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 19:49:11,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 19:49:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 19:49:11,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 392. [2020-02-10 19:49:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:49:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1350 transitions. [2020-02-10 19:49:11,736 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1350 transitions. Word has length 22 [2020-02-10 19:49:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:11,737 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1350 transitions. [2020-02-10 19:49:11,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1350 transitions. [2020-02-10 19:49:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:11,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:11,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 19:49:11,737 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 19:49:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:11,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1251726910, now seen corresponding path program 776 times [2020-02-10 19:49:11,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:11,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990798380] [2020-02-10 19:49:11,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:12,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 19:49:12,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990798380] [2020-02-10 19:49:12,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:12,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:12,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838852892] [2020-02-10 19:49:12,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:12,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:12,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:12,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:12,073 INFO L87 Difference]: Start difference. First operand 392 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:49:12,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:12,183 INFO L93 Difference]: Finished difference Result 630 states and 1845 transitions. [2020-02-10 19:49:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:12,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:12,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:12,185 INFO L225 Difference]: With dead ends: 630 [2020-02-10 19:49:12,185 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 19:49:12,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 19:49:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 19:49:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 388. [2020-02-10 19:49:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:49:12,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1340 transitions. [2020-02-10 19:49:12,195 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1340 transitions. Word has length 22 [2020-02-10 19:49:12,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:12,195 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1340 transitions. [2020-02-10 19:49:12,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1340 transitions. [2020-02-10 19:49:12,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:12,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:12,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 19:49:12,196 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 19:49:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:12,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1718025364, now seen corresponding path program 777 times [2020-02-10 19:49:12,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:12,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197364692] [2020-02-10 19:49:12,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:12,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 19:49:12,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197364692] [2020-02-10 19:49:12,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:12,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:12,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125502295] [2020-02-10 19:49:12,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:12,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:12,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:12,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:12,527 INFO L87 Difference]: Start difference. First operand 388 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:49:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:12,615 INFO L93 Difference]: Finished difference Result 642 states and 1870 transitions. [2020-02-10 19:49:12,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:12,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:12,617 INFO L225 Difference]: With dead ends: 642 [2020-02-10 19:49:12,617 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 19:49:12,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 19:49:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 19:49:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 396. [2020-02-10 19:49:12,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:49:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1353 transitions. [2020-02-10 19:49:12,628 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1353 transitions. Word has length 22 [2020-02-10 19:49:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:12,628 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1353 transitions. [2020-02-10 19:49:12,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1353 transitions. [2020-02-10 19:49:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:12,629 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:12,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 19:49:12,629 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 19:49:12,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:12,629 INFO L82 PathProgramCache]: Analyzing trace with hash 220453814, now seen corresponding path program 778 times [2020-02-10 19:49:12,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:12,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63534043] [2020-02-10 19:49:12,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:12,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 19:49:12,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63534043] [2020-02-10 19:49:12,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:12,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:12,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032244178] [2020-02-10 19:49:12,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:12,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:12,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:12,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:12,951 INFO L87 Difference]: Start difference. First operand 396 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:49:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:13,062 INFO L93 Difference]: Finished difference Result 640 states and 1860 transitions. [2020-02-10 19:49:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:13,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:13,064 INFO L225 Difference]: With dead ends: 640 [2020-02-10 19:49:13,064 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 19:49:13,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 19:49:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 19:49:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 388. [2020-02-10 19:49:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:49:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1335 transitions. [2020-02-10 19:49:13,075 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1335 transitions. Word has length 22 [2020-02-10 19:49:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:13,075 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1335 transitions. [2020-02-10 19:49:13,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1335 transitions. [2020-02-10 19:49:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:13,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:13,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 19:49:13,076 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 19:49:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:13,076 INFO L82 PathProgramCache]: Analyzing trace with hash 502728950, now seen corresponding path program 779 times [2020-02-10 19:49:13,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:13,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119847865] [2020-02-10 19:49:13,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:13,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 19:49:13,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119847865] [2020-02-10 19:49:13,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:13,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:13,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564934938] [2020-02-10 19:49:13,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:13,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:13,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:13,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:13,382 INFO L87 Difference]: Start difference. First operand 388 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:49:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:13,496 INFO L93 Difference]: Finished difference Result 627 states and 1835 transitions. [2020-02-10 19:49:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:13,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:13,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:13,498 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:49:13,498 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:49:13,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 19:49:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:49:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 391. [2020-02-10 19:49:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:49:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1340 transitions. [2020-02-10 19:49:13,507 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1340 transitions. Word has length 22 [2020-02-10 19:49:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:13,507 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1340 transitions. [2020-02-10 19:49:13,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1340 transitions. [2020-02-10 19:49:13,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:13,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:13,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 19:49:13,508 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 19:49:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:13,509 INFO L82 PathProgramCache]: Analyzing trace with hash 521162976, now seen corresponding path program 780 times [2020-02-10 19:49:13,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:13,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957366859] [2020-02-10 19:49:13,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:13,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 19:49:13,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957366859] [2020-02-10 19:49:13,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:13,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:13,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848289463] [2020-02-10 19:49:13,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:13,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:13,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:13,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:13,842 INFO L87 Difference]: Start difference. First operand 391 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:49:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:13,956 INFO L93 Difference]: Finished difference Result 630 states and 1838 transitions. [2020-02-10 19:49:13,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:13,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:13,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:13,958 INFO L225 Difference]: With dead ends: 630 [2020-02-10 19:49:13,958 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 19:49:13,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 19:49:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 19:49:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 383. [2020-02-10 19:49:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-02-10 19:49:13,968 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-02-10 19:49:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:13,968 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-02-10 19:49:13,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-02-10 19:49:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:13,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:13,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:13,969 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 19:49:13,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1905105740, now seen corresponding path program 781 times [2020-02-10 19:49:13,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:13,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139441780] [2020-02-10 19:49:13,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:14,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139441780] [2020-02-10 19:49:14,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:14,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:14,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206161362] [2020-02-10 19:49:14,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:14,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:14,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:14,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:14,283 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:49:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:14,366 INFO L93 Difference]: Finished difference Result 629 states and 1837 transitions. [2020-02-10 19:49:14,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:14,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:14,368 INFO L225 Difference]: With dead ends: 629 [2020-02-10 19:49:14,368 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 19:49:14,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 19:49:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 19:49:14,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 390. [2020-02-10 19:49:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:49:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1340 transitions. [2020-02-10 19:49:14,379 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1340 transitions. Word has length 22 [2020-02-10 19:49:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:14,379 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1340 transitions. [2020-02-10 19:49:14,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1340 transitions. [2020-02-10 19:49:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:14,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:14,380 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:14,380 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 19:49:14,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:14,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1778469366, now seen corresponding path program 782 times [2020-02-10 19:49:14,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:14,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040486701] [2020-02-10 19:49:14,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:14,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 19:49:14,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040486701] [2020-02-10 19:49:14,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:14,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:14,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357779910] [2020-02-10 19:49:14,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:14,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:14,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:14,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:14,689 INFO L87 Difference]: Start difference. First operand 390 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:49:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:14,795 INFO L93 Difference]: Finished difference Result 623 states and 1823 transitions. [2020-02-10 19:49:14,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:14,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:14,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:14,797 INFO L225 Difference]: With dead ends: 623 [2020-02-10 19:49:14,797 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:49:14,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 19:49:14,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:49:14,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 387. [2020-02-10 19:49:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:49:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1333 transitions. [2020-02-10 19:49:14,807 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1333 transitions. Word has length 22 [2020-02-10 19:49:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:14,807 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1333 transitions. [2020-02-10 19:49:14,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1333 transitions. [2020-02-10 19:49:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:14,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:14,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 19:49:14,808 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 19:49:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:14,808 INFO L82 PathProgramCache]: Analyzing trace with hash -296790558, now seen corresponding path program 783 times [2020-02-10 19:49:14,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:14,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143543728] [2020-02-10 19:49:14,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49: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 19:49:15,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143543728] [2020-02-10 19:49:15,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:15,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:15,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936223590] [2020-02-10 19:49:15,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:15,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:15,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:15,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:15,133 INFO L87 Difference]: Start difference. First operand 387 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:49:15,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:15,218 INFO L93 Difference]: Finished difference Result 638 states and 1855 transitions. [2020-02-10 19:49:15,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:15,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:15,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:15,220 INFO L225 Difference]: With dead ends: 638 [2020-02-10 19:49:15,220 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 19:49:15,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 19:49:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 19:49:15,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 395. [2020-02-10 19:49:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:49:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1346 transitions. [2020-02-10 19:49:15,231 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1346 transitions. Word has length 22 [2020-02-10 19:49:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:15,231 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1346 transitions. [2020-02-10 19:49:15,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1346 transitions. [2020-02-10 19:49:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:15,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:15,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:15,232 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 19:49:15,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:15,232 INFO L82 PathProgramCache]: Analyzing trace with hash -946236150, now seen corresponding path program 784 times [2020-02-10 19:49:15,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:15,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188189673] [2020-02-10 19:49:15,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:15,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 19:49:15,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188189673] [2020-02-10 19:49:15,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:15,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:15,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081685835] [2020-02-10 19:49:15,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:15,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:15,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:15,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:15,544 INFO L87 Difference]: Start difference. First operand 395 states and 1346 transitions. Second operand 9 states. [2020-02-10 19:49:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:15,685 INFO L93 Difference]: Finished difference Result 636 states and 1845 transitions. [2020-02-10 19:49:15,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:15,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:15,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:15,687 INFO L225 Difference]: With dead ends: 636 [2020-02-10 19:49:15,687 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 19:49:15,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 19:49:15,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 19:49:15,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 387. [2020-02-10 19:49:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:49:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1329 transitions. [2020-02-10 19:49:15,697 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1329 transitions. Word has length 22 [2020-02-10 19:49:15,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:15,697 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1329 transitions. [2020-02-10 19:49:15,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1329 transitions. [2020-02-10 19:49:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:15,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:15,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 19:49:15,698 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 19:49:15,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:15,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1978642352, now seen corresponding path program 785 times [2020-02-10 19:49:15,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:15,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373112128] [2020-02-10 19:49:15,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:15,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 19:49:15,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373112128] [2020-02-10 19:49:15,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:15,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:15,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169393020] [2020-02-10 19:49:15,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:15,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:15,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:15,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:15,994 INFO L87 Difference]: Start difference. First operand 387 states and 1329 transitions. Second operand 9 states. [2020-02-10 19:49:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:16,123 INFO L93 Difference]: Finished difference Result 620 states and 1814 transitions. [2020-02-10 19:49:16,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:16,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:16,125 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:49:16,125 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:49:16,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 19:49:16,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:49:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 389. [2020-02-10 19:49:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:49:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1332 transitions. [2020-02-10 19:49:16,136 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1332 transitions. Word has length 22 [2020-02-10 19:49:16,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:16,136 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1332 transitions. [2020-02-10 19:49:16,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1332 transitions. [2020-02-10 19:49:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:16,136 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:16,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 19:49:16,137 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 19:49:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1060692162, now seen corresponding path program 786 times [2020-02-10 19:49:16,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:16,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649077695] [2020-02-10 19:49:16,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:16,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 19:49:16,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649077695] [2020-02-10 19:49:16,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:16,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:16,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881124321] [2020-02-10 19:49:16,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:16,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:16,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:16,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:16,439 INFO L87 Difference]: Start difference. First operand 389 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:49:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:16,564 INFO L93 Difference]: Finished difference Result 624 states and 1820 transitions. [2020-02-10 19:49:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:16,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:16,566 INFO L225 Difference]: With dead ends: 624 [2020-02-10 19:49:16,567 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 19:49:16,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 19:49:16,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 19:49:16,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 383. [2020-02-10 19:49:16,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:16,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-02-10 19:49:16,577 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-02-10 19:49:16,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:16,577 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-02-10 19:49:16,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-02-10 19:49:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:16,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:16,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 19:49:16,578 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 19:49:16,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:16,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1195571350, now seen corresponding path program 787 times [2020-02-10 19:49:16,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:16,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533395334] [2020-02-10 19:49:16,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:16,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 19:49:16,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533395334] [2020-02-10 19:49:16,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:16,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:16,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266072005] [2020-02-10 19:49:16,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:16,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:16,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:16,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:16,889 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:49:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:17,001 INFO L93 Difference]: Finished difference Result 605 states and 1785 transitions. [2020-02-10 19:49:17,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:17,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:17,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:17,003 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:49:17,003 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:49:17,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 19:49:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:49:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 387. [2020-02-10 19:49:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:49:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1330 transitions. [2020-02-10 19:49:17,012 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1330 transitions. Word has length 22 [2020-02-10 19:49:17,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:17,013 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1330 transitions. [2020-02-10 19:49:17,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1330 transitions. [2020-02-10 19:49:17,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:17,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:17,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 19:49:17,013 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 19:49:17,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:17,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1757463158, now seen corresponding path program 788 times [2020-02-10 19:49:17,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:17,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270571912] [2020-02-10 19:49:17,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:17,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 19:49:17,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270571912] [2020-02-10 19:49:17,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:17,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:17,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979373507] [2020-02-10 19:49:17,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:17,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:17,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:17,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:17,314 INFO L87 Difference]: Start difference. First operand 387 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:49:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:17,427 INFO L93 Difference]: Finished difference Result 604 states and 1781 transitions. [2020-02-10 19:49:17,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:17,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:17,429 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:49:17,429 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:49:17,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 19:49:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:49:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 385. [2020-02-10 19:49:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:49:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1325 transitions. [2020-02-10 19:49:17,446 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1325 transitions. Word has length 22 [2020-02-10 19:49:17,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:17,446 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1325 transitions. [2020-02-10 19:49:17,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1325 transitions. [2020-02-10 19:49:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:17,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:17,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 19:49:17,447 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 19:49:17,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1491080764, now seen corresponding path program 789 times [2020-02-10 19:49:17,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:17,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182392267] [2020-02-10 19:49:17,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:17,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 19:49:17,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182392267] [2020-02-10 19:49:17,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:17,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:17,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653252635] [2020-02-10 19:49:17,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:17,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:17,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:17,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:17,748 INFO L87 Difference]: Start difference. First operand 385 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:49:17,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:17,860 INFO L93 Difference]: Finished difference Result 610 states and 1794 transitions. [2020-02-10 19:49:17,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:17,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:17,862 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:49:17,862 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:49:17,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 19:49:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:49:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 388. [2020-02-10 19:49:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:49:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1330 transitions. [2020-02-10 19:49:17,873 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1330 transitions. Word has length 22 [2020-02-10 19:49:17,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:17,873 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1330 transitions. [2020-02-10 19:49:17,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1330 transitions. [2020-02-10 19:49:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:17,873 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:17,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 19:49:17,874 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 19:49:17,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:17,874 INFO L82 PathProgramCache]: Analyzing trace with hash -624520780, now seen corresponding path program 790 times [2020-02-10 19:49:17,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:17,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436091609] [2020-02-10 19:49:17,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:18,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 19:49:18,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436091609] [2020-02-10 19:49:18,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:18,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:18,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474353317] [2020-02-10 19:49:18,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:18,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:18,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:18,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:18,187 INFO L87 Difference]: Start difference. First operand 388 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:49:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:18,305 INFO L93 Difference]: Finished difference Result 613 states and 1797 transitions. [2020-02-10 19:49:18,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:18,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:18,307 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:49:18,307 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:49:18,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 19:49:18,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:49:18,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 385. [2020-02-10 19:49:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:49:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-02-10 19:49:18,317 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-02-10 19:49:18,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:18,318 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-02-10 19:49:18,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-02-10 19:49:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:18,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:18,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 19:49:18,319 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 19:49:18,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:18,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1222233356, now seen corresponding path program 791 times [2020-02-10 19:49:18,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:18,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23394001] [2020-02-10 19:49:18,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:18,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 19:49:18,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23394001] [2020-02-10 19:49:18,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:18,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:18,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301346297] [2020-02-10 19:49:18,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:18,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:18,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:18,627 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:49:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:18,738 INFO L93 Difference]: Finished difference Result 607 states and 1785 transitions. [2020-02-10 19:49:18,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:18,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:18,740 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:49:18,740 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 19:49:18,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 19:49:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 19:49:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 387. [2020-02-10 19:49:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:49:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1326 transitions. [2020-02-10 19:49:18,751 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1326 transitions. Word has length 22 [2020-02-10 19:49:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:18,751 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1326 transitions. [2020-02-10 19:49:18,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1326 transitions. [2020-02-10 19:49:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:18,751 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:18,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 19:49:18,752 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 19:49:18,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:18,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2140183546, now seen corresponding path program 792 times [2020-02-10 19:49:18,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:18,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080311305] [2020-02-10 19:49:18,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:19,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 19:49:19,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080311305] [2020-02-10 19:49:19,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:19,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:19,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573907452] [2020-02-10 19:49:19,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:19,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:19,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:19,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:19,047 INFO L87 Difference]: Start difference. First operand 387 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:49:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:19,161 INFO L93 Difference]: Finished difference Result 611 states and 1791 transitions. [2020-02-10 19:49:19,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:19,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:19,163 INFO L225 Difference]: With dead ends: 611 [2020-02-10 19:49:19,163 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 19:49:19,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 19:49:19,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 19:49:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 379. [2020-02-10 19:49:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:49:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1312 transitions. [2020-02-10 19:49:19,173 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1312 transitions. Word has length 22 [2020-02-10 19:49:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:19,173 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1312 transitions. [2020-02-10 19:49:19,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1312 transitions. [2020-02-10 19:49:19,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:19,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:19,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 19:49:19,174 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 19:49:19,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:19,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1449614060, now seen corresponding path program 793 times [2020-02-10 19:49:19,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:19,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397015603] [2020-02-10 19:49:19,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:19,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397015603] [2020-02-10 19:49:19,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:19,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:19,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396861230] [2020-02-10 19:49:19,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:19,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:19,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:19,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:19,476 INFO L87 Difference]: Start difference. First operand 379 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:49:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:19,559 INFO L93 Difference]: Finished difference Result 601 states and 1761 transitions. [2020-02-10 19:49:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:19,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:19,561 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:49:19,561 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:49: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 19:49:19,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:49:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 386. [2020-02-10 19:49:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:49:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1331 transitions. [2020-02-10 19:49:19,571 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1331 transitions. Word has length 22 [2020-02-10 19:49:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:19,571 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1331 transitions. [2020-02-10 19:49:19,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:19,571 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1331 transitions. [2020-02-10 19:49:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:19,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:19,572 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:19,572 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 19:49:19,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:19,572 INFO L82 PathProgramCache]: Analyzing trace with hash -888545568, now seen corresponding path program 794 times [2020-02-10 19:49:19,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:19,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231091206] [2020-02-10 19:49:19,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:19,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 19:49:19,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231091206] [2020-02-10 19:49:19,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:19,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:19,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313174184] [2020-02-10 19:49:19,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:19,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:19,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:19,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:19,883 INFO L87 Difference]: Start difference. First operand 386 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:49:19,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:19,967 INFO L93 Difference]: Finished difference Result 594 states and 1746 transitions. [2020-02-10 19:49:19,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:19,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:19,969 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:49:19,969 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:49:19,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 19:49:19,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:49:19,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 384. [2020-02-10 19:49:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-02-10 19:49:19,979 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-02-10 19:49:19,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:19,979 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-02-10 19:49:19,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-02-10 19:49:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:19,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:19,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 19:49:19,980 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 19:49:19,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:19,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1244915382, now seen corresponding path program 795 times [2020-02-10 19:49:19,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:19,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430846556] [2020-02-10 19:49:19,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:20,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 19:49:20,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430846556] [2020-02-10 19:49:20,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:20,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:20,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438728379] [2020-02-10 19:49:20,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:20,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:20,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:20,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:20,294 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:49:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:20,385 INFO L93 Difference]: Finished difference Result 603 states and 1764 transitions. [2020-02-10 19:49:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:20,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:20,387 INFO L225 Difference]: With dead ends: 603 [2020-02-10 19:49:20,387 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:49:20,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 19:49:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:49:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 387. [2020-02-10 19:49:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:49:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1331 transitions. [2020-02-10 19:49:20,397 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1331 transitions. Word has length 22 [2020-02-10 19:49:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:20,397 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1331 transitions. [2020-02-10 19:49:20,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1331 transitions. [2020-02-10 19:49:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:20,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:20,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 19:49:20,398 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 19:49:20,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:20,398 INFO L82 PathProgramCache]: Analyzing trace with hash 282711720, now seen corresponding path program 796 times [2020-02-10 19:49:20,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:20,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123090887] [2020-02-10 19:49:20,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:20,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123090887] [2020-02-10 19:49:20,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:20,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:20,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589398065] [2020-02-10 19:49:20,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:20,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:20,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:20,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:20,721 INFO L87 Difference]: Start difference. First operand 387 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:49:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:20,833 INFO L93 Difference]: Finished difference Result 597 states and 1750 transitions. [2020-02-10 19:49:20,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:20,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:20,835 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:49:20,835 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:49:20,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 19:49:20,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:49:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-02-10 19:49:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1325 transitions. [2020-02-10 19:49:20,845 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1325 transitions. Word has length 22 [2020-02-10 19:49:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:20,845 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1325 transitions. [2020-02-10 19:49:20,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1325 transitions. [2020-02-10 19:49:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:20,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:20,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 19:49:20,846 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 19:49:20,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:20,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1299637608, now seen corresponding path program 797 times [2020-02-10 19:49:20,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:20,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720313587] [2020-02-10 19:49:20,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:21,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 19:49:21,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720313587] [2020-02-10 19:49:21,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:21,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:21,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752425267] [2020-02-10 19:49:21,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:21,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:21,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:21,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:21,176 INFO L87 Difference]: Start difference. First operand 384 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:49:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:21,259 INFO L93 Difference]: Finished difference Result 587 states and 1731 transitions. [2020-02-10 19:49:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:21,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:21,261 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:49:21,262 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:49:21,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 19:49:21,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:49:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 385. [2020-02-10 19:49:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:49:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1326 transitions. [2020-02-10 19:49:21,271 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1326 transitions. Word has length 22 [2020-02-10 19:49:21,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:21,271 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1326 transitions. [2020-02-10 19:49:21,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1326 transitions. [2020-02-10 19:49:21,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:21,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:21,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 19:49:21,272 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 19:49:21,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:21,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1384388730, now seen corresponding path program 798 times [2020-02-10 19:49:21,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:21,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448960324] [2020-02-10 19:49:21,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:21,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 19:49:21,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448960324] [2020-02-10 19:49:21,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:21,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:21,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168286835] [2020-02-10 19:49:21,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:21,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:21,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:21,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:21,597 INFO L87 Difference]: Start difference. First operand 385 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:49:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:21,709 INFO L93 Difference]: Finished difference Result 588 states and 1732 transitions. [2020-02-10 19:49:21,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:21,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:21,711 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:49:21,711 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:49:21,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:49:21,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 382. [2020-02-10 19:49:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-02-10 19:49:21,721 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-02-10 19:49:21,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:21,721 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-02-10 19:49:21,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-02-10 19:49:21,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:21,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:21,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:21,721 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 19:49:21,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:21,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2046950718, now seen corresponding path program 799 times [2020-02-10 19:49:21,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:21,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850202242] [2020-02-10 19:49:21,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:22,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 19:49:22,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850202242] [2020-02-10 19:49:22,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:22,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:22,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348602414] [2020-02-10 19:49:22,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:22,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:22,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:22,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:22,012 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:49:22,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:22,092 INFO L93 Difference]: Finished difference Result 611 states and 1782 transitions. [2020-02-10 19:49:22,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:22,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:22,094 INFO L225 Difference]: With dead ends: 611 [2020-02-10 19:49:22,094 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 19:49:22,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 19:49:22,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 19:49:22,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 387. [2020-02-10 19:49:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:49:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1331 transitions. [2020-02-10 19:49:22,104 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1331 transitions. Word has length 22 [2020-02-10 19:49:22,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:22,104 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1331 transitions. [2020-02-10 19:49:22,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:22,104 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1331 transitions. [2020-02-10 19:49:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:22,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:22,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 19:49:22,105 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 19:49:22,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:22,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1485882226, now seen corresponding path program 800 times [2020-02-10 19:49:22,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:22,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107006605] [2020-02-10 19:49:22,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:22,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 19:49:22,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107006605] [2020-02-10 19:49:22,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:22,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:22,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077121210] [2020-02-10 19:49:22,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:22,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:22,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:22,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:22,396 INFO L87 Difference]: Start difference. First operand 387 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:49:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:22,490 INFO L93 Difference]: Finished difference Result 604 states and 1767 transitions. [2020-02-10 19:49:22,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:22,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:22,492 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:49:22,492 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:49:22,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:22,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:49:22,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 385. [2020-02-10 19:49:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:49:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1327 transitions. [2020-02-10 19:49:22,502 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1327 transitions. Word has length 22 [2020-02-10 19:49:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:22,502 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1327 transitions. [2020-02-10 19:49:22,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1327 transitions. [2020-02-10 19:49:22,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:22,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:22,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 19:49:22,503 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 19:49:22,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:22,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1034258186, now seen corresponding path program 801 times [2020-02-10 19:49:22,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:22,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037391856] [2020-02-10 19:49:22,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:22,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 19:49:22,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037391856] [2020-02-10 19:49:22,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:22,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:22,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568930941] [2020-02-10 19:49:22,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:22,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:22,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:22,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:22,810 INFO L87 Difference]: Start difference. First operand 385 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:49:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:22,901 INFO L93 Difference]: Finished difference Result 622 states and 1806 transitions. [2020-02-10 19:49:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:22,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:22,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:22,903 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:49:22,903 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:49:22,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 19:49:22,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:49:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 393. [2020-02-10 19:49:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:49:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1340 transitions. [2020-02-10 19:49:22,914 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1340 transitions. Word has length 22 [2020-02-10 19:49:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:22,914 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1340 transitions. [2020-02-10 19:49:22,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1340 transitions. [2020-02-10 19:49:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:22,915 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:22,915 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:22,915 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 19:49:22,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:22,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1164228632, now seen corresponding path program 802 times [2020-02-10 19:49:22,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:22,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039153823] [2020-02-10 19:49:22,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:23,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 19:49:23,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039153823] [2020-02-10 19:49:23,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:23,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:23,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026330079] [2020-02-10 19:49:23,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:23,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:23,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:23,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:23,209 INFO L87 Difference]: Start difference. First operand 393 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:49:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:23,333 INFO L93 Difference]: Finished difference Result 620 states and 1796 transitions. [2020-02-10 19:49:23,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:23,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:23,335 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:49:23,336 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:49:23,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:23,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:49:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 385. [2020-02-10 19:49:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:49:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-02-10 19:49:23,345 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-02-10 19:49:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:23,345 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-02-10 19:49:23,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-02-10 19:49:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:23,345 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:23,345 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:23,346 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 19:49:23,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:23,346 INFO L82 PathProgramCache]: Analyzing trace with hash -979535960, now seen corresponding path program 803 times [2020-02-10 19:49:23,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:23,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729419457] [2020-02-10 19:49:23,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:23,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 19:49:23,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729419457] [2020-02-10 19:49:23,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:23,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:23,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146764120] [2020-02-10 19:49:23,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:23,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:23,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:23,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:23,633 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:49:23,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:23,716 INFO L93 Difference]: Finished difference Result 601 states and 1759 transitions. [2020-02-10 19:49:23,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:23,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:23,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:23,718 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:49:23,718 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:49:23,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:49:23,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 386. [2020-02-10 19:49:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:49:23,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-02-10 19:49:23,727 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-02-10 19:49:23,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:23,728 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-02-10 19:49:23,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-02-10 19:49:23,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:23,728 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:23,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 19:49:23,728 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 19:49:23,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:23,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2055247116, now seen corresponding path program 804 times [2020-02-10 19:49:23,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:23,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630082171] [2020-02-10 19:49:23,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:24,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 19:49:24,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630082171] [2020-02-10 19:49:24,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:24,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:24,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918844527] [2020-02-10 19:49:24,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:24,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:24,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:24,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:24,015 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:49:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:24,133 INFO L93 Difference]: Finished difference Result 606 states and 1768 transitions. [2020-02-10 19:49:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:24,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:24,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:24,135 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:49:24,135 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:49:24,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 19:49:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:49:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 382. [2020-02-10 19:49:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1318 transitions. [2020-02-10 19:49:24,145 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1318 transitions. Word has length 22 [2020-02-10 19:49:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:24,145 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1318 transitions. [2020-02-10 19:49:24,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1318 transitions. [2020-02-10 19:49:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:24,146 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:24,146 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:24,146 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 19:49:24,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:24,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1721354494, now seen corresponding path program 805 times [2020-02-10 19:49:24,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:24,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937077299] [2020-02-10 19:49:24,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:24,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 19:49:24,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937077299] [2020-02-10 19:49:24,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:24,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:24,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879553706] [2020-02-10 19:49:24,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:24,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:24,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:24,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:24,456 INFO L87 Difference]: Start difference. First operand 382 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:49:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:24,540 INFO L93 Difference]: Finished difference Result 617 states and 1796 transitions. [2020-02-10 19:49:24,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:24,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:24,542 INFO L225 Difference]: With dead ends: 617 [2020-02-10 19:49:24,542 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 19:49:24,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 19:49:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 389. [2020-02-10 19:49:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:49:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1334 transitions. [2020-02-10 19:49:24,553 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1334 transitions. Word has length 22 [2020-02-10 19:49:24,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:24,553 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1334 transitions. [2020-02-10 19:49:24,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1334 transitions. [2020-02-10 19:49:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:24,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:24,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 19:49:24,554 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 19:49:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:24,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1611409140, now seen corresponding path program 806 times [2020-02-10 19:49:24,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:24,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658919171] [2020-02-10 19:49:24,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:24,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 19:49:24,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658919171] [2020-02-10 19:49:24,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:24,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:24,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730959648] [2020-02-10 19:49:24,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:24,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:24,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:24,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:24,872 INFO L87 Difference]: Start difference. First operand 389 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:49:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:24,982 INFO L93 Difference]: Finished difference Result 611 states and 1782 transitions. [2020-02-10 19:49:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:24,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:24,984 INFO L225 Difference]: With dead ends: 611 [2020-02-10 19:49:24,984 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:49:24,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 19:49:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:49:24,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 386. [2020-02-10 19:49:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:49:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1327 transitions. [2020-02-10 19:49:24,993 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1327 transitions. Word has length 22 [2020-02-10 19:49:24,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:24,993 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1327 transitions. [2020-02-10 19:49:24,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:24,993 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1327 transitions. [2020-02-10 19:49:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:24,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:24,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 19:49:24,994 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 19:49:24,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:24,994 INFO L82 PathProgramCache]: Analyzing trace with hash 891775892, now seen corresponding path program 807 times [2020-02-10 19:49:24,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:24,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47529771] [2020-02-10 19:49:24,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:25,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 19:49:25,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47529771] [2020-02-10 19:49:25,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:25,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:25,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472761707] [2020-02-10 19:49:25,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:25,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:25,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:25,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:25,307 INFO L87 Difference]: Start difference. First operand 386 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:49:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:25,396 INFO L93 Difference]: Finished difference Result 626 states and 1814 transitions. [2020-02-10 19:49:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:25,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:25,398 INFO L225 Difference]: With dead ends: 626 [2020-02-10 19:49:25,398 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:49:25,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 19:49:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:49:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 394. [2020-02-10 19:49:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:49:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1340 transitions. [2020-02-10 19:49:25,408 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1340 transitions. Word has length 22 [2020-02-10 19:49:25,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:25,409 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1340 transitions. [2020-02-10 19:49:25,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1340 transitions. [2020-02-10 19:49:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:25,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:25,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 19:49:25,409 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 19:49:25,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:25,410 INFO L82 PathProgramCache]: Analyzing trace with hash 761805446, now seen corresponding path program 808 times [2020-02-10 19:49:25,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:25,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615367413] [2020-02-10 19:49:25,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:25,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:25,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615367413] [2020-02-10 19:49:25,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:25,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:25,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879283328] [2020-02-10 19:49:25,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:25,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:25,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:25,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:25,721 INFO L87 Difference]: Start difference. First operand 394 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:49:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:25,832 INFO L93 Difference]: Finished difference Result 624 states and 1804 transitions. [2020-02-10 19:49:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:25,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:25,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:25,834 INFO L225 Difference]: With dead ends: 624 [2020-02-10 19:49:25,834 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:49:25,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 19:49:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:49:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-02-10 19:49:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:49:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1323 transitions. [2020-02-10 19:49:25,844 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1323 transitions. Word has length 22 [2020-02-10 19:49:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:25,845 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1323 transitions. [2020-02-10 19:49:25,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1323 transitions. [2020-02-10 19:49:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:25,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:25,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 19:49:25,845 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 19:49:25,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2586096, now seen corresponding path program 809 times [2020-02-10 19:49:25,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:25,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871057238] [2020-02-10 19:49:25,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:26,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871057238] [2020-02-10 19:49:26,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:26,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:26,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257771831] [2020-02-10 19:49:26,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:26,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:26,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:26,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:26,137 INFO L87 Difference]: Start difference. First operand 386 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:49:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:26,250 INFO L93 Difference]: Finished difference Result 608 states and 1773 transitions. [2020-02-10 19:49:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:26,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:26,252 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:49:26,252 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:49:26,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 19:49:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:49:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 388. [2020-02-10 19:49:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:49:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1326 transitions. [2020-02-10 19:49:26,261 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1326 transitions. Word has length 22 [2020-02-10 19:49:26,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:26,261 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1326 transitions. [2020-02-10 19:49:26,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1326 transitions. [2020-02-10 19:49:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:26,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:26,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 19:49:26,262 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 19:49:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash -920536286, now seen corresponding path program 810 times [2020-02-10 19:49:26,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:26,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251352516] [2020-02-10 19:49:26,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:26,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 19:49:26,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251352516] [2020-02-10 19:49:26,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:26,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:26,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364700585] [2020-02-10 19:49:26,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:26,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:26,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:26,569 INFO L87 Difference]: Start difference. First operand 388 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:49:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:26,681 INFO L93 Difference]: Finished difference Result 612 states and 1779 transitions. [2020-02-10 19:49:26,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:26,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:26,683 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:49:26,684 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:49:26,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:49:26,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 382. [2020-02-10 19:49:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-02-10 19:49:26,694 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-02-10 19:49:26,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:26,694 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-02-10 19:49:26,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:26,694 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-02-10 19:49:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:26,694 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:26,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 19:49:26,695 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 19:49:26,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:26,695 INFO L82 PathProgramCache]: Analyzing trace with hash -183497330, now seen corresponding path program 811 times [2020-02-10 19:49:26,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:26,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193108512] [2020-02-10 19:49:26,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:27,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 19:49:27,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193108512] [2020-02-10 19:49:27,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:27,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:27,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576942909] [2020-02-10 19:49:27,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:27,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:27,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:27,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:27,011 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:49:27,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:27,099 INFO L93 Difference]: Finished difference Result 582 states and 1717 transitions. [2020-02-10 19:49:27,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:27,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:27,101 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:49:27,101 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 19:49:27,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 19:49:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 19:49:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 384. [2020-02-10 19:49:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-02-10 19:49:27,110 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-02-10 19:49:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:27,110 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-02-10 19:49:27,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-02-10 19:49:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:27,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:27,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 19:49:27,111 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 19:49:27,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:27,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1427443628, now seen corresponding path program 812 times [2020-02-10 19:49:27,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:27,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947579360] [2020-02-10 19:49:27,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:27,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 19:49:27,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947579360] [2020-02-10 19:49:27,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:27,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:27,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195678857] [2020-02-10 19:49:27,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:27,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:27,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:27,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:27,421 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:49:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:27,539 INFO L93 Difference]: Finished difference Result 583 states and 1718 transitions. [2020-02-10 19:49:27,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:27,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:27,541 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:49:27,541 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:49:27,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 19:49:27,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:49:27,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 383. [2020-02-10 19:49:27,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:27,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1317 transitions. [2020-02-10 19:49:27,550 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1317 transitions. Word has length 22 [2020-02-10 19:49:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:27,550 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1317 transitions. [2020-02-10 19:49:27,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1317 transitions. [2020-02-10 19:49:27,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:27,551 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:27,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 19:49:27,551 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 19:49:27,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1865334240, now seen corresponding path program 813 times [2020-02-10 19:49:27,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:27,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356860575] [2020-02-10 19:49:27,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:27,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 19:49:27,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356860575] [2020-02-10 19:49:27,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:27,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:27,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962678644] [2020-02-10 19:49:27,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:27,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:27,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:27,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:27,846 INFO L87 Difference]: Start difference. First operand 383 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:49:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:27,933 INFO L93 Difference]: Finished difference Result 586 states and 1724 transitions. [2020-02-10 19:49:27,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:27,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:27,935 INFO L225 Difference]: With dead ends: 586 [2020-02-10 19:49:27,935 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:49:27,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:49:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 384. [2020-02-10 19:49:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1318 transitions. [2020-02-10 19:49:27,945 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1318 transitions. Word has length 22 [2020-02-10 19:49:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:27,946 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1318 transitions. [2020-02-10 19:49:27,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1318 transitions. [2020-02-10 19:49:27,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:27,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:27,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 19:49:27,946 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 19:49:27,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1353921900, now seen corresponding path program 814 times [2020-02-10 19:49:27,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:27,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065216372] [2020-02-10 19:49:27,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:28,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 19:49:28,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065216372] [2020-02-10 19:49:28,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:28,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:28,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942236029] [2020-02-10 19:49:28,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:28,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:28,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:28,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:28,231 INFO L87 Difference]: Start difference. First operand 384 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:49:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:28,353 INFO L93 Difference]: Finished difference Result 591 states and 1733 transitions. [2020-02-10 19:49:28,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:28,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:28,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:28,355 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:49:28,355 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:49:28,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 19:49:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:49:28,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 383. [2020-02-10 19:49:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-02-10 19:49:28,365 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-02-10 19:49:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:28,365 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-02-10 19:49:28,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-02-10 19:49:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:28,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:28,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 19:49:28,366 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 19:49:28,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:28,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1854831136, now seen corresponding path program 815 times [2020-02-10 19:49:28,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:28,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460786350] [2020-02-10 19:49:28,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:28,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 19:49:28,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460786350] [2020-02-10 19:49:28,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:28,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:28,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334811164] [2020-02-10 19:49:28,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:28,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:28,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:28,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:28,667 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:49:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:28,777 INFO L93 Difference]: Finished difference Result 589 states and 1730 transitions. [2020-02-10 19:49:28,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:28,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:28,779 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:49:28,779 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:49:28,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:28,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:49:28,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 385. [2020-02-10 19:49:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:49:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1319 transitions. [2020-02-10 19:49:28,789 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1319 transitions. Word has length 22 [2020-02-10 19:49:28,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:28,789 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1319 transitions. [2020-02-10 19:49:28,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:28,789 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1319 transitions. [2020-02-10 19:49:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:28,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:28,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:28,790 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 19:49:28,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:28,790 INFO L82 PathProgramCache]: Analyzing trace with hash -246515954, now seen corresponding path program 816 times [2020-02-10 19:49:28,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:28,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152384443] [2020-02-10 19:49:28,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:29,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 19:49:29,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152384443] [2020-02-10 19:49:29,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:29,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:29,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293840947] [2020-02-10 19:49:29,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:29,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:29,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:29,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:29,086 INFO L87 Difference]: Start difference. First operand 385 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:49:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:29,204 INFO L93 Difference]: Finished difference Result 593 states and 1736 transitions. [2020-02-10 19:49:29,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:29,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:29,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:29,206 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:49:29,206 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 19:49:29,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 19:49:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 19:49:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 379. [2020-02-10 19:49:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:49:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1309 transitions. [2020-02-10 19:49:29,216 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1309 transitions. Word has length 22 [2020-02-10 19:49:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:29,216 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1309 transitions. [2020-02-10 19:49:29,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1309 transitions. [2020-02-10 19:49:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:29,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:29,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:29,217 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 19:49:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:29,217 INFO L82 PathProgramCache]: Analyzing trace with hash 363192438, now seen corresponding path program 817 times [2020-02-10 19:49:29,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:29,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278495782] [2020-02-10 19:49:29,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:29,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 19:49:29,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278495782] [2020-02-10 19:49:29,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:29,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:29,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662596261] [2020-02-10 19:49:29,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:29,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:29,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:29,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:29,642 INFO L87 Difference]: Start difference. First operand 379 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:49:29,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:29,766 INFO L93 Difference]: Finished difference Result 563 states and 1677 transitions. [2020-02-10 19:49:29,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:29,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:29,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:29,768 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:49:29,768 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:49:29,768 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 19:49:29,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:49:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 382. [2020-02-10 19:49:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-02-10 19:49:29,778 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-02-10 19:49:29,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:29,778 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-02-10 19:49:29,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-02-10 19:49:29,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:29,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:29,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 19:49:29,779 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 19:49:29,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:29,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1082324572, now seen corresponding path program 818 times [2020-02-10 19:49:29,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:29,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208944002] [2020-02-10 19:49:29,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:30,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 19:49:30,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208944002] [2020-02-10 19:49:30,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:30,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:30,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507846181] [2020-02-10 19:49:30,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:30,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:30,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:30,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:30,103 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:49:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:30,190 INFO L93 Difference]: Finished difference Result 561 states and 1672 transitions. [2020-02-10 19:49:30,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:30,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:30,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:30,192 INFO L225 Difference]: With dead ends: 561 [2020-02-10 19:49:30,192 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:49:30,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 19:49:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:49:30,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 381. [2020-02-10 19:49:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:49:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1315 transitions. [2020-02-10 19:49:30,202 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1315 transitions. Word has length 22 [2020-02-10 19:49:30,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:30,202 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1315 transitions. [2020-02-10 19:49:30,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1315 transitions. [2020-02-10 19:49:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:30,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:30,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 19:49:30,203 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 19:49:30,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:30,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1237245416, now seen corresponding path program 819 times [2020-02-10 19:49:30,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:30,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989112281] [2020-02-10 19:49:30,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:30,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 19:49:30,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989112281] [2020-02-10 19:49:30,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:30,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:30,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214039950] [2020-02-10 19:49:30,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:30,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:30,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:30,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:30,518 INFO L87 Difference]: Start difference. First operand 381 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:49:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:30,648 INFO L93 Difference]: Finished difference Result 565 states and 1681 transitions. [2020-02-10 19:49:30,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:30,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:30,650 INFO L225 Difference]: With dead ends: 565 [2020-02-10 19:49:30,650 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:49:30,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 19:49:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:49:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 383. [2020-02-10 19:49:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 19:49:30,659 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 19:49:30,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:30,660 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 19:49:30,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 19:49:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:30,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:30,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:30,660 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 19:49:30,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:30,661 INFO L82 PathProgramCache]: Analyzing trace with hash -984152664, now seen corresponding path program 820 times [2020-02-10 19:49:30,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:30,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729401684] [2020-02-10 19:49:30,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:31,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 19:49:31,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729401684] [2020-02-10 19:49:31,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:31,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:31,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205159697] [2020-02-10 19:49:31,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:31,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:31,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:31,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:31,007 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:49:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:31,124 INFO L93 Difference]: Finished difference Result 564 states and 1677 transitions. [2020-02-10 19:49:31,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:31,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:31,126 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:49:31,126 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:49:31,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 19:49:31,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:49:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 381. [2020-02-10 19:49:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:49:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1314 transitions. [2020-02-10 19:49:31,136 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1314 transitions. Word has length 22 [2020-02-10 19:49:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:31,137 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1314 transitions. [2020-02-10 19:49:31,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1314 transitions. [2020-02-10 19:49:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:31,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:31,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 19:49:31,137 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 19:49:31,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:31,138 INFO L82 PathProgramCache]: Analyzing trace with hash 11767016, now seen corresponding path program 821 times [2020-02-10 19:49:31,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:31,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797539267] [2020-02-10 19:49:31,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:31,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 19:49:31,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797539267] [2020-02-10 19:49:31,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:31,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:31,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502493445] [2020-02-10 19:49:31,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:31,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:31,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:31,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:31,462 INFO L87 Difference]: Start difference. First operand 381 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:49:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:31,547 INFO L93 Difference]: Finished difference Result 560 states and 1669 transitions. [2020-02-10 19:49:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:31,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:31,549 INFO L225 Difference]: With dead ends: 560 [2020-02-10 19:49:31,549 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:49:31,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 19:49:31,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:49:31,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 382. [2020-02-10 19:49:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-02-10 19:49:31,559 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-02-10 19:49:31,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:31,560 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-02-10 19:49:31,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-02-10 19:49:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:31,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:31,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 19:49:31,560 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 19:49:31,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:31,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1622707974, now seen corresponding path program 822 times [2020-02-10 19:49:31,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:31,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885930984] [2020-02-10 19:49:31,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:31,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 19:49:31,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885930984] [2020-02-10 19:49:31,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:31,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:31,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805317724] [2020-02-10 19:49:31,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:31,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:31,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:31,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:31,882 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:49:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:31,995 INFO L93 Difference]: Finished difference Result 561 states and 1670 transitions. [2020-02-10 19:49:31,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:31,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:31,996 INFO L225 Difference]: With dead ends: 561 [2020-02-10 19:49:31,997 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 19:49:31,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 19:49:32,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 19:49:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 380. [2020-02-10 19:49:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:49:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1312 transitions. [2020-02-10 19:49:32,006 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1312 transitions. Word has length 22 [2020-02-10 19:49:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:32,006 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1312 transitions. [2020-02-10 19:49:32,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1312 transitions. [2020-02-10 19:49:32,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:32,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:32,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 19:49:32,007 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 19:49:32,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:32,007 INFO L82 PathProgramCache]: Analyzing trace with hash -234144220, now seen corresponding path program 823 times [2020-02-10 19:49:32,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:32,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356630318] [2020-02-10 19:49:32,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:32,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 19:49:32,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356630318] [2020-02-10 19:49:32,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:32,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:32,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093815237] [2020-02-10 19:49:32,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:32,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:32,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:32,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:32,310 INFO L87 Difference]: Start difference. First operand 380 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:49:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:32,438 INFO L93 Difference]: Finished difference Result 568 states and 1687 transitions. [2020-02-10 19:49:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:32,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:32,439 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:49:32,440 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:49:32,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 19:49:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:49:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 382. [2020-02-10 19:49:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1316 transitions. [2020-02-10 19:49:32,455 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1316 transitions. Word has length 22 [2020-02-10 19:49:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:32,456 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1316 transitions. [2020-02-10 19:49:32,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1316 transitions. [2020-02-10 19:49:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:32,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:32,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 19:49:32,456 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 19:49:32,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:32,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1679661230, now seen corresponding path program 824 times [2020-02-10 19:49:32,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:32,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635425513] [2020-02-10 19:49:32,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:32,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 19:49:32,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635425513] [2020-02-10 19:49:32,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:32,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:32,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57091318] [2020-02-10 19:49:32,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:32,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:32,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:32,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:32,761 INFO L87 Difference]: Start difference. First operand 382 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:49:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:32,856 INFO L93 Difference]: Finished difference Result 566 states and 1682 transitions. [2020-02-10 19:49:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:32,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:32,858 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:49:32,858 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:49:32,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 19:49:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:49:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 381. [2020-02-10 19:49:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:49:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1314 transitions. [2020-02-10 19:49:32,869 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1314 transitions. Word has length 22 [2020-02-10 19:49:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:32,869 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1314 transitions. [2020-02-10 19:49:32,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:32,869 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1314 transitions. [2020-02-10 19:49:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:32,869 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:32,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 19:49:32,870 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 19:49:32,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:32,870 INFO L82 PathProgramCache]: Analyzing trace with hash 778548312, now seen corresponding path program 825 times [2020-02-10 19:49:32,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:32,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744822231] [2020-02-10 19:49:32,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:33,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 19:49:33,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744822231] [2020-02-10 19:49:33,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:33,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:33,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871714396] [2020-02-10 19:49:33,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:33,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:33,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:33,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:33,171 INFO L87 Difference]: Start difference. First operand 381 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:49:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:33,288 INFO L93 Difference]: Finished difference Result 575 states and 1702 transitions. [2020-02-10 19:49:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:33,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:33,290 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:49:33,290 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:49:33,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:49:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 384. [2020-02-10 19:49:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-02-10 19:49:33,300 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-02-10 19:49:33,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:33,300 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-02-10 19:49:33,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:33,300 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-02-10 19:49:33,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:33,301 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:33,301 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:33,301 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 19:49:33,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:33,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2130383854, now seen corresponding path program 826 times [2020-02-10 19:49:33,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:33,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017807934] [2020-02-10 19:49:33,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:33,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 19:49:33,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017807934] [2020-02-10 19:49:33,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:33,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:33,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262238430] [2020-02-10 19:49:33,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:33,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:33,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:33,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:33,604 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:49:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:33,720 INFO L93 Difference]: Finished difference Result 578 states and 1705 transitions. [2020-02-10 19:49:33,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:33,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:33,721 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:49:33,722 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:49:33,722 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:49:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 381. [2020-02-10 19:49:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:49:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1313 transitions. [2020-02-10 19:49:33,731 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1313 transitions. Word has length 22 [2020-02-10 19:49:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:33,731 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1313 transitions. [2020-02-10 19:49:33,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1313 transitions. [2020-02-10 19:49:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:33,732 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:33,732 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:33,732 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 19:49:33,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:33,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2027560744, now seen corresponding path program 827 times [2020-02-10 19:49:33,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:33,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773598258] [2020-02-10 19:49:33,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:34,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 19:49:34,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773598258] [2020-02-10 19:49:34,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:34,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:34,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516668510] [2020-02-10 19:49:34,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:34,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:34,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:34,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:34,063 INFO L87 Difference]: Start difference. First operand 381 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:49:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:34,145 INFO L93 Difference]: Finished difference Result 569 states and 1687 transitions. [2020-02-10 19:49:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:34,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:34,147 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:49:34,147 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:49:34,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 19:49:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:49:34,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-02-10 19:49:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1314 transitions. [2020-02-10 19:49:34,156 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1314 transitions. Word has length 22 [2020-02-10 19:49:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:34,157 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1314 transitions. [2020-02-10 19:49:34,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1314 transitions. [2020-02-10 19:49:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:34,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:34,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 19:49:34,157 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 19:49:34,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:34,158 INFO L82 PathProgramCache]: Analyzing trace with hash 951849588, now seen corresponding path program 828 times [2020-02-10 19:49:34,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:34,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072447483] [2020-02-10 19:49:34,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:34,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 19:49:34,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072447483] [2020-02-10 19:49:34,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:34,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:34,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274284567] [2020-02-10 19:49:34,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:34,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:34,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:34,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:34,452 INFO L87 Difference]: Start difference. First operand 382 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:49:34,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:34,562 INFO L93 Difference]: Finished difference Result 574 states and 1696 transitions. [2020-02-10 19:49:34,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:34,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:34,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:34,564 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:49:34,564 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:49:34,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:49:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-02-10 19:49:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:49:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1311 transitions. [2020-02-10 19:49:34,574 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1311 transitions. Word has length 22 [2020-02-10 19:49:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:34,575 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1311 transitions. [2020-02-10 19:49:34,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1311 transitions. [2020-02-10 19:49:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:34,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:34,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 19:49:34,575 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 19:49:34,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:34,576 INFO L82 PathProgramCache]: Analyzing trace with hash 91452004, now seen corresponding path program 829 times [2020-02-10 19:49:34,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:34,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923309422] [2020-02-10 19:49:34,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:34,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 19:49:34,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923309422] [2020-02-10 19:49:34,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:34,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:34,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319495256] [2020-02-10 19:49:34,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:34,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:34,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:34,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:34,891 INFO L87 Difference]: Start difference. First operand 380 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:49:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:35,004 INFO L93 Difference]: Finished difference Result 574 states and 1703 transitions. [2020-02-10 19:49:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:35,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:35,006 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:49:35,006 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:49:35,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 19:49:35,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:49:35,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-02-10 19:49:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1321 transitions. [2020-02-10 19:49:35,016 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1321 transitions. Word has length 22 [2020-02-10 19:49:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:35,016 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1321 transitions. [2020-02-10 19:49:35,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1321 transitions. [2020-02-10 19:49:35,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:35,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:35,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 19:49:35,017 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 19:49:35,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:35,017 INFO L82 PathProgramCache]: Analyzing trace with hash 344544756, now seen corresponding path program 830 times [2020-02-10 19:49:35,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:35,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443614342] [2020-02-10 19:49:35,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:35,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 19:49:35,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443614342] [2020-02-10 19:49:35,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:35,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:35,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903427457] [2020-02-10 19:49:35,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:35,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:35,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:35,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:35,325 INFO L87 Difference]: Start difference. First operand 384 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:49:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:35,442 INFO L93 Difference]: Finished difference Result 573 states and 1699 transitions. [2020-02-10 19:49:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:35,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:35,444 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:49:35,444 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:49:35,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 19:49:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:49:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 382. [2020-02-10 19:49:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1316 transitions. [2020-02-10 19:49:35,454 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1316 transitions. Word has length 22 [2020-02-10 19:49:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:35,454 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1316 transitions. [2020-02-10 19:49:35,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1316 transitions. [2020-02-10 19:49:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:35,455 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:35,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 19:49:35,455 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 19:49:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:35,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1590384906, now seen corresponding path program 831 times [2020-02-10 19:49:35,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:35,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536107007] [2020-02-10 19:49:35,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:35,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 19:49:35,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536107007] [2020-02-10 19:49:35,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:35,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:35,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305323092] [2020-02-10 19:49:35,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:35,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:35,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:35,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:35,780 INFO L87 Difference]: Start difference. First operand 382 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:49:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:35,891 INFO L93 Difference]: Finished difference Result 579 states and 1712 transitions. [2020-02-10 19:49:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:35,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:35,892 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:49:35,893 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:49:35,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:49:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 385. [2020-02-10 19:49:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:49:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-02-10 19:49:35,903 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-02-10 19:49:35,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:35,903 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-02-10 19:49:35,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:35,903 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-02-10 19:49:35,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:35,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:35,904 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:35,904 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 19:49:35,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:35,904 INFO L82 PathProgramCache]: Analyzing trace with hash -204349776, now seen corresponding path program 832 times [2020-02-10 19:49:35,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:35,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499305660] [2020-02-10 19:49:35,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:36,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 19:49:36,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499305660] [2020-02-10 19:49:36,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:36,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:36,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094935261] [2020-02-10 19:49:36,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:36,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:36,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:36,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:36,210 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:49:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:36,323 INFO L93 Difference]: Finished difference Result 582 states and 1715 transitions. [2020-02-10 19:49:36,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:36,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:36,325 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:49:36,325 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:49:36,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 19:49:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:49:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 382. [2020-02-10 19:49:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1314 transitions. [2020-02-10 19:49:36,335 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1314 transitions. Word has length 22 [2020-02-10 19:49:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:36,335 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1314 transitions. [2020-02-10 19:49:36,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1314 transitions. [2020-02-10 19:49:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:36,336 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:36,336 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:36,336 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 19:49:36,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash -196365100, now seen corresponding path program 833 times [2020-02-10 19:49:36,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:36,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713952338] [2020-02-10 19:49:36,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:36,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 19:49:36,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713952338] [2020-02-10 19:49:36,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:36,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:36,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725646406] [2020-02-10 19:49:36,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:36,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:36,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:36,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:36,632 INFO L87 Difference]: Start difference. First operand 382 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:49:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:36,739 INFO L93 Difference]: Finished difference Result 576 states and 1703 transitions. [2020-02-10 19:49:36,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:36,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:36,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:36,741 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:49:36,741 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:49:36,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 19:49:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:49:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 384. [2020-02-10 19:49:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-02-10 19:49:36,751 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-02-10 19:49:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:36,751 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-02-10 19:49:36,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-02-10 19:49:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:36,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:36,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 19:49:36,752 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 19:49:36,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:36,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1114315290, now seen corresponding path program 834 times [2020-02-10 19:49:36,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:36,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264987469] [2020-02-10 19:49:36,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:37,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 19:49:37,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264987469] [2020-02-10 19:49:37,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:37,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:37,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982652991] [2020-02-10 19:49:37,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:37,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:37,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:37,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:37,049 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:49:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:37,173 INFO L93 Difference]: Finished difference Result 580 states and 1709 transitions. [2020-02-10 19:49:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:37,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:37,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:37,175 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:49:37,176 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:49:37,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:49:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 380. [2020-02-10 19:49:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:49:37,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1310 transitions. [2020-02-10 19:49:37,185 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1310 transitions. Word has length 22 [2020-02-10 19:49:37,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:37,185 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1310 transitions. [2020-02-10 19:49:37,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:37,185 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1310 transitions. [2020-02-10 19:49:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:37,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:37,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:37,187 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 19:49:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:37,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1028468782, now seen corresponding path program 835 times [2020-02-10 19:49:37,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:37,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540178661] [2020-02-10 19:49:37,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:37,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 19:49:37,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540178661] [2020-02-10 19:49:37,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:37,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:37,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489085808] [2020-02-10 19:49:37,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:37,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:37,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:37,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:37,524 INFO L87 Difference]: Start difference. First operand 380 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:49:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:37,612 INFO L93 Difference]: Finished difference Result 563 states and 1674 transitions. [2020-02-10 19:49:37,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:37,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:37,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:37,614 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:49:37,614 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:49:37,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 19:49:37,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:49:37,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 382. [2020-02-10 19:49:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1314 transitions. [2020-02-10 19:49:37,623 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1314 transitions. Word has length 22 [2020-02-10 19:49:37,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:37,623 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1314 transitions. [2020-02-10 19:49:37,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1314 transitions. [2020-02-10 19:49:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:37,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:37,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 19:49:37,624 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 19:49:37,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:37,624 INFO L82 PathProgramCache]: Analyzing trace with hash 582472176, now seen corresponding path program 836 times [2020-02-10 19:49:37,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:37,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681160337] [2020-02-10 19:49:37,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:37,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 19:49:37,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681160337] [2020-02-10 19:49:37,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:37,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:37,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023800312] [2020-02-10 19:49:37,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:37,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:37,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:37,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:37,943 INFO L87 Difference]: Start difference. First operand 382 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:49:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:38,052 INFO L93 Difference]: Finished difference Result 564 states and 1675 transitions. [2020-02-10 19:49:38,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:38,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:38,054 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:49:38,054 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:49:38,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 19:49:38,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:49:38,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 381. [2020-02-10 19:49:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:49:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1312 transitions. [2020-02-10 19:49:38,063 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1312 transitions. Word has length 22 [2020-02-10 19:49:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:38,063 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1312 transitions. [2020-02-10 19:49:38,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1312 transitions. [2020-02-10 19:49:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:38,064 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:38,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 19:49:38,064 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 19:49:38,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:38,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1584661604, now seen corresponding path program 837 times [2020-02-10 19:49:38,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:38,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424049564] [2020-02-10 19:49:38,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:38,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 19:49:38,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424049564] [2020-02-10 19:49:38,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:38,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:38,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131849015] [2020-02-10 19:49:38,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:38,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:38,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:38,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:38,360 INFO L87 Difference]: Start difference. First operand 381 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:49:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:38,444 INFO L93 Difference]: Finished difference Result 567 states and 1681 transitions. [2020-02-10 19:49:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:38,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:38,446 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:49:38,446 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:49:38,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 19:49:38,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:49:38,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 382. [2020-02-10 19:49:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1313 transitions. [2020-02-10 19:49:38,454 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1313 transitions. Word has length 22 [2020-02-10 19:49:38,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:38,455 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1313 transitions. [2020-02-10 19:49:38,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1313 transitions. [2020-02-10 19:49:38,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:38,455 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:38,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 19:49:38,455 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 19:49:38,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:38,456 INFO L82 PathProgramCache]: Analyzing trace with hash 508950448, now seen corresponding path program 838 times [2020-02-10 19:49:38,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:38,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661009772] [2020-02-10 19:49:38,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:38,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 19:49:38,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661009772] [2020-02-10 19:49:38,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:38,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:38,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386788768] [2020-02-10 19:49:38,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:38,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:38,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:38,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:38,751 INFO L87 Difference]: Start difference. First operand 382 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:49:38,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:38,865 INFO L93 Difference]: Finished difference Result 572 states and 1690 transitions. [2020-02-10 19:49:38,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:38,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:38,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:38,867 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:49:38,868 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:49:38,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 19:49:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:49:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 381. [2020-02-10 19:49:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:49:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1311 transitions. [2020-02-10 19:49:38,877 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1311 transitions. Word has length 22 [2020-02-10 19:49:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:38,877 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1311 transitions. [2020-02-10 19:49:38,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1311 transitions. [2020-02-10 19:49:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:38,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:38,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 19:49:38,878 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 19:49:38,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:38,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1595164708, now seen corresponding path program 839 times [2020-02-10 19:49:38,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:38,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588752605] [2020-02-10 19:49:38,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:39,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 19:49:39,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588752605] [2020-02-10 19:49:39,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:39,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:39,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085124428] [2020-02-10 19:49:39,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:39,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:39,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:39,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:39,174 INFO L87 Difference]: Start difference. First operand 381 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:49:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:39,283 INFO L93 Difference]: Finished difference Result 570 states and 1687 transitions. [2020-02-10 19:49:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:39,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:39,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:39,285 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:49:39,285 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:49:39,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 19:49:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:49:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 383. [2020-02-10 19:49:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1314 transitions. [2020-02-10 19:49:39,294 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1314 transitions. Word has length 22 [2020-02-10 19:49:39,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:39,294 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1314 transitions. [2020-02-10 19:49:39,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1314 transitions. [2020-02-10 19:49:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:39,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:39,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 19:49:39,295 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 19:49:39,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:39,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1091487406, now seen corresponding path program 840 times [2020-02-10 19:49:39,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:39,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193999181] [2020-02-10 19:49:39,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:39,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 19:49:39,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193999181] [2020-02-10 19:49:39,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:39,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:39,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228947416] [2020-02-10 19:49:39,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:39,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:39,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:39,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:39,606 INFO L87 Difference]: Start difference. First operand 383 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:49:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:39,723 INFO L93 Difference]: Finished difference Result 574 states and 1693 transitions. [2020-02-10 19:49:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:39,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:39,725 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:49:39,725 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:49: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 19:49:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:49:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 376. [2020-02-10 19:49:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:49:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1303 transitions. [2020-02-10 19:49:39,735 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1303 transitions. Word has length 22 [2020-02-10 19:49:39,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:39,735 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1303 transitions. [2020-02-10 19:49:39,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1303 transitions. [2020-02-10 19:49:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:39,736 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49: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 19:49:39,736 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 19:49:39,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:39,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1001902390, now seen corresponding path program 841 times [2020-02-10 19:49:39,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:39,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540313301] [2020-02-10 19:49:39,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49: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 19:49:40,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540313301] [2020-02-10 19:49:40,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:40,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:40,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503540487] [2020-02-10 19:49:40,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:40,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:40,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:40,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:40,031 INFO L87 Difference]: Start difference. First operand 376 states and 1303 transitions. Second operand 9 states. [2020-02-10 19:49:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:40,120 INFO L93 Difference]: Finished difference Result 583 states and 1720 transitions. [2020-02-10 19:49:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:40,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:40,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:40,122 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:49:40,122 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:49:40,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 19:49:40,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:49:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 386. [2020-02-10 19:49:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:49:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-02-10 19:49:40,131 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-02-10 19:49:40,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:40,132 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-02-10 19:49:40,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-02-10 19:49:40,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:40,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:40,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 19:49:40,132 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 19:49:40,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:40,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1702799020, now seen corresponding path program 842 times [2020-02-10 19:49:40,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:40,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354928321] [2020-02-10 19:49:40,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:40,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 19:49:40,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354928321] [2020-02-10 19:49:40,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:40,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:40,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206483869] [2020-02-10 19:49:40,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:40,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:40,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:40,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:40,425 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:49:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:40,540 INFO L93 Difference]: Finished difference Result 578 states and 1707 transitions. [2020-02-10 19:49:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:40,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:40,542 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:49:40,542 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:49:40,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:49:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 382. [2020-02-10 19:49:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1325 transitions. [2020-02-10 19:49:40,551 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1325 transitions. Word has length 22 [2020-02-10 19:49:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:40,551 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1325 transitions. [2020-02-10 19:49:40,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1325 transitions. [2020-02-10 19:49:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:40,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:40,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 19:49:40,552 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 19:49:40,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:40,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1940514586, now seen corresponding path program 843 times [2020-02-10 19:49:40,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:40,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707387145] [2020-02-10 19:49:40,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:40,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 19:49:40,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707387145] [2020-02-10 19:49:40,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:40,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:40,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134185229] [2020-02-10 19:49:40,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:40,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:40,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:40,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:40,837 INFO L87 Difference]: Start difference. First operand 382 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:49:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:40,923 INFO L93 Difference]: Finished difference Result 579 states and 1708 transitions. [2020-02-10 19:49:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:40,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:40,925 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:49:40,925 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:49:40,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:49:40,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-02-10 19:49:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-02-10 19:49:40,934 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-02-10 19:49:40,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:40,934 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-02-10 19:49:40,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-02-10 19:49:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:40,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:40,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 19:49:40,935 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 19:49:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:40,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1379446094, now seen corresponding path program 844 times [2020-02-10 19:49:40,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:40,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719852755] [2020-02-10 19:49:40,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:41,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719852755] [2020-02-10 19:49:41,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:41,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:41,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065319186] [2020-02-10 19:49:41,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:41,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:41,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:41,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:41,217 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:49:41,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:41,308 INFO L93 Difference]: Finished difference Result 572 states and 1693 transitions. [2020-02-10 19:49:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:41,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:41,310 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:49:41,310 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:49:41,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 19:49:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:49:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 382. [2020-02-10 19:49:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:41,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1323 transitions. [2020-02-10 19:49:41,321 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1323 transitions. Word has length 22 [2020-02-10 19:49:41,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:41,321 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1323 transitions. [2020-02-10 19:49:41,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1323 transitions. [2020-02-10 19:49:41,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:41,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:41,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 19:49:41,322 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 19:49:41,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:41,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1160162504, now seen corresponding path program 845 times [2020-02-10 19:49:41,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:41,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66745301] [2020-02-10 19:49:41,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:41,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 19:49:41,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66745301] [2020-02-10 19:49:41,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:41,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:41,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169651906] [2020-02-10 19:49:41,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:41,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:41,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:41,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:41,632 INFO L87 Difference]: Start difference. First operand 382 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:49:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:41,745 INFO L93 Difference]: Finished difference Result 568 states and 1686 transitions. [2020-02-10 19:49:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:41,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:41,747 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:49:41,747 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:49: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 19:49:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:49:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 383. [2020-02-10 19:49:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-02-10 19:49:41,757 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-02-10 19:49:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:41,758 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-02-10 19:49:41,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-02-10 19:49:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:41,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:41,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 19:49:41,758 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 19:49:41,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:41,759 INFO L82 PathProgramCache]: Analyzing trace with hash -285354506, now seen corresponding path program 846 times [2020-02-10 19:49:41,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:41,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741678159] [2020-02-10 19:49:41,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:42,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 19:49:42,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741678159] [2020-02-10 19:49:42,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:42,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:42,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972640584] [2020-02-10 19:49:42,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:42,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:42,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:42,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:42,066 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:49:42,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:42,158 INFO L93 Difference]: Finished difference Result 566 states and 1681 transitions. [2020-02-10 19:49:42,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:42,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:42,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:42,160 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:49:42,160 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:49:42,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 19:49:42,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:49:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 380. [2020-02-10 19:49:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:49:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1319 transitions. [2020-02-10 19:49:42,169 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1319 transitions. Word has length 22 [2020-02-10 19:49:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:42,169 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1319 transitions. [2020-02-10 19:49:42,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1319 transitions. [2020-02-10 19:49:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:42,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:42,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 19:49:42,170 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 19:49:42,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:42,170 INFO L82 PathProgramCache]: Analyzing trace with hash 579416664, now seen corresponding path program 847 times [2020-02-10 19:49:42,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:42,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813899510] [2020-02-10 19:49:42,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:42,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 19:49:42,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813899510] [2020-02-10 19:49:42,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:42,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:42,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744305794] [2020-02-10 19:49:42,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:42,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:42,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:42,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:42,462 INFO L87 Difference]: Start difference. First operand 380 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:49:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:42,565 INFO L93 Difference]: Finished difference Result 587 states and 1730 transitions. [2020-02-10 19:49:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:42,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:42,567 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:49:42,567 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 19:49:42,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 19:49:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 19:49:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 387. [2020-02-10 19:49:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:49:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-02-10 19:49:42,576 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-02-10 19:49:42,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:42,576 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-02-10 19:49:42,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-02-10 19:49:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:42,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:42,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 19:49:42,577 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 19:49:42,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:42,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2125284746, now seen corresponding path program 848 times [2020-02-10 19:49:42,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:42,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639106356] [2020-02-10 19:49:42,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:42,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 19:49:42,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639106356] [2020-02-10 19:49:42,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:42,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:42,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170225908] [2020-02-10 19:49:42,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:42,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:42,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:42,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:42,863 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:49:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:42,978 INFO L93 Difference]: Finished difference Result 582 states and 1717 transitions. [2020-02-10 19:49:42,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:42,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:42,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:42,980 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:49:42,980 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:49:42,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 19:49:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:49:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 383. [2020-02-10 19:49:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1326 transitions. [2020-02-10 19:49:42,990 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1326 transitions. Word has length 22 [2020-02-10 19:49:42,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:42,990 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1326 transitions. [2020-02-10 19:49:42,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1326 transitions. [2020-02-10 19:49:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:42,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:42,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 19:49:42,991 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 19:49:42,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:42,991 INFO L82 PathProgramCache]: Analyzing trace with hash 680328836, now seen corresponding path program 849 times [2020-02-10 19:49:42,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:42,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136630663] [2020-02-10 19:49:42,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:43,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 19:49:43,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136630663] [2020-02-10 19:49:43,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:43,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:43,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732464910] [2020-02-10 19:49:43,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:43,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:43,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:43,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:43,294 INFO L87 Difference]: Start difference. First operand 383 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:49:43,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:43,380 INFO L93 Difference]: Finished difference Result 585 states and 1722 transitions. [2020-02-10 19:49:43,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:43,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:43,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:43,382 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:49:43,382 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 19:49:43,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 19:49:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 19:49:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 386. [2020-02-10 19:49:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:49:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1330 transitions. [2020-02-10 19:49:43,392 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1330 transitions. Word has length 22 [2020-02-10 19:49:43,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:43,392 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1330 transitions. [2020-02-10 19:49:43,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:43,392 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1330 transitions. [2020-02-10 19:49:43,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:43,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:43,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 19:49:43,393 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 19:49:43,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:43,393 INFO L82 PathProgramCache]: Analyzing trace with hash 806965210, now seen corresponding path program 850 times [2020-02-10 19:49:43,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:43,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845703620] [2020-02-10 19:49:43,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:43,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 19:49:43,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845703620] [2020-02-10 19:49:43,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:43,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:43,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221849565] [2020-02-10 19:49:43,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:43,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:43,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:43,689 INFO L87 Difference]: Start difference. First operand 386 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:49:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:43,806 INFO L93 Difference]: Finished difference Result 579 states and 1708 transitions. [2020-02-10 19:49:43,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:43,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:43,808 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:49:43,808 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:49:43,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 19:49:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:49:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 383. [2020-02-10 19:49:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1323 transitions. [2020-02-10 19:49:43,817 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1323 transitions. Word has length 22 [2020-02-10 19:49:43,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:43,817 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1323 transitions. [2020-02-10 19:49:43,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:43,818 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1323 transitions. [2020-02-10 19:49:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:43,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:43,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 19:49:43,818 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 19:49:43,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:43,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1608052958, now seen corresponding path program 851 times [2020-02-10 19:49:43,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:43,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153935459] [2020-02-10 19:49:43,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:44,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153935459] [2020-02-10 19:49:44,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:44,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:44,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957034533] [2020-02-10 19:49:44,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:44,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:44,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:44,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:44,115 INFO L87 Difference]: Start difference. First operand 383 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:49:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:44,236 INFO L93 Difference]: Finished difference Result 574 states and 1699 transitions. [2020-02-10 19:49:44,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:44,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:44,238 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:49:44,238 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:49:44,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 19:49:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:49:44,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-02-10 19:49:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:49:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1326 transitions. [2020-02-10 19:49:44,248 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1326 transitions. Word has length 22 [2020-02-10 19:49:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:44,249 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1326 transitions. [2020-02-10 19:49:44,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1326 transitions. [2020-02-10 19:49:44,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:44,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:44,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 19:49:44,249 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 19:49:44,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:44,250 INFO L82 PathProgramCache]: Analyzing trace with hash -266120170, now seen corresponding path program 852 times [2020-02-10 19:49:44,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:44,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683372490] [2020-02-10 19:49:44,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:44,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 19:49:44,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683372490] [2020-02-10 19:49:44,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:44,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:44,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682694275] [2020-02-10 19:49:44,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:44,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:44,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:44,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:44,550 INFO L87 Difference]: Start difference. First operand 385 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:49:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:44,664 INFO L93 Difference]: Finished difference Result 573 states and 1695 transitions. [2020-02-10 19:49:44,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:44,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:44,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:44,666 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:49:44,666 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:49:44,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:44,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:49:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-02-10 19:49:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:49:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1317 transitions. [2020-02-10 19:49:44,676 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1317 transitions. Word has length 22 [2020-02-10 19:49:44,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:44,676 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1317 transitions. [2020-02-10 19:49:44,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1317 transitions. [2020-02-10 19:49:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:44,677 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:44,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 19:49:44,677 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 19:49:44,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:44,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1959102490, now seen corresponding path program 853 times [2020-02-10 19:49:44,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:44,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043156942] [2020-02-10 19:49:44,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:44,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 19:49:44,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043156942] [2020-02-10 19:49:44,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:44,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:44,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841509010] [2020-02-10 19:49:44,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:44,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:44,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:44,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:44,981 INFO L87 Difference]: Start difference. First operand 380 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:49:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:45,065 INFO L93 Difference]: Finished difference Result 577 states and 1701 transitions. [2020-02-10 19:49:45,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:45,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:45,067 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:49:45,067 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:49:45,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 19:49:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:49:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 384. [2020-02-10 19:49:45,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1325 transitions. [2020-02-10 19:49:45,076 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1325 transitions. Word has length 22 [2020-02-10 19:49:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:45,077 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1325 transitions. [2020-02-10 19:49:45,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1325 transitions. [2020-02-10 19:49:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:45,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:45,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 19:49:45,077 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 19:49:45,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:45,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1398033998, now seen corresponding path program 854 times [2020-02-10 19:49:45,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:45,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482096578] [2020-02-10 19:49:45,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:45,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 19:49:45,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482096578] [2020-02-10 19:49:45,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:45,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:45,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440971957] [2020-02-10 19:49:45,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:45,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:45,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:45,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:45,383 INFO L87 Difference]: Start difference. First operand 384 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:49:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:45,471 INFO L93 Difference]: Finished difference Result 570 states and 1686 transitions. [2020-02-10 19:49:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:45,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:45,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:45,473 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:49:45,473 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:49:45,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 19:49:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:49:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 382. [2020-02-10 19:49:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-02-10 19:49:45,482 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-02-10 19:49:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:45,482 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-02-10 19:49:45,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-02-10 19:49:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:45,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:45,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 19:49:45,483 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 19:49:45,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:45,483 INFO L82 PathProgramCache]: Analyzing trace with hash 735426952, now seen corresponding path program 855 times [2020-02-10 19:49:45,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:45,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586102678] [2020-02-10 19:49:45,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:45,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 19:49:45,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586102678] [2020-02-10 19:49:45,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:45,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:45,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727829734] [2020-02-10 19:49:45,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:45,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:45,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:45,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:45,802 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:49:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:45,885 INFO L93 Difference]: Finished difference Result 579 states and 1704 transitions. [2020-02-10 19:49:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:45,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:45,887 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:49:45,887 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:49:45,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 19:49:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:49:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-02-10 19:49:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:49:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1325 transitions. [2020-02-10 19:49:45,898 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1325 transitions. Word has length 22 [2020-02-10 19:49:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:45,898 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1325 transitions. [2020-02-10 19:49:45,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1325 transitions. [2020-02-10 19:49:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:45,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:45,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 19:49:45,899 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 19:49:45,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:45,899 INFO L82 PathProgramCache]: Analyzing trace with hash -226776710, now seen corresponding path program 856 times [2020-02-10 19:49:45,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:45,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248978605] [2020-02-10 19:49:45,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:46,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 19:49:46,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248978605] [2020-02-10 19:49:46,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:46,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:46,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619748144] [2020-02-10 19:49:46,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:46,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:46,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:46,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:46,220 INFO L87 Difference]: Start difference. First operand 385 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:49:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:46,331 INFO L93 Difference]: Finished difference Result 573 states and 1690 transitions. [2020-02-10 19:49:46,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:46,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:46,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:46,333 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:49:46,333 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:49:46,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:49:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-02-10 19:49:46,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1319 transitions. [2020-02-10 19:49:46,342 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1319 transitions. Word has length 22 [2020-02-10 19:49:46,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:46,342 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1319 transitions. [2020-02-10 19:49:46,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1319 transitions. [2020-02-10 19:49:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:46,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:46,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 19:49:46,343 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 19:49:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash 790149178, now seen corresponding path program 857 times [2020-02-10 19:49:46,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:46,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796501971] [2020-02-10 19:49:46,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:46,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 19:49:46,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796501971] [2020-02-10 19:49:46,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:46,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:46,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275132482] [2020-02-10 19:49:46,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:46,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:46,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:46,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:46,658 INFO L87 Difference]: Start difference. First operand 382 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:49:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:46,746 INFO L93 Difference]: Finished difference Result 563 states and 1671 transitions. [2020-02-10 19:49:46,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:46,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:46,748 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:49:46,748 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:49:46,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 19:49:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:49:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 383. [2020-02-10 19:49:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-02-10 19:49:46,758 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-02-10 19:49:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:46,758 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-02-10 19:49:46,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:46,758 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-02-10 19:49:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:46,759 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:46,759 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:46,759 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 19:49:46,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:46,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1893877160, now seen corresponding path program 858 times [2020-02-10 19:49:46,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:46,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358110421] [2020-02-10 19:49:46,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:47,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 19:49:47,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358110421] [2020-02-10 19:49:47,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:47,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:47,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752559185] [2020-02-10 19:49:47,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:47,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:47,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:47,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:47,092 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:49:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:47,222 INFO L93 Difference]: Finished difference Result 564 states and 1672 transitions. [2020-02-10 19:49:47,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:47,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:47,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:47,224 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:49:47,224 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:49:47,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 19:49:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:49:47,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 380. [2020-02-10 19:49:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:49:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1315 transitions. [2020-02-10 19:49:47,234 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1315 transitions. Word has length 22 [2020-02-10 19:49:47,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:47,234 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1315 transitions. [2020-02-10 19:49:47,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:47,234 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1315 transitions. [2020-02-10 19:49:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:47,235 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:47,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 19:49:47,235 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 19:49:47,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:47,235 INFO L82 PathProgramCache]: Analyzing trace with hash 698675460, now seen corresponding path program 859 times [2020-02-10 19:49:47,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:47,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309939504] [2020-02-10 19:49:47,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:47,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 19:49:47,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309939504] [2020-02-10 19:49:47,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:47,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:47,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394816828] [2020-02-10 19:49:47,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:47,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:47,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:47,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:47,542 INFO L87 Difference]: Start difference. First operand 380 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:49:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:47,672 INFO L93 Difference]: Finished difference Result 558 states and 1663 transitions. [2020-02-10 19:49:47,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:47,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:47,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:47,674 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:49:47,674 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:49:47,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:49:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 382. [2020-02-10 19:49:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1319 transitions. [2020-02-10 19:49:47,684 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1319 transitions. Word has length 22 [2020-02-10 19:49:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:47,684 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1319 transitions. [2020-02-10 19:49:47,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1319 transitions. [2020-02-10 19:49:47,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:47,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:47,685 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:47,685 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 19:49:47,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:47,685 INFO L82 PathProgramCache]: Analyzing trace with hash -746841550, now seen corresponding path program 860 times [2020-02-10 19:49:47,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:47,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750912210] [2020-02-10 19:49:47,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:48,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 19:49:48,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750912210] [2020-02-10 19:49:48,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:48,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:48,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691519165] [2020-02-10 19:49:48,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:48,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:48,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:48,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:48,005 INFO L87 Difference]: Start difference. First operand 382 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:49:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:48,093 INFO L93 Difference]: Finished difference Result 556 states and 1658 transitions. [2020-02-10 19:49:48,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:48,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:48,094 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:49:48,095 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:49:48,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 19:49:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:49:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 381. [2020-02-10 19:49:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:49:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1317 transitions. [2020-02-10 19:49:48,104 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1317 transitions. Word has length 22 [2020-02-10 19:49:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:48,104 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1317 transitions. [2020-02-10 19:49:48,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1317 transitions. [2020-02-10 19:49:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:48,104 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:48,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 19:49:48,105 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 19:49:48,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:48,105 INFO L82 PathProgramCache]: Analyzing trace with hash -901762394, now seen corresponding path program 861 times [2020-02-10 19:49:48,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:48,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672367376] [2020-02-10 19:49:48,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:48,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 19:49:48,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672367376] [2020-02-10 19:49:48,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:48,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:48,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820983468] [2020-02-10 19:49:48,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:48,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:48,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:48,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:48,416 INFO L87 Difference]: Start difference. First operand 381 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:49:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:48,528 INFO L93 Difference]: Finished difference Result 560 states and 1667 transitions. [2020-02-10 19:49:48,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:48,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:48,530 INFO L225 Difference]: With dead ends: 560 [2020-02-10 19:49:48,530 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 19:49:48,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 19:49:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 19:49:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 383. [2020-02-10 19:49:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-02-10 19:49:48,540 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-02-10 19:49:48,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:48,541 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-02-10 19:49:48,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-02-10 19:49:48,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:48,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:48,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:48,541 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 19:49:48,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:48,542 INFO L82 PathProgramCache]: Analyzing trace with hash -648669642, now seen corresponding path program 862 times [2020-02-10 19:49:48,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:48,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513696074] [2020-02-10 19:49:48,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:48,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 19:49:48,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513696074] [2020-02-10 19:49:48,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:48,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:48,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893917884] [2020-02-10 19:49:48,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:48,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:48,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:48,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:48,855 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:49:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:48,972 INFO L93 Difference]: Finished difference Result 559 states and 1663 transitions. [2020-02-10 19:49:48,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:48,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:48,973 INFO L225 Difference]: With dead ends: 559 [2020-02-10 19:49:48,974 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:49:48,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 19:49:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:49:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 381. [2020-02-10 19:49:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:49:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1316 transitions. [2020-02-10 19:49:48,984 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1316 transitions. Word has length 22 [2020-02-10 19:49:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:48,984 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1316 transitions. [2020-02-10 19:49:48,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1316 transitions. [2020-02-10 19:49:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:48,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:48,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 19:49:48,985 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 19:49:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:48,985 INFO L82 PathProgramCache]: Analyzing trace with hash 347250038, now seen corresponding path program 863 times [2020-02-10 19:49:48,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:48,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085538583] [2020-02-10 19:49:48,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:49,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 19:49:49,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085538583] [2020-02-10 19:49:49,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:49,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:49,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702813325] [2020-02-10 19:49:49,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:49,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:49,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:49,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:49,304 INFO L87 Difference]: Start difference. First operand 381 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:49:49,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:49,400 INFO L93 Difference]: Finished difference Result 555 states and 1655 transitions. [2020-02-10 19:49:49,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:49,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:49,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:49,401 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:49:49,402 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:49:49,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:49:49,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 382. [2020-02-10 19:49:49,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-02-10 19:49:49,412 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-02-10 19:49:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:49,412 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-02-10 19:49:49,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-02-10 19:49:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:49,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:49,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 19:49:49,413 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 19:49:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:49,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1958190996, now seen corresponding path program 864 times [2020-02-10 19:49:49,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:49,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793369549] [2020-02-10 19:49:49,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:49,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 19:49:49,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793369549] [2020-02-10 19:49:49,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:49,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:49,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104977304] [2020-02-10 19:49:49,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:49,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:49,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:49,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:49,734 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:49:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:49,848 INFO L93 Difference]: Finished difference Result 556 states and 1656 transitions. [2020-02-10 19:49:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:49,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:49,850 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:49:49,850 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 19:49:49,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 19:49:49,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 19:49:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 378. [2020-02-10 19:49:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:49:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1311 transitions. [2020-02-10 19:49:49,860 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1311 transitions. Word has length 22 [2020-02-10 19:49:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:49,860 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1311 transitions. [2020-02-10 19:49:49,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1311 transitions. [2020-02-10 19:49:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:49,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:49,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 19:49:49,861 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 19:49:49,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:49,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2020131198, now seen corresponding path program 865 times [2020-02-10 19:49:49,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:49,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934165093] [2020-02-10 19:49:49,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:50,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 19:49:50,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934165093] [2020-02-10 19:49:50,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:50,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:50,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156221142] [2020-02-10 19:49:50,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:50,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:50,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:50,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:50,156 INFO L87 Difference]: Start difference. First operand 378 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:49:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:50,254 INFO L93 Difference]: Finished difference Result 587 states and 1729 transitions. [2020-02-10 19:49:50,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:50,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:50,256 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:49:50,256 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 19:49:50,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 19:49:50,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 386. [2020-02-10 19:49:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:49:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1331 transitions. [2020-02-10 19:49:50,267 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1331 transitions. Word has length 22 [2020-02-10 19:49:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:50,267 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1331 transitions. [2020-02-10 19:49:50,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1331 transitions. [2020-02-10 19:49:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:50,267 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:50,267 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:50,268 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 19:49:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:50,268 INFO L82 PathProgramCache]: Analyzing trace with hash -429865312, now seen corresponding path program 866 times [2020-02-10 19:49:50,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:50,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408281153] [2020-02-10 19:49:50,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:50,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 19:49:50,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408281153] [2020-02-10 19:49:50,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:50,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:50,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220769533] [2020-02-10 19:49:50,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:50,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:50,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:50,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:50,555 INFO L87 Difference]: Start difference. First operand 386 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:49:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:50,667 INFO L93 Difference]: Finished difference Result 582 states and 1716 transitions. [2020-02-10 19:49:50,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:50,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:50,669 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:49:50,670 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:49:50,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:49:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 382. [2020-02-10 19:49:50,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1323 transitions. [2020-02-10 19:49:50,679 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1323 transitions. Word has length 22 [2020-02-10 19:49:50,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:50,679 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1323 transitions. [2020-02-10 19:49:50,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:50,679 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1323 transitions. [2020-02-10 19:49:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:50,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:50,680 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:50,680 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 19:49:50,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:50,680 INFO L82 PathProgramCache]: Analyzing trace with hash -667580878, now seen corresponding path program 867 times [2020-02-10 19:49:50,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:50,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591172993] [2020-02-10 19:49:50,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:50,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591172993] [2020-02-10 19:49:50,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:50,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:50,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941037378] [2020-02-10 19:49:50,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:50,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:50,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:50,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:50,979 INFO L87 Difference]: Start difference. First operand 382 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:49:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:51,079 INFO L93 Difference]: Finished difference Result 583 states and 1717 transitions. [2020-02-10 19:49:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:51,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:51,081 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:49:51,081 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:49:51,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 19:49:51,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:49:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 384. [2020-02-10 19:49:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1325 transitions. [2020-02-10 19:49:51,090 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1325 transitions. Word has length 22 [2020-02-10 19:49:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:51,090 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1325 transitions. [2020-02-10 19:49:51,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1325 transitions. [2020-02-10 19:49:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:51,090 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:51,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 19:49:51,090 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 19:49:51,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:51,091 INFO L82 PathProgramCache]: Analyzing trace with hash -106512386, now seen corresponding path program 868 times [2020-02-10 19:49:51,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:51,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003682584] [2020-02-10 19:49:51,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:51,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 19:49:51,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003682584] [2020-02-10 19:49:51,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:51,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:51,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403642330] [2020-02-10 19:49:51,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:51,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:51,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:51,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:51,378 INFO L87 Difference]: Start difference. First operand 384 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:49:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:51,467 INFO L93 Difference]: Finished difference Result 576 states and 1702 transitions. [2020-02-10 19:49:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:51,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:51,468 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:49:51,469 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:49:51,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:49:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 382. [2020-02-10 19:49:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-02-10 19:49:51,478 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-02-10 19:49:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:51,478 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-02-10 19:49:51,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-02-10 19:49:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:51,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:51,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 19:49:51,479 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 19:49:51,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:51,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1861871084, now seen corresponding path program 869 times [2020-02-10 19:49:51,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:51,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738137251] [2020-02-10 19:49:51,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:51,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 19:49:51,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738137251] [2020-02-10 19:49:51,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:51,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:51,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647124391] [2020-02-10 19:49:51,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:51,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:51,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:51,774 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:49:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:51,906 INFO L93 Difference]: Finished difference Result 572 states and 1695 transitions. [2020-02-10 19:49:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:51,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:51,908 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:49:51,908 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:49:51,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 19:49:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:49:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 383. [2020-02-10 19:49:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1322 transitions. [2020-02-10 19:49:51,919 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1322 transitions. Word has length 22 [2020-02-10 19:49:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:51,919 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1322 transitions. [2020-02-10 19:49:51,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1322 transitions. [2020-02-10 19:49:51,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:51,920 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:51,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:51,920 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 19:49:51,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:51,920 INFO L82 PathProgramCache]: Analyzing trace with hash 987579202, now seen corresponding path program 870 times [2020-02-10 19:49:51,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:51,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366836844] [2020-02-10 19:49:51,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:52,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 19:49:52,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366836844] [2020-02-10 19:49:52,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:52,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:52,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721429667] [2020-02-10 19:49:52,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:52,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:52,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:52,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:52,214 INFO L87 Difference]: Start difference. First operand 383 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:49:52,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:52,300 INFO L93 Difference]: Finished difference Result 570 states and 1690 transitions. [2020-02-10 19:49:52,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:52,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:52,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:52,302 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:49:52,302 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:49:52,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 19:49:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:49:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-02-10 19:49:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:49:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1317 transitions. [2020-02-10 19:49:52,311 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1317 transitions. Word has length 22 [2020-02-10 19:49:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:52,311 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1317 transitions. [2020-02-10 19:49:52,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1317 transitions. [2020-02-10 19:49:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:52,312 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:52,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 19:49:52,312 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 19:49:52,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:52,312 INFO L82 PathProgramCache]: Analyzing trace with hash 92297432, now seen corresponding path program 871 times [2020-02-10 19:49:52,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:52,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398663364] [2020-02-10 19:49:52,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:52,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 19:49:52,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398663364] [2020-02-10 19:49:52,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:52,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:52,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693058361] [2020-02-10 19:49:52,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:52,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:52,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:52,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:52,644 INFO L87 Difference]: Start difference. First operand 380 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:49:52,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:52,748 INFO L93 Difference]: Finished difference Result 593 states and 1746 transitions. [2020-02-10 19:49:52,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:52,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:52,750 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:49:52,750 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:49:52,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 19:49:52,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:49:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 388. [2020-02-10 19:49:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:49:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1337 transitions. [2020-02-10 19:49:52,760 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1337 transitions. Word has length 22 [2020-02-10 19:49:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:52,760 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1337 transitions. [2020-02-10 19:49:52,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1337 transitions. [2020-02-10 19:49:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:52,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:52,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 19:49:52,761 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 19:49:52,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:52,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1682563318, now seen corresponding path program 872 times [2020-02-10 19:49:52,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:52,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710803076] [2020-02-10 19:49:52,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:53,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 19:49:53,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710803076] [2020-02-10 19:49:53,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:53,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:53,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685235892] [2020-02-10 19:49:53,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:53,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:53,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:53,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:53,061 INFO L87 Difference]: Start difference. First operand 388 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:49:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:53,178 INFO L93 Difference]: Finished difference Result 588 states and 1733 transitions. [2020-02-10 19:49:53,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:53,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:53,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:53,180 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:49:53,180 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 19:49:53,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 19:49:53,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 19:49:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 384. [2020-02-10 19:49:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-02-10 19:49:53,190 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-02-10 19:49:53,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:53,190 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-02-10 19:49:53,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-02-10 19:49:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:53,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:53,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:53,191 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 19:49:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:53,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1256379320, now seen corresponding path program 873 times [2020-02-10 19:49:53,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:53,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947073258] [2020-02-10 19:49:53,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:53,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 19:49:53,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947073258] [2020-02-10 19:49:53,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:53,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:53,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890048335] [2020-02-10 19:49:53,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:53,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:53,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:53,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:53,495 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:49:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:53,593 INFO L93 Difference]: Finished difference Result 587 states and 1733 transitions. [2020-02-10 19:49:53,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:53,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:53,595 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:49:53,595 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 19:49:53,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:53,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 19:49:53,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 389. [2020-02-10 19:49:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:49:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1335 transitions. [2020-02-10 19:49:53,605 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1335 transitions. Word has length 22 [2020-02-10 19:49:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:53,605 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1335 transitions. [2020-02-10 19:49:53,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1335 transitions. [2020-02-10 19:49:53,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:53,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:53,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 19:49:53,606 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 19:49:53,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:53,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1337260074, now seen corresponding path program 874 times [2020-02-10 19:49:53,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:53,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206980620] [2020-02-10 19:49:53,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:53,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 19:49:53,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206980620] [2020-02-10 19:49:53,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:53,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:53,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261356440] [2020-02-10 19:49:53,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:53,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:53,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:53,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:53,910 INFO L87 Difference]: Start difference. First operand 389 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:49:54,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:54,028 INFO L93 Difference]: Finished difference Result 574 states and 1713 transitions. [2020-02-10 19:49:54,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:54,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:54,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:54,030 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:49:54,030 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:49:54,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 19:49:54,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:49:54,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 384. [2020-02-10 19:49:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-02-10 19:49:54,040 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-02-10 19:49:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:54,041 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-02-10 19:49:54,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-02-10 19:49:54,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:54,041 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:54,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 19:49:54,041 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 19:49:54,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:54,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1823291562, now seen corresponding path program 875 times [2020-02-10 19:49:54,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:54,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276783053] [2020-02-10 19:49:54,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:54,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 19:49:54,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276783053] [2020-02-10 19:49:54,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:54,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:54,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470341617] [2020-02-10 19:49:54,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:54,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:54,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:54,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:54,353 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:49:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:54,470 INFO L93 Difference]: Finished difference Result 580 states and 1715 transitions. [2020-02-10 19:49:54,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:54,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:54,471 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:49:54,472 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 19:49:54,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 19:49:54,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 19:49:54,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 387. [2020-02-10 19:49:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:49:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-02-10 19:49:54,481 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-02-10 19:49:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:54,481 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-02-10 19:49:54,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-02-10 19:49:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:54,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:54,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 19:49:54,482 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 19:49:54,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:54,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1597935054, now seen corresponding path program 876 times [2020-02-10 19:49:54,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:54,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138516673] [2020-02-10 19:49:54,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:54,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 19:49:54,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138516673] [2020-02-10 19:49:54,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:54,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:54,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322440361] [2020-02-10 19:49:54,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:54,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:54,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:54,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:54,786 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:49:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:54,905 INFO L93 Difference]: Finished difference Result 572 states and 1706 transitions. [2020-02-10 19:49:54,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:54,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:54,907 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:49:54,907 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:49:54,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 19:49:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:49:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 380. [2020-02-10 19:49:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:49:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1315 transitions. [2020-02-10 19:49:54,917 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1315 transitions. Word has length 22 [2020-02-10 19:49:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:54,917 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1315 transitions. [2020-02-10 19:49:54,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1315 transitions. [2020-02-10 19:49:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:54,918 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:54,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 19:49:54,918 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 19:49:54,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:54,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1117524302, now seen corresponding path program 877 times [2020-02-10 19:49:54,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:54,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464445463] [2020-02-10 19:49:54,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:55,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 19:49:55,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464445463] [2020-02-10 19:49:55,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:55,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:55,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420887028] [2020-02-10 19:49:55,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:55,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:55,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:55,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:55,208 INFO L87 Difference]: Start difference. First operand 380 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:49:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:55,296 INFO L93 Difference]: Finished difference Result 583 states and 1716 transitions. [2020-02-10 19:49:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:55,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:55,298 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:49:55,298 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:49:55,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:55,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:49:55,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 384. [2020-02-10 19:49:55,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:55,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-02-10 19:49:55,307 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-02-10 19:49:55,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:55,307 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-02-10 19:49:55,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-02-10 19:49:55,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:55,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:55,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 19:49:55,308 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 19:49:55,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:55,308 INFO L82 PathProgramCache]: Analyzing trace with hash -556455810, now seen corresponding path program 878 times [2020-02-10 19:49:55,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:55,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551777480] [2020-02-10 19:49:55,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:55,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551777480] [2020-02-10 19:49:55,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:55,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:55,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2470777] [2020-02-10 19:49:55,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:55,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:55,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:55,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:55,602 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:49:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:55,695 INFO L93 Difference]: Finished difference Result 576 states and 1701 transitions. [2020-02-10 19:49:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:55,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:55,697 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:49:55,697 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:49:55,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 19:49:55,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:49:55,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 382. [2020-02-10 19:49:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1319 transitions. [2020-02-10 19:49:55,707 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1319 transitions. Word has length 22 [2020-02-10 19:49:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:55,707 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1319 transitions. [2020-02-10 19:49:55,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1319 transitions. [2020-02-10 19:49:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:55,708 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:55,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 19:49:55,708 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 19:49:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:55,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1705269624, now seen corresponding path program 879 times [2020-02-10 19:49:55,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:55,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609550949] [2020-02-10 19:49:55,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:56,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 19:49:56,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609550949] [2020-02-10 19:49:56,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:56,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:56,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508553766] [2020-02-10 19:49:56,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:56,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:56,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:56,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:56,008 INFO L87 Difference]: Start difference. First operand 382 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:49:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:56,129 INFO L93 Difference]: Finished difference Result 581 states and 1715 transitions. [2020-02-10 19:49:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:56,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:56,130 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:49:56,131 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:49:56,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:56,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:49:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 387. [2020-02-10 19:49:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:49:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1327 transitions. [2020-02-10 19:49:56,140 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1327 transitions. Word has length 22 [2020-02-10 19:49:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:56,141 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1327 transitions. [2020-02-10 19:49:56,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1327 transitions. [2020-02-10 19:49:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:56,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:56,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 19:49:56,141 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 19:49:56,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:56,142 INFO L82 PathProgramCache]: Analyzing trace with hash 316647034, now seen corresponding path program 880 times [2020-02-10 19:49:56,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:56,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516203283] [2020-02-10 19:49:56,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49: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 19:49:56,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516203283] [2020-02-10 19:49:56,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:56,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:56,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555375167] [2020-02-10 19:49:56,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:56,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:56,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:56,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:56,442 INFO L87 Difference]: Start difference. First operand 387 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:49:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:56,559 INFO L93 Difference]: Finished difference Result 568 states and 1695 transitions. [2020-02-10 19:49:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:56,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:56,561 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:49:56,561 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:49:56,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 19:49:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:49:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 382. [2020-02-10 19:49:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-02-10 19:49:56,571 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-02-10 19:49:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:56,571 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-02-10 19:49:56,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-02-10 19:49:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:56,572 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:56,572 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:56,572 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 19:49:56,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:56,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1650547398, now seen corresponding path program 881 times [2020-02-10 19:49:56,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:56,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40670555] [2020-02-10 19:49:56,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:56,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40670555] [2020-02-10 19:49:56,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:56,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:56,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17804663] [2020-02-10 19:49:56,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:56,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:56,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:56,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:56,875 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:49:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:56,971 INFO L93 Difference]: Finished difference Result 570 states and 1689 transitions. [2020-02-10 19:49:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:56,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:56,973 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:49:56,973 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:49:56,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:56,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:49:56,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 383. [2020-02-10 19:49:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:49:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 19:49:56,983 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 19:49:56,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:56,984 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 19:49:56,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 19:49:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:56,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:56,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 19:49:56,984 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 19:49:56,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:56,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1115317596, now seen corresponding path program 882 times [2020-02-10 19:49:56,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:56,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925171554] [2020-02-10 19:49:56,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:57,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 19:49:57,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925171554] [2020-02-10 19:49:57,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:57,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:57,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355971735] [2020-02-10 19:49:57,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:57,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:57,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:57,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:57,275 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:49:57,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:57,398 INFO L93 Difference]: Finished difference Result 564 states and 1686 transitions. [2020-02-10 19:49:57,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:57,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:57,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:57,400 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:49:57,400 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 19:49:57,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 19:49:57,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 19:49:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 380. [2020-02-10 19:49:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:49:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1313 transitions. [2020-02-10 19:49:57,410 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1313 transitions. Word has length 22 [2020-02-10 19:49:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:57,410 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1313 transitions. [2020-02-10 19:49:57,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1313 transitions. [2020-02-10 19:49:57,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:57,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:57,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:57,411 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 19:49:57,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:57,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1540253648, now seen corresponding path program 883 times [2020-02-10 19:49:57,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:57,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878119084] [2020-02-10 19:49:57,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:57,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 19:49:57,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878119084] [2020-02-10 19:49:57,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:57,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:57,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742569625] [2020-02-10 19:49:57,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:57,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:57,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:57,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:57,709 INFO L87 Difference]: Start difference. First operand 380 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:49:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:57,856 INFO L93 Difference]: Finished difference Result 564 states and 1677 transitions. [2020-02-10 19:49:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:57,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:57,858 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:49:57,858 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:49:57,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 19:49:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:49:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 382. [2020-02-10 19:49:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-02-10 19:49:57,868 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-02-10 19:49:57,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:57,868 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-02-10 19:49:57,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-02-10 19:49:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:57,869 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:57,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 19:49:57,869 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 19:49:57,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:57,869 INFO L82 PathProgramCache]: Analyzing trace with hash 94736638, now seen corresponding path program 884 times [2020-02-10 19:49:57,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:57,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302535008] [2020-02-10 19:49:57,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:58,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 19:49:58,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302535008] [2020-02-10 19:49:58,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:58,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:58,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372253934] [2020-02-10 19:49:58,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:58,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:58,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:58,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:58,186 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:49:58,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:58,282 INFO L93 Difference]: Finished difference Result 562 states and 1672 transitions. [2020-02-10 19:49:58,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:58,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:58,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:58,284 INFO L225 Difference]: With dead ends: 562 [2020-02-10 19:49:58,284 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:49:58,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:49:58,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 381. [2020-02-10 19:49:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:49:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1315 transitions. [2020-02-10 19:49:58,293 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1315 transitions. Word has length 22 [2020-02-10 19:49:58,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:58,293 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1315 transitions. [2020-02-10 19:49:58,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:58,293 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1315 transitions. [2020-02-10 19:49:58,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:58,294 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:58,294 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:58,294 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 19:49:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:58,294 INFO L82 PathProgramCache]: Analyzing trace with hash 952508326, now seen corresponding path program 885 times [2020-02-10 19:49:58,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:58,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078389095] [2020-02-10 19:49:58,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:58,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 19:49:58,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078389095] [2020-02-10 19:49:58,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:58,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:58,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295036369] [2020-02-10 19:49:58,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:58,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:58,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:58,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:58,597 INFO L87 Difference]: Start difference. First operand 381 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:49:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:58,724 INFO L93 Difference]: Finished difference Result 566 states and 1683 transitions. [2020-02-10 19:49:58,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:58,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:58,725 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:49:58,725 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 19:49:58,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 19:49:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 19:49:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 384. [2020-02-10 19:49:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:49:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1320 transitions. [2020-02-10 19:49:58,735 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1320 transitions. Word has length 22 [2020-02-10 19:49:58,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:58,735 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1320 transitions. [2020-02-10 19:49:58,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:58,735 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1320 transitions. [2020-02-10 19:49:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:58,736 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:58,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 19:49:58,736 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 19:49:58,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:58,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1254526270, now seen corresponding path program 886 times [2020-02-10 19:49:58,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:58,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512362799] [2020-02-10 19:49:58,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:59,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 19:49:59,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512362799] [2020-02-10 19:49:59,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:59,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:59,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948546286] [2020-02-10 19:49:59,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:59,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:59,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:59,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:59,042 INFO L87 Difference]: Start difference. First operand 384 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:49:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:59,163 INFO L93 Difference]: Finished difference Result 558 states and 1674 transitions. [2020-02-10 19:49:59,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:59,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:59,165 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:49:59,165 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 19:49:59,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 19:49:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 19:49:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 381. [2020-02-10 19:49:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:49:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1314 transitions. [2020-02-10 19:49:59,175 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1314 transitions. Word has length 22 [2020-02-10 19:49:59,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:59,175 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1314 transitions. [2020-02-10 19:49:59,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1314 transitions. [2020-02-10 19:49:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:59,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:59,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 19:49:59,176 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 19:49:59,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:59,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2093446538, now seen corresponding path program 887 times [2020-02-10 19:49:59,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:59,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298748131] [2020-02-10 19:49:59,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:59,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 19:49:59,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298748131] [2020-02-10 19:49:59,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:59,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:59,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213662441] [2020-02-10 19:49:59,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:59,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:59,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:59,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:59,484 INFO L87 Difference]: Start difference. First operand 381 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:49:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:59,577 INFO L93 Difference]: Finished difference Result 562 states and 1672 transitions. [2020-02-10 19:49:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:49:59,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:49:59,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:59,579 INFO L225 Difference]: With dead ends: 562 [2020-02-10 19:49:59,579 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:49:59,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:59,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:49:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 382. [2020-02-10 19:49:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:49:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-02-10 19:49:59,588 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-02-10 19:49:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:59,588 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-02-10 19:49:59,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:49:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-02-10 19:49:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:49:59,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:59,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 19:49:59,589 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 19:49:59,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:59,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1558216736, now seen corresponding path program 888 times [2020-02-10 19:49:59,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:59,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054784502] [2020-02-10 19:49:59,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:59,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 19:49:59,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054784502] [2020-02-10 19:49:59,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:59,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:49:59,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778610440] [2020-02-10 19:49:59,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:49:59,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:59,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:49:59,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:49:59,885 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:50:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:00,033 INFO L93 Difference]: Finished difference Result 556 states and 1669 transitions. [2020-02-10 19:50:00,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:00,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:00,035 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:50:00,035 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 19:50:00,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 19:50:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 19:50:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 378. [2020-02-10 19:50:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:50:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1309 transitions. [2020-02-10 19:50:00,045 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1309 transitions. Word has length 22 [2020-02-10 19:50:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:00,045 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1309 transitions. [2020-02-10 19:50:00,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1309 transitions. [2020-02-10 19:50:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:00,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:00,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 19:50:00,046 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 19:50:00,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:00,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1640194754, now seen corresponding path program 889 times [2020-02-10 19:50:00,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:00,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064756268] [2020-02-10 19:50:00,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:00,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 19:50:00,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064756268] [2020-02-10 19:50:00,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:00,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:00,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725077510] [2020-02-10 19:50:00,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:00,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:00,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:00,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:00,365 INFO L87 Difference]: Start difference. First operand 378 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:50:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:00,459 INFO L93 Difference]: Finished difference Result 598 states and 1763 transitions. [2020-02-10 19:50:00,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:00,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:00,461 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:50:00,461 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:50:00,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:50:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 388. [2020-02-10 19:50:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:50:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-02-10 19:50:00,471 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-02-10 19:50:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:00,471 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-02-10 19:50:00,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-02-10 19:50:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:00,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:00,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 19:50:00,472 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 19:50:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:00,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1064506656, now seen corresponding path program 890 times [2020-02-10 19:50:00,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:00,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58702317] [2020-02-10 19:50:00,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:00,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58702317] [2020-02-10 19:50:00,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:00,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:00,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501643459] [2020-02-10 19:50:00,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:00,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:00,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:00,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:00,776 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:50:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:00,903 INFO L93 Difference]: Finished difference Result 593 states and 1750 transitions. [2020-02-10 19:50:00,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:00,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:00,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:00,906 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:50:00,906 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:50:00,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 19:50:00,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:50:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 384. [2020-02-10 19:50:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1329 transitions. [2020-02-10 19:50:00,916 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1329 transitions. Word has length 22 [2020-02-10 19:50:00,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:00,916 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1329 transitions. [2020-02-10 19:50:00,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1329 transitions. [2020-02-10 19:50:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:00,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:00,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 19:50:00,917 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 19:50:00,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:00,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1741106926, now seen corresponding path program 891 times [2020-02-10 19:50:00,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:00,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802937233] [2020-02-10 19:50:00,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:01,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 19:50:01,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802937233] [2020-02-10 19:50:01,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:01,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:01,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635805305] [2020-02-10 19:50:01,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:01,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:01,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:01,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:01,234 INFO L87 Difference]: Start difference. First operand 384 states and 1329 transitions. Second operand 9 states. [2020-02-10 19:50:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:01,352 INFO L93 Difference]: Finished difference Result 596 states and 1755 transitions. [2020-02-10 19:50:01,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:01,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:01,354 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:50:01,354 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:50:01,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 19:50:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:50:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 387. [2020-02-10 19:50:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:50:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1333 transitions. [2020-02-10 19:50:01,363 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1333 transitions. Word has length 22 [2020-02-10 19:50:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:01,363 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1333 transitions. [2020-02-10 19:50:01,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1333 transitions. [2020-02-10 19:50:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:01,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:01,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 19:50:01,364 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 19:50:01,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:01,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1867743300, now seen corresponding path program 892 times [2020-02-10 19:50:01,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:01,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012277234] [2020-02-10 19:50:01,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:01,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 19:50:01,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012277234] [2020-02-10 19:50:01,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:01,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:01,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095230121] [2020-02-10 19:50:01,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:01,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:01,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:01,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:01,665 INFO L87 Difference]: Start difference. First operand 387 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:50:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:01,785 INFO L93 Difference]: Finished difference Result 590 states and 1741 transitions. [2020-02-10 19:50:01,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:01,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:01,787 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:50:01,787 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:50:01,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 19:50:01,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:50:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 384. [2020-02-10 19:50:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1326 transitions. [2020-02-10 19:50:01,803 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1326 transitions. Word has length 22 [2020-02-10 19:50:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:01,803 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1326 transitions. [2020-02-10 19:50:01,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1326 transitions. [2020-02-10 19:50:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:01,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:01,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 19:50:01,804 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 19:50:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:01,805 INFO L82 PathProgramCache]: Analyzing trace with hash -547274868, now seen corresponding path program 893 times [2020-02-10 19:50:01,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:01,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919403029] [2020-02-10 19:50:01,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50: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 19:50:02,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919403029] [2020-02-10 19:50:02,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:02,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:02,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789547848] [2020-02-10 19:50:02,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:02,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:02,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:02,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:02,104 INFO L87 Difference]: Start difference. First operand 384 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:50:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:02,223 INFO L93 Difference]: Finished difference Result 585 states and 1732 transitions. [2020-02-10 19:50:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:02,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:02,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:02,224 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:50:02,225 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:50:02,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 19:50:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:50:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 386. [2020-02-10 19:50:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:50:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1329 transitions. [2020-02-10 19:50:02,235 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1329 transitions. Word has length 22 [2020-02-10 19:50:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:02,235 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1329 transitions. [2020-02-10 19:50:02,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1329 transitions. [2020-02-10 19:50:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:02,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:02,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 19:50:02,236 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 19:50:02,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:02,236 INFO L82 PathProgramCache]: Analyzing trace with hash 794657920, now seen corresponding path program 894 times [2020-02-10 19:50:02,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:02,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646223231] [2020-02-10 19:50:02,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:02,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646223231] [2020-02-10 19:50:02,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:02,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:02,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792142218] [2020-02-10 19:50:02,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:02,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:02,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:02,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:02,536 INFO L87 Difference]: Start difference. First operand 386 states and 1329 transitions. Second operand 9 states. [2020-02-10 19:50:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:02,657 INFO L93 Difference]: Finished difference Result 584 states and 1728 transitions. [2020-02-10 19:50:02,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:02,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:02,659 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:50:02,659 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 19:50: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 19:50:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 19:50:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 381. [2020-02-10 19:50:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1319 transitions. [2020-02-10 19:50:02,669 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1319 transitions. Word has length 22 [2020-02-10 19:50:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:02,669 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1319 transitions. [2020-02-10 19:50:02,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1319 transitions. [2020-02-10 19:50:02,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:02,669 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:02,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 19:50:02,670 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 19:50:02,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:02,670 INFO L82 PathProgramCache]: Analyzing trace with hash -119858186, now seen corresponding path program 895 times [2020-02-10 19:50:02,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:02,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744497585] [2020-02-10 19:50:02,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:02,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 19:50:02,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744497585] [2020-02-10 19:50:02,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:02,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:02,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974072033] [2020-02-10 19:50:02,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:02,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:02,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:02,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:02,994 INFO L87 Difference]: Start difference. First operand 381 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:50:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:03,099 INFO L93 Difference]: Finished difference Result 600 states and 1767 transitions. [2020-02-10 19:50:03,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:03,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:03,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:03,101 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:50:03,101 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:50:03,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 19:50:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:50:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 389. [2020-02-10 19:50:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:50:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1339 transitions. [2020-02-10 19:50:03,112 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1339 transitions. Word has length 22 [2020-02-10 19:50:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:03,112 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1339 transitions. [2020-02-10 19:50:03,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1339 transitions. [2020-02-10 19:50:03,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:03,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:03,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 19:50:03,113 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 19:50:03,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:03,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1470407700, now seen corresponding path program 896 times [2020-02-10 19:50:03,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:03,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456031953] [2020-02-10 19:50:03,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:03,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 19:50:03,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456031953] [2020-02-10 19:50:03,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:03,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:03,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536820164] [2020-02-10 19:50:03,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:03,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:03,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:03,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:03,412 INFO L87 Difference]: Start difference. First operand 389 states and 1339 transitions. Second operand 9 states. [2020-02-10 19:50:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:03,554 INFO L93 Difference]: Finished difference Result 595 states and 1754 transitions. [2020-02-10 19:50:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:03,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:03,556 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:50:03,556 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:50:03,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:50:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 385. [2020-02-10 19:50:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:50:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1329 transitions. [2020-02-10 19:50:03,565 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1329 transitions. Word has length 22 [2020-02-10 19:50:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:03,565 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1329 transitions. [2020-02-10 19:50:03,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1329 transitions. [2020-02-10 19:50:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:03,565 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:03,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 19:50:03,565 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 19:50:03,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:03,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1468534938, now seen corresponding path program 897 times [2020-02-10 19:50:03,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:03,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449007489] [2020-02-10 19:50:03,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:03,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 19:50:03,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449007489] [2020-02-10 19:50:03,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:03,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:03,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108669041] [2020-02-10 19:50:03,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:03,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:03,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:03,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:03,870 INFO L87 Difference]: Start difference. First operand 385 states and 1329 transitions. Second operand 9 states. [2020-02-10 19:50:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:03,988 INFO L93 Difference]: Finished difference Result 594 states and 1754 transitions. [2020-02-10 19:50:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:03,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:03,990 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:50:03,990 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:50:03,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 19:50:03,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:50:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 390. [2020-02-10 19:50:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:50:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1337 transitions. [2020-02-10 19:50:04,000 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1337 transitions. Word has length 22 [2020-02-10 19:50:04,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:04,000 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1337 transitions. [2020-02-10 19:50:04,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:04,000 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1337 transitions. [2020-02-10 19:50:04,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:04,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:04,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 19:50:04,001 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 19:50:04,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:04,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1125104456, now seen corresponding path program 898 times [2020-02-10 19:50:04,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:04,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883858607] [2020-02-10 19:50:04,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:04,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 19:50:04,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883858607] [2020-02-10 19:50:04,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:04,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:04,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371610637] [2020-02-10 19:50:04,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:04,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:04,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:04,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:04,325 INFO L87 Difference]: Start difference. First operand 390 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:50:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:04,444 INFO L93 Difference]: Finished difference Result 581 states and 1734 transitions. [2020-02-10 19:50:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:04,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:04,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:04,446 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:50:04,446 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:50:04,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 19:50:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:50:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 385. [2020-02-10 19:50:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:50:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1325 transitions. [2020-02-10 19:50:04,455 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1325 transitions. Word has length 22 [2020-02-10 19:50:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:04,455 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1325 transitions. [2020-02-10 19:50:04,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1325 transitions. [2020-02-10 19:50:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:04,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:04,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 19:50:04,456 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 19:50:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:04,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1611135944, now seen corresponding path program 899 times [2020-02-10 19:50:04,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:04,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346295797] [2020-02-10 19:50:04,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:04,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346295797] [2020-02-10 19:50:04,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:04,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:04,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910682555] [2020-02-10 19:50:04,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:04,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:04,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:04,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:04,787 INFO L87 Difference]: Start difference. First operand 385 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:50:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:04,906 INFO L93 Difference]: Finished difference Result 587 states and 1736 transitions. [2020-02-10 19:50:04,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:04,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:04,908 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:50:04,908 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:50:04,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 19:50:04,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:50:04,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 388. [2020-02-10 19:50:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:50:04,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1330 transitions. [2020-02-10 19:50:04,918 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1330 transitions. Word has length 22 [2020-02-10 19:50:04,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:04,918 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1330 transitions. [2020-02-10 19:50:04,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1330 transitions. [2020-02-10 19:50:04,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:04,919 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:04,919 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:04,919 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 19:50:04,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:04,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1810090672, now seen corresponding path program 900 times [2020-02-10 19:50:04,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:04,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082093798] [2020-02-10 19:50:04,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:05,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 19:50:05,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082093798] [2020-02-10 19:50:05,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:05,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:05,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861090449] [2020-02-10 19:50:05,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:05,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:05,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:05,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:05,224 INFO L87 Difference]: Start difference. First operand 388 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:50:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:05,341 INFO L93 Difference]: Finished difference Result 579 states and 1727 transitions. [2020-02-10 19:50:05,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:05,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:05,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:05,343 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:50:05,343 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:50:05,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:50:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 381. [2020-02-10 19:50:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1316 transitions. [2020-02-10 19:50:05,353 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1316 transitions. Word has length 22 [2020-02-10 19:50:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:05,353 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1316 transitions. [2020-02-10 19:50:05,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1316 transitions. [2020-02-10 19:50:05,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:05,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:05,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 19:50:05,354 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 19:50:05,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:05,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1142625094, now seen corresponding path program 901 times [2020-02-10 19:50:05,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:05,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151543304] [2020-02-10 19:50:05,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:05,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 19:50:05,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151543304] [2020-02-10 19:50:05,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:05,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:05,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481604458] [2020-02-10 19:50:05,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:05,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:05,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:05,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:05,641 INFO L87 Difference]: Start difference. First operand 381 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:50:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:05,760 INFO L93 Difference]: Finished difference Result 595 states and 1750 transitions. [2020-02-10 19:50:05,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:05,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:05,762 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:50:05,762 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:50:05,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:05,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:50:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 387. [2020-02-10 19:50:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:50:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1330 transitions. [2020-02-10 19:50:05,772 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1330 transitions. Word has length 22 [2020-02-10 19:50:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:05,772 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1330 transitions. [2020-02-10 19:50:05,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1330 transitions. [2020-02-10 19:50:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:05,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:05,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 19:50:05,773 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 19:50:05,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:05,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1269261468, now seen corresponding path program 902 times [2020-02-10 19:50:05,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:05,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559998542] [2020-02-10 19:50:05,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:06,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 19:50:06,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559998542] [2020-02-10 19:50:06,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:06,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:06,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822720936] [2020-02-10 19:50:06,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:06,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:06,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:06,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:06,055 INFO L87 Difference]: Start difference. First operand 387 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:50:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:06,172 INFO L93 Difference]: Finished difference Result 589 states and 1736 transitions. [2020-02-10 19:50:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:06,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:06,174 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:50:06,174 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:50:06,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 19:50:06,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:50:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 384. [2020-02-10 19:50:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-02-10 19:50:06,190 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-02-10 19:50:06,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:06,190 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-02-10 19:50:06,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-02-10 19:50:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:06,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:06,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:06,191 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 19:50:06,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:06,191 INFO L82 PathProgramCache]: Analyzing trace with hash 66913938, now seen corresponding path program 903 times [2020-02-10 19:50:06,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:06,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661353833] [2020-02-10 19:50:06,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:06,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 19:50:06,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661353833] [2020-02-10 19:50:06,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:06,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:06,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421407740] [2020-02-10 19:50:06,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:06,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:06,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:06,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:06,497 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:50:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:06,591 INFO L93 Difference]: Finished difference Result 591 states and 1743 transitions. [2020-02-10 19:50:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:06,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:06,593 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:50:06,593 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:50:06,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:50:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 389. [2020-02-10 19:50:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:50:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1331 transitions. [2020-02-10 19:50:06,603 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1331 transitions. Word has length 22 [2020-02-10 19:50:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:06,604 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1331 transitions. [2020-02-10 19:50:06,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1331 transitions. [2020-02-10 19:50:06,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:06,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:06,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 19:50:06,604 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 19:50:06,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:06,605 INFO L82 PathProgramCache]: Analyzing trace with hash -41585508, now seen corresponding path program 904 times [2020-02-10 19:50:06,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:06,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802779502] [2020-02-10 19:50:06,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:06,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 19:50:06,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802779502] [2020-02-10 19:50:06,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:06,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:06,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774181441] [2020-02-10 19:50:06,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:06,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:06,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:06,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:06,918 INFO L87 Difference]: Start difference. First operand 389 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:50:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:07,063 INFO L93 Difference]: Finished difference Result 578 states and 1723 transitions. [2020-02-10 19:50:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:07,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:07,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:07,065 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:50:07,065 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:50:07,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:07,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:50:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 384. [2020-02-10 19:50:07,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1320 transitions. [2020-02-10 19:50:07,075 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1320 transitions. Word has length 22 [2020-02-10 19:50:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:07,075 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1320 transitions. [2020-02-10 19:50:07,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1320 transitions. [2020-02-10 19:50:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:07,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:07,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:07,076 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 19:50:07,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:07,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1952620448, now seen corresponding path program 905 times [2020-02-10 19:50:07,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:07,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129084011] [2020-02-10 19:50:07,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:07,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 19:50:07,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129084011] [2020-02-10 19:50:07,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:07,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:07,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459201764] [2020-02-10 19:50:07,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:07,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:07,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:07,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:07,373 INFO L87 Difference]: Start difference. First operand 384 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:50:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:07,493 INFO L93 Difference]: Finished difference Result 582 states and 1721 transitions. [2020-02-10 19:50:07,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:07,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:07,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:07,495 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:50:07,496 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:50:07,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 19:50:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:50:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 386. [2020-02-10 19:50:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:50:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1323 transitions. [2020-02-10 19:50:07,505 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1323 transitions. Word has length 22 [2020-02-10 19:50:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:07,505 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1323 transitions. [2020-02-10 19:50:07,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1323 transitions. [2020-02-10 19:50:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:07,506 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:07,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 19:50:07,506 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 19:50:07,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:07,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2125868140, now seen corresponding path program 906 times [2020-02-10 19:50:07,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:07,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456568395] [2020-02-10 19:50:07,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:07,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 19:50:07,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456568395] [2020-02-10 19:50:07,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:07,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:07,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796668682] [2020-02-10 19:50:07,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:07,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:07,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:07,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:07,790 INFO L87 Difference]: Start difference. First operand 386 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:50:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:07,918 INFO L93 Difference]: Finished difference Result 575 states and 1715 transitions. [2020-02-10 19:50:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:07,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:07,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:07,920 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:50:07,920 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:50:07,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 19:50:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:50:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 381. [2020-02-10 19:50:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1313 transitions. [2020-02-10 19:50:07,931 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1313 transitions. Word has length 22 [2020-02-10 19:50:07,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:07,931 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1313 transitions. [2020-02-10 19:50:07,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1313 transitions. [2020-02-10 19:50:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:07,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:07,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 19:50:07,932 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 19:50:07,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:07,932 INFO L82 PathProgramCache]: Analyzing trace with hash -51665112, now seen corresponding path program 907 times [2020-02-10 19:50:07,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:07,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158116912] [2020-02-10 19:50:07,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:08,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 19:50:08,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158116912] [2020-02-10 19:50:08,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:08,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:08,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094456657] [2020-02-10 19:50:08,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:08,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:08,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:08,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:08,239 INFO L87 Difference]: Start difference. First operand 381 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:50:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:08,364 INFO L93 Difference]: Finished difference Result 576 states and 1710 transitions. [2020-02-10 19:50:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:08,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:08,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:08,366 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:50:08,366 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:50: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 19:50:08,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:50:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 385. [2020-02-10 19:50:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:50:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-02-10 19:50:08,375 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-02-10 19:50:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:08,375 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-02-10 19:50:08,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-02-10 19:50:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:08,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:08,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 19:50:08,376 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 19:50:08,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:08,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1290267676, now seen corresponding path program 908 times [2020-02-10 19:50:08,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:08,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844003360] [2020-02-10 19:50:08,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:08,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 19:50:08,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844003360] [2020-02-10 19:50:08,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:08,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:08,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123793727] [2020-02-10 19:50:08,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:08,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:08,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:08,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:08,673 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:50:08,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:08,793 INFO L93 Difference]: Finished difference Result 575 states and 1706 transitions. [2020-02-10 19:50:08,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:08,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:08,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:08,795 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:50:08,795 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:50:08,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 19:50:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:50:08,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 383. [2020-02-10 19:50:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 19:50:08,805 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 19:50:08,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:08,805 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 19:50:08,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 19:50:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:08,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:08,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 19:50:08,806 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 19:50:08,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:08,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1127376268, now seen corresponding path program 909 times [2020-02-10 19:50:08,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:08,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495447317] [2020-02-10 19:50:08,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:09,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 19:50:09,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495447317] [2020-02-10 19:50:09,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:09,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:09,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866881098] [2020-02-10 19:50:09,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:09,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:09,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:09,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:09,126 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:50:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:09,246 INFO L93 Difference]: Finished difference Result 576 states and 1710 transitions. [2020-02-10 19:50:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:09,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:09,247 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:50:09,248 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:50:09,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 19:50:09,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:50:09,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 386. [2020-02-10 19:50:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:50:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1323 transitions. [2020-02-10 19:50:09,256 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1323 transitions. Word has length 22 [2020-02-10 19:50:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:09,257 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1323 transitions. [2020-02-10 19:50:09,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1323 transitions. [2020-02-10 19:50:09,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:09,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:09,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 19:50:09,257 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 19:50:09,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:09,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1339192868, now seen corresponding path program 910 times [2020-02-10 19:50:09,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:09,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585406209] [2020-02-10 19:50:09,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:09,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 19:50:09,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585406209] [2020-02-10 19:50:09,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:09,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:09,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218364988] [2020-02-10 19:50:09,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:09,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:09,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:09,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:09,562 INFO L87 Difference]: Start difference. First operand 386 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:50:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:09,684 INFO L93 Difference]: Finished difference Result 568 states and 1701 transitions. [2020-02-10 19:50:09,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:09,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:09,686 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:50:09,686 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:50:09,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 19:50:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:50:09,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 383. [2020-02-10 19:50:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-02-10 19:50:09,695 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-02-10 19:50:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:09,696 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-02-10 19:50:09,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-02-10 19:50:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:09,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:09,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 19:50:09,696 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 19:50:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:09,697 INFO L82 PathProgramCache]: Analyzing trace with hash -858528860, now seen corresponding path program 911 times [2020-02-10 19:50:09,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:09,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938535878] [2020-02-10 19:50:09,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:10,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:10,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938535878] [2020-02-10 19:50:10,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:10,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:10,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353084303] [2020-02-10 19:50:10,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:10,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:10,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:10,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:10,001 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:50:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:10,122 INFO L93 Difference]: Finished difference Result 574 states and 1703 transitions. [2020-02-10 19:50:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:10,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:10,124 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:50:10,124 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:50:10,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 19:50:10,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:50:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 385. [2020-02-10 19:50:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:50:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1319 transitions. [2020-02-10 19:50:10,134 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1319 transitions. Word has length 22 [2020-02-10 19:50:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:10,134 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1319 transitions. [2020-02-10 19:50:10,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1319 transitions. [2020-02-10 19:50:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:10,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:10,135 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:10,135 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 19:50:10,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1031776552, now seen corresponding path program 912 times [2020-02-10 19:50:10,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:10,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373316640] [2020-02-10 19:50:10,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:10,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 19:50:10,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373316640] [2020-02-10 19:50:10,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:10,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:10,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448936303] [2020-02-10 19:50:10,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:10,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:10,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:10,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:10,433 INFO L87 Difference]: Start difference. First operand 385 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:50:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:10,565 INFO L93 Difference]: Finished difference Result 567 states and 1697 transitions. [2020-02-10 19:50:10,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:10,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:10,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:10,566 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:50:10,567 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:50:10,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 19:50:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:50:10,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 378. [2020-02-10 19:50:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:50:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1307 transitions. [2020-02-10 19:50:10,576 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1307 transitions. Word has length 22 [2020-02-10 19:50:10,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:10,576 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1307 transitions. [2020-02-10 19:50:10,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1307 transitions. [2020-02-10 19:50:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:10,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:10,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 19:50:10,577 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 19:50:10,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:10,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1272520550, now seen corresponding path program 913 times [2020-02-10 19:50:10,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:10,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425986792] [2020-02-10 19:50:10,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:10,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 19:50:10,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425986792] [2020-02-10 19:50:10,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:10,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:10,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857076462] [2020-02-10 19:50:10,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:10,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:10,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:10,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:10,884 INFO L87 Difference]: Start difference. First operand 378 states and 1307 transitions. Second operand 9 states. [2020-02-10 19:50:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:10,979 INFO L93 Difference]: Finished difference Result 577 states and 1698 transitions. [2020-02-10 19:50:10,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:10,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:10,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:10,981 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:50:10,981 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:50:10,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 19:50:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:50:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 384. [2020-02-10 19:50:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-02-10 19:50:10,991 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-02-10 19:50:10,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:10,991 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-02-10 19:50:10,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:10,991 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-02-10 19:50:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:10,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:10,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 19:50:10,992 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 19:50:10,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:10,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1833589042, now seen corresponding path program 914 times [2020-02-10 19:50:10,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:10,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447849671] [2020-02-10 19:50:10,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:11,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 19:50:11,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447849671] [2020-02-10 19:50:11,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:11,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:11,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711643268] [2020-02-10 19:50:11,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:11,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:11,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:11,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:11,286 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:50:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:11,376 INFO L93 Difference]: Finished difference Result 570 states and 1683 transitions. [2020-02-10 19:50:11,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:11,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:11,378 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:50:11,378 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:50:11,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 19:50:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:50:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 382. [2020-02-10 19:50:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:50:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1319 transitions. [2020-02-10 19:50:11,388 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1319 transitions. Word has length 22 [2020-02-10 19:50:11,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:11,388 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1319 transitions. [2020-02-10 19:50:11,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:11,388 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1319 transitions. [2020-02-10 19:50:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:11,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:11,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 19:50:11,389 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 19:50:11,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:11,389 INFO L82 PathProgramCache]: Analyzing trace with hash -327917304, now seen corresponding path program 915 times [2020-02-10 19:50:11,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:11,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399918038] [2020-02-10 19:50:11,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:11,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 19:50:11,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399918038] [2020-02-10 19:50:11,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:11,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:11,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496357521] [2020-02-10 19:50:11,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:11,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:11,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:11,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:11,679 INFO L87 Difference]: Start difference. First operand 382 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:50:11,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:11,767 INFO L93 Difference]: Finished difference Result 579 states and 1701 transitions. [2020-02-10 19:50:11,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:11,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:11,769 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:50:11,769 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:50:11,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:50:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-02-10 19:50:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:50:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-02-10 19:50:11,778 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-02-10 19:50:11,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:11,778 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-02-10 19:50:11,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-02-10 19:50:11,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:11,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:11,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 19:50:11,779 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 19:50:11,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:11,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1290120966, now seen corresponding path program 916 times [2020-02-10 19:50:11,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:11,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027980405] [2020-02-10 19:50:11,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:12,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 19:50:12,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027980405] [2020-02-10 19:50:12,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:12,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:12,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102257953] [2020-02-10 19:50:12,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:12,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:12,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:12,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:12,075 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:50:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:12,194 INFO L93 Difference]: Finished difference Result 573 states and 1687 transitions. [2020-02-10 19:50:12,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:12,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:12,196 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:50:12,196 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:50:12,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:50:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-02-10 19:50:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:50:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-02-10 19:50:12,206 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-02-10 19:50:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:12,206 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-02-10 19:50:12,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-02-10 19:50:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:12,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:12,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 19:50:12,207 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 19:50:12,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:12,208 INFO L82 PathProgramCache]: Analyzing trace with hash -273195078, now seen corresponding path program 917 times [2020-02-10 19:50:12,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:12,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820516211] [2020-02-10 19:50:12,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:12,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 19:50:12,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820516211] [2020-02-10 19:50:12,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:12,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:12,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490431957] [2020-02-10 19:50:12,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:12,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:12,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:12,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:12,510 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:50:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:12,603 INFO L93 Difference]: Finished difference Result 563 states and 1668 transitions. [2020-02-10 19:50:12,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:12,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:12,605 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:50:12,605 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:50:12,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 19:50:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:50:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 383. [2020-02-10 19:50:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 19:50:12,616 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 19:50:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:12,616 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 19:50:12,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 19:50:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:12,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:12,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 19:50:12,617 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 19:50:12,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1337745880, now seen corresponding path program 918 times [2020-02-10 19:50:12,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:12,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337034705] [2020-02-10 19:50:12,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:12,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 19:50:12,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337034705] [2020-02-10 19:50:12,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:12,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:12,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129013335] [2020-02-10 19:50:12,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:12,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:12,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:12,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:12,929 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:50:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:13,046 INFO L93 Difference]: Finished difference Result 564 states and 1669 transitions. [2020-02-10 19:50:13,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:13,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:13,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:13,048 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:50:13,048 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:50:13,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 19:50:13,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:50:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 380. [2020-02-10 19:50:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:50:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1313 transitions. [2020-02-10 19:50:13,058 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1313 transitions. Word has length 22 [2020-02-10 19:50:13,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:13,058 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1313 transitions. [2020-02-10 19:50:13,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1313 transitions. [2020-02-10 19:50:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:13,059 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:13,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 19:50:13,059 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 19:50:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1693749326, now seen corresponding path program 919 times [2020-02-10 19:50:13,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:13,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400153583] [2020-02-10 19:50:13,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:13,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 19:50:13,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400153583] [2020-02-10 19:50:13,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:13,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:13,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492771980] [2020-02-10 19:50:13,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:13,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:13,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:13,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:13,352 INFO L87 Difference]: Start difference. First operand 380 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:50:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:13,465 INFO L93 Difference]: Finished difference Result 579 states and 1702 transitions. [2020-02-10 19:50:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:13,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:13,467 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:50:13,467 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:50:13,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 19:50:13,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:50:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-02-10 19:50:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1321 transitions. [2020-02-10 19:50:13,476 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1321 transitions. Word has length 22 [2020-02-10 19:50:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:13,476 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1321 transitions. [2020-02-10 19:50:13,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1321 transitions. [2020-02-10 19:50:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:13,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:13,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 19:50:13,477 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 19:50:13,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:13,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1132680834, now seen corresponding path program 920 times [2020-02-10 19:50:13,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:13,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898941314] [2020-02-10 19:50:13,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:13,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 19:50:13,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898941314] [2020-02-10 19:50:13,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:13,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:13,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969541057] [2020-02-10 19:50:13,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:13,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:13,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:13,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:13,774 INFO L87 Difference]: Start difference. First operand 384 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:50:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:13,868 INFO L93 Difference]: Finished difference Result 572 states and 1687 transitions. [2020-02-10 19:50:13,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:13,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:13,870 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:50:13,870 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:50:13,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 19:50:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:50:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 382. [2020-02-10 19:50:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:50:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-02-10 19:50:13,879 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-02-10 19:50:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:13,879 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-02-10 19:50:13,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-02-10 19:50:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:13,880 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:13,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 19:50:13,880 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 19:50:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2013472648, now seen corresponding path program 921 times [2020-02-10 19:50:13,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:13,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050118975] [2020-02-10 19:50:13,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:14,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 19:50:14,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050118975] [2020-02-10 19:50:14,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:14,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:14,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672574600] [2020-02-10 19:50:14,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:14,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:14,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:14,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:14,174 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:50:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:14,256 INFO L93 Difference]: Finished difference Result 577 states and 1701 transitions. [2020-02-10 19:50:14,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:14,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:14,258 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:50:14,258 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:50:14,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 19:50:14,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:50:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 387. [2020-02-10 19:50:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:50:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1325 transitions. [2020-02-10 19:50:14,267 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1325 transitions. Word has length 22 [2020-02-10 19:50:14,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:14,267 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1325 transitions. [2020-02-10 19:50:14,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1325 transitions. [2020-02-10 19:50:14,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:14,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:14,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 19:50:14,268 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 19:50:14,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:14,268 INFO L82 PathProgramCache]: Analyzing trace with hash -259577990, now seen corresponding path program 922 times [2020-02-10 19:50:14,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:14,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786571884] [2020-02-10 19:50:14,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:14,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 19:50:14,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786571884] [2020-02-10 19:50:14,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:14,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:14,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84597252] [2020-02-10 19:50:14,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:14,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:14,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:14,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:14,576 INFO L87 Difference]: Start difference. First operand 387 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:50:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:14,690 INFO L93 Difference]: Finished difference Result 564 states and 1681 transitions. [2020-02-10 19:50:14,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:14,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:14,691 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:50:14,692 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:50:14,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 19:50:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:50:14,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 382. [2020-02-10 19:50:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:50:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-02-10 19:50:14,701 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-02-10 19:50:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:14,701 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-02-10 19:50:14,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-02-10 19:50:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:14,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:14,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 19:50:14,702 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 19:50:14,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:14,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2068194874, now seen corresponding path program 923 times [2020-02-10 19:50:14,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:14,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169079217] [2020-02-10 19:50:14,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:14,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 19:50:14,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169079217] [2020-02-10 19:50:14,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:14,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:15,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20926134] [2020-02-10 19:50:15,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:15,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:15,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:15,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:15,000 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:50:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:15,096 INFO L93 Difference]: Finished difference Result 566 states and 1675 transitions. [2020-02-10 19:50:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:15,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:15,098 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:50:15,098 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:50:15,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:50:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 383. [2020-02-10 19:50:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-02-10 19:50:15,108 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-02-10 19:50:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:15,108 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-02-10 19:50:15,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-02-10 19:50:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:15,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:15,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 19:50:15,109 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 19:50:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:15,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1691542620, now seen corresponding path program 924 times [2020-02-10 19:50:15,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:15,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987273663] [2020-02-10 19:50:15,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:15,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 19:50:15,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987273663] [2020-02-10 19:50:15,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:15,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:15,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264563791] [2020-02-10 19:50:15,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:15,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:15,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:15,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:15,406 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:50:15,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:15,515 INFO L93 Difference]: Finished difference Result 560 states and 1672 transitions. [2020-02-10 19:50:15,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:15,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:15,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:15,517 INFO L225 Difference]: With dead ends: 560 [2020-02-10 19:50:15,517 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:50:15,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:15,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:50:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 380. [2020-02-10 19:50:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:50:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1311 transitions. [2020-02-10 19:50:15,527 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1311 transitions. Word has length 22 [2020-02-10 19:50:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:15,527 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1311 transitions. [2020-02-10 19:50:15,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1311 transitions. [2020-02-10 19:50:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:15,527 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:15,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 19:50:15,527 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 19:50:15,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:15,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1368153102, now seen corresponding path program 925 times [2020-02-10 19:50:15,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:15,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208625007] [2020-02-10 19:50:15,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:15,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208625007] [2020-02-10 19:50:15,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:15,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:15,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710197513] [2020-02-10 19:50:15,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:15,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:15,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:15,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:15,812 INFO L87 Difference]: Start difference. First operand 380 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:50:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:15,901 INFO L93 Difference]: Finished difference Result 584 states and 1714 transitions. [2020-02-10 19:50:15,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:15,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:15,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:15,903 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:50:15,903 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:50:15,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 19:50:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:50:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 386. [2020-02-10 19:50:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:50:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-02-10 19:50:15,912 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-02-10 19:50:15,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:15,912 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-02-10 19:50:15,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-02-10 19:50:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:15,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:15,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 19:50:15,912 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 19:50:15,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:15,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1964610532, now seen corresponding path program 926 times [2020-02-10 19:50:15,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:15,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677348208] [2020-02-10 19:50:15,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:16,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 19:50:16,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677348208] [2020-02-10 19:50:16,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:16,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:16,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990269778] [2020-02-10 19:50:16,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:16,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:16,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:16,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:16,195 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:50:16,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:16,305 INFO L93 Difference]: Finished difference Result 578 states and 1700 transitions. [2020-02-10 19:50:16,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:16,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:16,307 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:50:16,307 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:50:16,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 19:50:16,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:50:16,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 383. [2020-02-10 19:50:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 19:50:16,317 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 19:50:16,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:16,317 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 19:50:16,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:16,317 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 19:50:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:16,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:16,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 19:50:16,318 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 19:50:16,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:16,318 INFO L82 PathProgramCache]: Analyzing trace with hash -355460570, now seen corresponding path program 927 times [2020-02-10 19:50:16,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:16,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346360388] [2020-02-10 19:50:16,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:16,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 19:50:16,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346360388] [2020-02-10 19:50:16,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:16,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:16,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030669688] [2020-02-10 19:50:16,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:16,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:16,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:16,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:16,617 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:50:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:16,713 INFO L93 Difference]: Finished difference Result 580 states and 1707 transitions. [2020-02-10 19:50:16,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:16,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:16,715 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:50:16,715 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:50: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 19:50:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:50:16,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 388. [2020-02-10 19:50:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:50:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1326 transitions. [2020-02-10 19:50:16,725 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1326 transitions. Word has length 22 [2020-02-10 19:50:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:16,725 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1326 transitions. [2020-02-10 19:50:16,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1326 transitions. [2020-02-10 19:50:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:16,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:16,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 19:50:16,726 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 19:50:16,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:16,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1666456088, now seen corresponding path program 928 times [2020-02-10 19:50:16,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:16,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423304236] [2020-02-10 19:50:16,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:17,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 19:50:17,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423304236] [2020-02-10 19:50:17,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:17,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:17,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926098059] [2020-02-10 19:50:17,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:17,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:17,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:17,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:17,024 INFO L87 Difference]: Start difference. First operand 388 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:50:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:17,134 INFO L93 Difference]: Finished difference Result 567 states and 1687 transitions. [2020-02-10 19:50:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:17,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:17,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:17,136 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:50:17,136 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 19:50:17,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 19:50:17,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 383. [2020-02-10 19:50:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1315 transitions. [2020-02-10 19:50:17,145 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1315 transitions. Word has length 22 [2020-02-10 19:50:17,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:17,145 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1315 transitions. [2020-02-10 19:50:17,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:17,145 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1315 transitions. [2020-02-10 19:50:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:17,146 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:17,146 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:17,146 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 19:50:17,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:17,146 INFO L82 PathProgramCache]: Analyzing trace with hash 361118400, now seen corresponding path program 929 times [2020-02-10 19:50:17,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:17,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098396430] [2020-02-10 19:50:17,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:17,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 19:50:17,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098396430] [2020-02-10 19:50:17,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:17,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:17,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600086950] [2020-02-10 19:50:17,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:17,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:17,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:17,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:17,440 INFO L87 Difference]: Start difference. First operand 383 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:50:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:17,548 INFO L93 Difference]: Finished difference Result 571 states and 1685 transitions. [2020-02-10 19:50:17,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:17,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:17,549 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:50:17,550 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:50:17,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 19:50:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:50:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 385. [2020-02-10 19:50:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:50:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1318 transitions. [2020-02-10 19:50:17,559 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1318 transitions. Word has length 22 [2020-02-10 19:50:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:17,559 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1318 transitions. [2020-02-10 19:50:17,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1318 transitions. [2020-02-10 19:50:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:17,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:17,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 19:50:17,560 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 19:50:17,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:17,560 INFO L82 PathProgramCache]: Analyzing trace with hash 187870708, now seen corresponding path program 930 times [2020-02-10 19:50:17,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:17,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690790361] [2020-02-10 19:50:17,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:17,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 19:50:17,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690790361] [2020-02-10 19:50:17,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:17,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:17,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910232307] [2020-02-10 19:50:17,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:17,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:17,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:17,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:17,849 INFO L87 Difference]: Start difference. First operand 385 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:50:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:17,962 INFO L93 Difference]: Finished difference Result 564 states and 1679 transitions. [2020-02-10 19:50:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:17,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:17,964 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:50:17,964 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:50:17,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:50:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 380. [2020-02-10 19:50:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:50:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1309 transitions. [2020-02-10 19:50:17,973 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1309 transitions. Word has length 22 [2020-02-10 19:50:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:17,973 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1309 transitions. [2020-02-10 19:50:17,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1309 transitions. [2020-02-10 19:50:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:17,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:17,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 19:50:17,974 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 19:50:17,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:17,974 INFO L82 PathProgramCache]: Analyzing trace with hash 169704062, now seen corresponding path program 931 times [2020-02-10 19:50:17,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:17,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720300472] [2020-02-10 19:50:17,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:18,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 19:50:18,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720300472] [2020-02-10 19:50:18,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:18,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:18,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695228755] [2020-02-10 19:50:18,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:18,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:18,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:18,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:18,284 INFO L87 Difference]: Start difference. First operand 380 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:50:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:18,367 INFO L93 Difference]: Finished difference Result 555 states and 1650 transitions. [2020-02-10 19:50:18,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:18,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:18,369 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:50:18,369 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:50:18,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 19:50:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:50:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 382. [2020-02-10 19:50:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:50:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1313 transitions. [2020-02-10 19:50:18,379 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1313 transitions. Word has length 22 [2020-02-10 19:50:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:18,379 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1313 transitions. [2020-02-10 19:50:18,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1313 transitions. [2020-02-10 19:50:18,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:18,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:18,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 19:50:18,379 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 19:50:18,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:18,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1780645020, now seen corresponding path program 932 times [2020-02-10 19:50:18,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:18,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18741980] [2020-02-10 19:50:18,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:18,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 19:50:18,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18741980] [2020-02-10 19:50:18,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:18,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:18,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301372363] [2020-02-10 19:50:18,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:18,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:18,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:18,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:18,689 INFO L87 Difference]: Start difference. First operand 382 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:50:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:18,816 INFO L93 Difference]: Finished difference Result 556 states and 1651 transitions. [2020-02-10 19:50:18,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:18,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:18,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:18,818 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:50:18,818 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:50:18,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 19:50:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:50:18,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 381. [2020-02-10 19:50:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1311 transitions. [2020-02-10 19:50:18,827 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1311 transitions. Word has length 22 [2020-02-10 19:50:18,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:18,827 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1311 transitions. [2020-02-10 19:50:18,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1311 transitions. [2020-02-10 19:50:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:18,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:18,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 19:50:18,828 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 19:50:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:18,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1182396594, now seen corresponding path program 933 times [2020-02-10 19:50:18,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:18,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161627938] [2020-02-10 19:50:18,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:19,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161627938] [2020-02-10 19:50:19,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:19,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:19,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278534139] [2020-02-10 19:50:19,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:19,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:19,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:19,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:19,127 INFO L87 Difference]: Start difference. First operand 381 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:50:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:19,221 INFO L93 Difference]: Finished difference Result 556 states and 1652 transitions. [2020-02-10 19:50:19,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:19,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:19,223 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:50:19,224 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:50:19,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 19:50:19,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:50:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 382. [2020-02-10 19:50:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:50:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1312 transitions. [2020-02-10 19:50:19,233 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1312 transitions. Word has length 22 [2020-02-10 19:50:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:19,233 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1312 transitions. [2020-02-10 19:50:19,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:19,233 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1312 transitions. [2020-02-10 19:50:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:19,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:19,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 19:50:19,234 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 19:50:19,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:19,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1717626396, now seen corresponding path program 934 times [2020-02-10 19:50:19,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:19,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684798024] [2020-02-10 19:50:19,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:19,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 19:50:19,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684798024] [2020-02-10 19:50:19,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:19,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:19,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727755457] [2020-02-10 19:50:19,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:19,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:19,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:19,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:19,535 INFO L87 Difference]: Start difference. First operand 382 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:50:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:19,659 INFO L93 Difference]: Finished difference Result 550 states and 1649 transitions. [2020-02-10 19:50:19,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:19,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:19,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:19,661 INFO L225 Difference]: With dead ends: 550 [2020-02-10 19:50:19,661 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:50:19,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 19:50:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:50:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 381. [2020-02-10 19:50:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-02-10 19:50:19,671 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-02-10 19:50:19,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:19,671 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-02-10 19:50:19,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-02-10 19:50:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:19,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:19,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 19:50:19,672 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 19:50:19,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:19,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1192899698, now seen corresponding path program 935 times [2020-02-10 19:50:19,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:19,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745261263] [2020-02-10 19:50:19,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:19,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745261263] [2020-02-10 19:50:19,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:19,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:19,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209986447] [2020-02-10 19:50:19,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:19,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:19,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:19,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:19,967 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:50:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:20,072 INFO L93 Difference]: Finished difference Result 558 states and 1656 transitions. [2020-02-10 19:50:20,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:20,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:20,073 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:50:20,074 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:50:20,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 19:50:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:50:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 383. [2020-02-10 19:50:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-02-10 19:50:20,084 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-02-10 19:50:20,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:20,084 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-02-10 19:50:20,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-02-10 19:50:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:20,085 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:20,085 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:20,085 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 19:50:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:20,085 INFO L82 PathProgramCache]: Analyzing trace with hash 117188542, now seen corresponding path program 936 times [2020-02-10 19:50:20,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:20,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76424950] [2020-02-10 19:50:20,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:20,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 19:50:20,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76424950] [2020-02-10 19:50:20,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:20,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:20,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414577260] [2020-02-10 19:50:20,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:20,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:20,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:20,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:20,380 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:50:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:20,498 INFO L93 Difference]: Finished difference Result 551 states and 1650 transitions. [2020-02-10 19:50:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:20,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:20,500 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:50:20,500 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 19:50:20,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 19:50:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 19:50:20,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 378. [2020-02-10 19:50:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:50:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1305 transitions. [2020-02-10 19:50:20,510 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1305 transitions. Word has length 22 [2020-02-10 19:50:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:20,511 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1305 transitions. [2020-02-10 19:50:20,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1305 transitions. [2020-02-10 19:50:20,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:20,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:20,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 19:50:20,511 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 19:50:20,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:20,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1209640248, now seen corresponding path program 937 times [2020-02-10 19:50:20,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:20,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833010092] [2020-02-10 19:50:20,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:20,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 19:50:20,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833010092] [2020-02-10 19:50:20,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:20,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:20,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287779107] [2020-02-10 19:50:20,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:20,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:20,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:20,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:20,820 INFO L87 Difference]: Start difference. First operand 378 states and 1305 transitions. Second operand 9 states. [2020-02-10 19:50:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:20,929 INFO L93 Difference]: Finished difference Result 546 states and 1632 transitions. [2020-02-10 19:50:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:20,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:20,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:20,931 INFO L225 Difference]: With dead ends: 546 [2020-02-10 19:50:20,931 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:50:20,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 19:50:20,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:50:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 381. [2020-02-10 19:50:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1313 transitions. [2020-02-10 19:50:20,946 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1313 transitions. Word has length 22 [2020-02-10 19:50:20,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:20,946 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1313 transitions. [2020-02-10 19:50:20,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:20,946 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1313 transitions. [2020-02-10 19:50:20,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:20,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:20,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:20,947 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 19:50:20,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:20,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1639810038, now seen corresponding path program 938 times [2020-02-10 19:50:20,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:20,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524694179] [2020-02-10 19:50:20,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:21,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 19:50:21,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524694179] [2020-02-10 19:50:21,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:21,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:21,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476192920] [2020-02-10 19:50:21,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:21,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:21,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:21,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:21,265 INFO L87 Difference]: Start difference. First operand 381 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:50:21,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:21,353 INFO L93 Difference]: Finished difference Result 544 states and 1627 transitions. [2020-02-10 19:50:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:21,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:21,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:21,355 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:50:21,355 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 19:50:21,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 19:50:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 19:50:21,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 380. [2020-02-10 19:50:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:50:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1311 transitions. [2020-02-10 19:50:21,364 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1311 transitions. Word has length 22 [2020-02-10 19:50:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:21,365 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1311 transitions. [2020-02-10 19:50:21,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1311 transitions. [2020-02-10 19:50:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:21,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:21,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 19:50:21,365 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 19:50:21,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:21,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1484889194, now seen corresponding path program 939 times [2020-02-10 19:50:21,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:21,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843767485] [2020-02-10 19:50:21,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:21,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 19:50:21,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843767485] [2020-02-10 19:50:21,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:21,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:21,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132624294] [2020-02-10 19:50:21,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:21,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:21,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:21,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:21,685 INFO L87 Difference]: Start difference. First operand 380 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:50:21,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:21,798 INFO L93 Difference]: Finished difference Result 548 states and 1636 transitions. [2020-02-10 19:50:21,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:21,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:21,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:21,800 INFO L225 Difference]: With dead ends: 548 [2020-02-10 19:50:21,800 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:50:21,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 19:50:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:50:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 382. [2020-02-10 19:50:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:50:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1314 transitions. [2020-02-10 19:50:21,810 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1314 transitions. Word has length 22 [2020-02-10 19:50:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:21,810 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1314 transitions. [2020-02-10 19:50:21,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1314 transitions. [2020-02-10 19:50:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:21,811 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:21,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 19:50:21,811 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 19:50:21,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:21,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1737981946, now seen corresponding path program 940 times [2020-02-10 19:50:21,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:21,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988380657] [2020-02-10 19:50:21,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:22,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988380657] [2020-02-10 19:50:22,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:22,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:22,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518814654] [2020-02-10 19:50:22,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:22,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:22,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:22,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:22,127 INFO L87 Difference]: Start difference. First operand 382 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:50:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:22,250 INFO L93 Difference]: Finished difference Result 547 states and 1632 transitions. [2020-02-10 19:50:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:22,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:22,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:22,252 INFO L225 Difference]: With dead ends: 547 [2020-02-10 19:50:22,252 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:50:22,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 19:50:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:50:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 380. [2020-02-10 19:50:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:50:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1310 transitions. [2020-02-10 19:50:22,261 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1310 transitions. Word has length 22 [2020-02-10 19:50:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:22,261 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1310 transitions. [2020-02-10 19:50:22,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1310 transitions. [2020-02-10 19:50:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:22,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:22,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 19:50:22,262 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 19:50:22,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:22,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1561065670, now seen corresponding path program 941 times [2020-02-10 19:50:22,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:22,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987591520] [2020-02-10 19:50:22,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:22,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987591520] [2020-02-10 19:50:22,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:22,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:22,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944313456] [2020-02-10 19:50:22,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:22,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:22,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:22,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:22,594 INFO L87 Difference]: Start difference. First operand 380 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:50:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:22,672 INFO L93 Difference]: Finished difference Result 543 states and 1624 transitions. [2020-02-10 19:50:22,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:22,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:22,673 INFO L225 Difference]: With dead ends: 543 [2020-02-10 19:50:22,674 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 19:50:22,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 19:50:22,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 19:50:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 381. [2020-02-10 19:50:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1311 transitions. [2020-02-10 19:50:22,684 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1311 transitions. Word has length 22 [2020-02-10 19:50:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:22,684 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1311 transitions. [2020-02-10 19:50:22,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1311 transitions. [2020-02-10 19:50:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:22,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:22,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 19:50:22,685 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 19:50:22,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:22,685 INFO L82 PathProgramCache]: Analyzing trace with hash 49875288, now seen corresponding path program 942 times [2020-02-10 19:50:22,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:22,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327743546] [2020-02-10 19:50:22,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:23,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 19:50:23,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327743546] [2020-02-10 19:50:23,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:23,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:23,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150773970] [2020-02-10 19:50:23,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:23,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:23,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:23,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:23,003 INFO L87 Difference]: Start difference. First operand 381 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:50:23,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:23,117 INFO L93 Difference]: Finished difference Result 544 states and 1625 transitions. [2020-02-10 19:50:23,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:23,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:23,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:23,119 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:50:23,119 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 19:50:23,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 19:50:23,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 19:50:23,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 379. [2020-02-10 19:50:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:50:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1308 transitions. [2020-02-10 19:50:23,129 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1308 transitions. Word has length 22 [2020-02-10 19:50:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:23,130 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1308 transitions. [2020-02-10 19:50:23,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1308 transitions. [2020-02-10 19:50:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:23,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:23,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 19:50:23,130 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 19:50:23,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:23,131 INFO L82 PathProgramCache]: Analyzing trace with hash 119057172, now seen corresponding path program 943 times [2020-02-10 19:50:23,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:23,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061839551] [2020-02-10 19:50:23,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:23,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 19:50:23,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061839551] [2020-02-10 19:50:23,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:23,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:23,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400992702] [2020-02-10 19:50:23,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:23,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:23,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:23,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:23,441 INFO L87 Difference]: Start difference. First operand 379 states and 1308 transitions. Second operand 9 states. [2020-02-10 19:50:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:23,548 INFO L93 Difference]: Finished difference Result 548 states and 1636 transitions. [2020-02-10 19:50:23,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:23,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:23,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:23,550 INFO L225 Difference]: With dead ends: 548 [2020-02-10 19:50:23,550 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:50:23,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 19:50:23,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:50:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 381. [2020-02-10 19:50:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1312 transitions. [2020-02-10 19:50:23,560 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1312 transitions. Word has length 22 [2020-02-10 19:50:23,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:23,560 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1312 transitions. [2020-02-10 19:50:23,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1312 transitions. [2020-02-10 19:50:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:23,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:23,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 19:50:23,561 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 19:50:23,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:23,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1326459838, now seen corresponding path program 944 times [2020-02-10 19:50:23,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:23,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078227334] [2020-02-10 19:50:23,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:23,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 19:50:23,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078227334] [2020-02-10 19:50:23,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:23,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:23,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384164676] [2020-02-10 19:50:23,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:23,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:23,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:23,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:23,877 INFO L87 Difference]: Start difference. First operand 381 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:50:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:23,973 INFO L93 Difference]: Finished difference Result 546 states and 1631 transitions. [2020-02-10 19:50:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:23,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:23,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:23,975 INFO L225 Difference]: With dead ends: 546 [2020-02-10 19:50:23,975 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 19:50:23,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:23,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 19:50:23,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 380. [2020-02-10 19:50:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:50:23,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1310 transitions. [2020-02-10 19:50:23,991 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1310 transitions. Word has length 22 [2020-02-10 19:50:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:23,992 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1310 transitions. [2020-02-10 19:50:23,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1310 transitions. [2020-02-10 19:50:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:23,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:23,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 19:50:23,992 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 19:50:23,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:23,993 INFO L82 PathProgramCache]: Analyzing trace with hash -468688150, now seen corresponding path program 945 times [2020-02-10 19:50:23,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:23,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967524703] [2020-02-10 19:50:23,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:24,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 19:50:24,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967524703] [2020-02-10 19:50:24,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:24,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:24,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783172055] [2020-02-10 19:50:24,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:24,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:24,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:24,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:24,296 INFO L87 Difference]: Start difference. First operand 380 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:50:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:24,411 INFO L93 Difference]: Finished difference Result 550 states and 1642 transitions. [2020-02-10 19:50:24,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:24,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:24,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:24,413 INFO L225 Difference]: With dead ends: 550 [2020-02-10 19:50:24,413 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 19:50: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 19:50:24,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 19:50:24,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 383. [2020-02-10 19:50:24,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1315 transitions. [2020-02-10 19:50:24,422 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1315 transitions. Word has length 22 [2020-02-10 19:50:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:24,422 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1315 transitions. [2020-02-10 19:50:24,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1315 transitions. [2020-02-10 19:50:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:24,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:24,423 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:24,423 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 19:50:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:24,423 INFO L82 PathProgramCache]: Analyzing trace with hash -166670206, now seen corresponding path program 946 times [2020-02-10 19:50:24,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:24,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835248912] [2020-02-10 19:50:24,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50: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 19:50:24,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835248912] [2020-02-10 19:50:24,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:24,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:24,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726422678] [2020-02-10 19:50:24,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:24,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:24,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:24,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:24,723 INFO L87 Difference]: Start difference. First operand 383 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:50:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:24,842 INFO L93 Difference]: Finished difference Result 542 states and 1633 transitions. [2020-02-10 19:50:24,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:24,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:24,844 INFO L225 Difference]: With dead ends: 542 [2020-02-10 19:50:24,844 INFO L226 Difference]: Without dead ends: 527 [2020-02-10 19:50:24,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 19:50:24,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-02-10 19:50:24,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 380. [2020-02-10 19:50:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:50:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1309 transitions. [2020-02-10 19:50:24,858 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1309 transitions. Word has length 22 [2020-02-10 19:50:24,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:24,858 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1309 transitions. [2020-02-10 19:50:24,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:24,859 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1309 transitions. [2020-02-10 19:50:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:24,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:24,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 19:50:24,859 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 19:50:24,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:24,860 INFO L82 PathProgramCache]: Analyzing trace with hash 780324282, now seen corresponding path program 947 times [2020-02-10 19:50:24,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:24,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583017200] [2020-02-10 19:50:24,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:25,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 19:50:25,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583017200] [2020-02-10 19:50:25,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:25,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:25,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298501629] [2020-02-10 19:50:25,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:25,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:25,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:25,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:25,171 INFO L87 Difference]: Start difference. First operand 380 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:50:25,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:25,260 INFO L93 Difference]: Finished difference Result 546 states and 1631 transitions. [2020-02-10 19:50:25,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:25,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:25,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:25,262 INFO L225 Difference]: With dead ends: 546 [2020-02-10 19:50:25,262 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:50:25,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 19:50:25,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:50:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 381. [2020-02-10 19:50:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-02-10 19:50:25,272 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-02-10 19:50:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:25,272 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-02-10 19:50:25,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-02-10 19:50:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:25,273 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:25,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 19:50:25,273 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 19:50:25,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:25,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1315554084, now seen corresponding path program 948 times [2020-02-10 19:50:25,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:25,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361013776] [2020-02-10 19:50:25,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:25,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 19:50:25,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361013776] [2020-02-10 19:50:25,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:25,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:25,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77647117] [2020-02-10 19:50:25,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:25,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:25,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:25,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:25,578 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:50:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:25,704 INFO L93 Difference]: Finished difference Result 540 states and 1628 transitions. [2020-02-10 19:50:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:25,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:25,706 INFO L225 Difference]: With dead ends: 540 [2020-02-10 19:50:25,706 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 19:50:25,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 19:50:25,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 19:50:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 379. [2020-02-10 19:50:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:50:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1307 transitions. [2020-02-10 19:50:25,715 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1307 transitions. Word has length 22 [2020-02-10 19:50:25,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:25,716 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1307 transitions. [2020-02-10 19:50:25,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1307 transitions. [2020-02-10 19:50:25,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:25,716 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:25,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 19:50:25,716 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 19:50:25,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:25,717 INFO L82 PathProgramCache]: Analyzing trace with hash 444653396, now seen corresponding path program 949 times [2020-02-10 19:50:25,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:25,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811908041] [2020-02-10 19:50:25,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:26,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 19:50:26,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811908041] [2020-02-10 19:50:26,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:26,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:26,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822587951] [2020-02-10 19:50:26,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:26,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:26,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:26,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:26,025 INFO L87 Difference]: Start difference. First operand 379 states and 1307 transitions. Second operand 9 states. [2020-02-10 19:50:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:26,128 INFO L93 Difference]: Finished difference Result 553 states and 1649 transitions. [2020-02-10 19:50:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:26,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:26,130 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:50:26,130 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 19:50:26,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 19:50:26,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 383. [2020-02-10 19:50:26,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1317 transitions. [2020-02-10 19:50:26,140 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1317 transitions. Word has length 22 [2020-02-10 19:50:26,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:26,141 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1317 transitions. [2020-02-10 19:50:26,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1317 transitions. [2020-02-10 19:50:26,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:26,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:26,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 19:50:26,141 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 19:50:26,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:26,142 INFO L82 PathProgramCache]: Analyzing trace with hash 697746148, now seen corresponding path program 950 times [2020-02-10 19:50:26,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:26,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9004491] [2020-02-10 19:50:26,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:26,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 19:50:26,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9004491] [2020-02-10 19:50:26,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:26,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:26,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297216124] [2020-02-10 19:50:26,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:26,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:26,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:26,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:26,453 INFO L87 Difference]: Start difference. First operand 383 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:50:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:26,577 INFO L93 Difference]: Finished difference Result 552 states and 1645 transitions. [2020-02-10 19:50:26,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:26,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:26,579 INFO L225 Difference]: With dead ends: 552 [2020-02-10 19:50:26,579 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 19:50:26,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 19:50:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 19:50:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 381. [2020-02-10 19:50:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1312 transitions. [2020-02-10 19:50:26,588 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1312 transitions. Word has length 22 [2020-02-10 19:50:26,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:26,588 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1312 transitions. [2020-02-10 19:50:26,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1312 transitions. [2020-02-10 19:50:26,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:26,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:26,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 19:50:26,589 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 19:50:26,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:26,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1457345928, now seen corresponding path program 951 times [2020-02-10 19:50:26,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:26,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107352439] [2020-02-10 19:50:26,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:26,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107352439] [2020-02-10 19:50:26,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:26,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:26,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093685680] [2020-02-10 19:50:26,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:26,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:26,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:26,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:26,895 INFO L87 Difference]: Start difference. First operand 381 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:50:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:27,002 INFO L93 Difference]: Finished difference Result 553 states and 1649 transitions. [2020-02-10 19:50:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:27,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:27,004 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:50:27,004 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 19:50:27,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 19:50:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 19:50:27,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 384. [2020-02-10 19:50:27,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-02-10 19:50:27,012 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-02-10 19:50:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:27,012 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-02-10 19:50:27,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-02-10 19:50:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:27,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50: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 19:50:27,013 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 19:50:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1759363872, now seen corresponding path program 952 times [2020-02-10 19:50:27,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:27,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59304664] [2020-02-10 19:50:27,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:27,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 19:50:27,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59304664] [2020-02-10 19:50:27,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:27,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:27,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282738715] [2020-02-10 19:50:27,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:27,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:27,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:27,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:27,321 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:50:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:27,436 INFO L93 Difference]: Finished difference Result 545 states and 1640 transitions. [2020-02-10 19:50:27,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:27,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:27,438 INFO L225 Difference]: With dead ends: 545 [2020-02-10 19:50:27,438 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 19:50:27,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 19:50:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 19:50:27,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 381. [2020-02-10 19:50:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:27,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-02-10 19:50:27,455 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-02-10 19:50:27,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:27,455 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-02-10 19:50:27,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:27,455 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-02-10 19:50:27,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:27,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:27,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 19:50:27,456 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 19:50:27,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:27,456 INFO L82 PathProgramCache]: Analyzing trace with hash 167339396, now seen corresponding path program 953 times [2020-02-10 19:50:27,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:27,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733272704] [2020-02-10 19:50:27,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:27,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733272704] [2020-02-10 19:50:27,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:27,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:27,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799046456] [2020-02-10 19:50:27,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:27,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:27,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:27,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:27,755 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:50:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:27,863 INFO L93 Difference]: Finished difference Result 551 states and 1642 transitions. [2020-02-10 19:50:27,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:27,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:27,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:27,865 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:50:27,865 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:50:27,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:50:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 383. [2020-02-10 19:50:27,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-02-10 19:50:27,875 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-02-10 19:50:27,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:27,875 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-02-10 19:50:27,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:27,875 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-02-10 19:50:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:27,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:27,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 19:50:27,875 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 19:50:27,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:27,876 INFO L82 PathProgramCache]: Analyzing trace with hash -5908296, now seen corresponding path program 954 times [2020-02-10 19:50:27,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:27,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233614259] [2020-02-10 19:50:27,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:28,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 19:50:28,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233614259] [2020-02-10 19:50:28,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:28,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:28,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62768215] [2020-02-10 19:50:28,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:28,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:28,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:28,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:28,176 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:50:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:28,293 INFO L93 Difference]: Finished difference Result 544 states and 1636 transitions. [2020-02-10 19:50:28,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:28,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:28,295 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:50:28,295 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 19:50:28,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 19:50:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 19:50:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 379. [2020-02-10 19:50:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:50:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1306 transitions. [2020-02-10 19:50:28,305 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1306 transitions. Word has length 22 [2020-02-10 19:50:28,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:28,305 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1306 transitions. [2020-02-10 19:50:28,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1306 transitions. [2020-02-10 19:50:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:28,306 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:28,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 19:50:28,306 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 19:50:28,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:28,306 INFO L82 PathProgramCache]: Analyzing trace with hash -675267390, now seen corresponding path program 955 times [2020-02-10 19:50:28,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:28,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849840508] [2020-02-10 19:50:28,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:28,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849840508] [2020-02-10 19:50:28,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:28,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:28,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491883895] [2020-02-10 19:50:28,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:28,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:28,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:28,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:28,631 INFO L87 Difference]: Start difference. First operand 379 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:50:28,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:28,729 INFO L93 Difference]: Finished difference Result 543 states and 1623 transitions. [2020-02-10 19:50:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:28,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:28,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:28,731 INFO L225 Difference]: With dead ends: 543 [2020-02-10 19:50:28,731 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 19:50:28,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 19:50:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 19:50:28,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 381. [2020-02-10 19:50:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-02-10 19:50:28,740 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-02-10 19:50:28,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:28,740 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-02-10 19:50:28,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-02-10 19:50:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:28,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:28,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 19:50:28,741 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 19:50:28,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:28,741 INFO L82 PathProgramCache]: Analyzing trace with hash 935673568, now seen corresponding path program 956 times [2020-02-10 19:50:28,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:28,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790424565] [2020-02-10 19:50:28,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:29,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 19:50:29,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790424565] [2020-02-10 19:50:29,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:29,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:29,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904028342] [2020-02-10 19:50:29,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:29,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:29,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:29,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:29,056 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:50:29,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:29,164 INFO L93 Difference]: Finished difference Result 544 states and 1624 transitions. [2020-02-10 19:50:29,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:29,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:29,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:29,166 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:50:29,166 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:50: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 19:50:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:50:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 380. [2020-02-10 19:50:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:50:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1308 transitions. [2020-02-10 19:50:29,175 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1308 transitions. Word has length 22 [2020-02-10 19:50:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:29,176 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1308 transitions. [2020-02-10 19:50:29,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1308 transitions. [2020-02-10 19:50:29,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:29,176 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:29,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 19:50:29,176 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 19:50:29,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:29,177 INFO L82 PathProgramCache]: Analyzing trace with hash 337425142, now seen corresponding path program 957 times [2020-02-10 19:50:29,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:29,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012708782] [2020-02-10 19:50:29,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:29,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 19:50:29,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012708782] [2020-02-10 19:50:29,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:29,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:29,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372702851] [2020-02-10 19:50:29,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:29,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:29,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:29,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:29,497 INFO L87 Difference]: Start difference. First operand 380 states and 1308 transitions. Second operand 9 states. [2020-02-10 19:50:29,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:29,575 INFO L93 Difference]: Finished difference Result 544 states and 1625 transitions. [2020-02-10 19:50:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:29,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:29,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:29,577 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:50:29,577 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:50:29,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:50:29,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 381. [2020-02-10 19:50:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1309 transitions. [2020-02-10 19:50:29,587 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1309 transitions. Word has length 22 [2020-02-10 19:50:29,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:29,587 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1309 transitions. [2020-02-10 19:50:29,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1309 transitions. [2020-02-10 19:50:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:29,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:29,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 19:50:29,588 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 19:50:29,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:29,588 INFO L82 PathProgramCache]: Analyzing trace with hash 872654944, now seen corresponding path program 958 times [2020-02-10 19:50:29,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:29,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686515976] [2020-02-10 19:50:29,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:29,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 19:50:29,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686515976] [2020-02-10 19:50:29,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:29,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:29,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456109346] [2020-02-10 19:50:29,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:29,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:29,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:29,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:29,891 INFO L87 Difference]: Start difference. First operand 381 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:50:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:30,014 INFO L93 Difference]: Finished difference Result 538 states and 1622 transitions. [2020-02-10 19:50:30,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:30,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:30,015 INFO L225 Difference]: With dead ends: 538 [2020-02-10 19:50:30,015 INFO L226 Difference]: Without dead ends: 525 [2020-02-10 19:50:30,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 19:50:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-02-10 19:50:30,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 380. [2020-02-10 19:50:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:50:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1307 transitions. [2020-02-10 19:50:30,024 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1307 transitions. Word has length 22 [2020-02-10 19:50:30,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:30,024 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1307 transitions. [2020-02-10 19:50:30,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1307 transitions. [2020-02-10 19:50:30,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:30,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:30,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 19:50:30,025 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 19:50:30,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:30,025 INFO L82 PathProgramCache]: Analyzing trace with hash 347928246, now seen corresponding path program 959 times [2020-02-10 19:50:30,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:30,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783843214] [2020-02-10 19:50:30,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:30,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 19:50:30,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783843214] [2020-02-10 19:50:30,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:30,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:30,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344421983] [2020-02-10 19:50:30,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:30,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:30,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:30,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:30,322 INFO L87 Difference]: Start difference. First operand 380 states and 1307 transitions. Second operand 9 states. [2020-02-10 19:50:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:30,446 INFO L93 Difference]: Finished difference Result 546 states and 1629 transitions. [2020-02-10 19:50:30,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:30,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:30,448 INFO L225 Difference]: With dead ends: 546 [2020-02-10 19:50:30,448 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 19:50:30,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 19:50:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 19:50:30,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 382. [2020-02-10 19:50:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:50:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-02-10 19:50:30,458 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-02-10 19:50:30,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:30,458 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-02-10 19:50:30,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-02-10 19:50:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:30,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:30,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 19:50:30,459 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 19:50:30,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:30,459 INFO L82 PathProgramCache]: Analyzing trace with hash -727782910, now seen corresponding path program 960 times [2020-02-10 19:50:30,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:30,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547018280] [2020-02-10 19:50:30,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:30,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 19:50:30,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547018280] [2020-02-10 19:50:30,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:30,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:30,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814830025] [2020-02-10 19:50:30,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:30,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:30,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:30,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:30,754 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:50:30,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:30,869 INFO L93 Difference]: Finished difference Result 539 states and 1623 transitions. [2020-02-10 19:50:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:30,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:30,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:30,871 INFO L225 Difference]: With dead ends: 539 [2020-02-10 19:50:30,871 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 19:50:30,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 19:50:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 19:50:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 376. [2020-02-10 19:50:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:50:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1301 transitions. [2020-02-10 19:50:30,881 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1301 transitions. Word has length 22 [2020-02-10 19:50:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:30,881 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1301 transitions. [2020-02-10 19:50:30,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1301 transitions. [2020-02-10 19:50:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:30,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:30,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 19:50:30,882 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 19:50:30,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:30,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1280120566, now seen corresponding path program 961 times [2020-02-10 19:50:30,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:30,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558037772] [2020-02-10 19:50:30,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:31,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 19:50:31,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558037772] [2020-02-10 19:50:31,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:31,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:31,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899301373] [2020-02-10 19:50:31,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:31,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:31,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:31,173 INFO L87 Difference]: Start difference. First operand 376 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:50:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:31,267 INFO L93 Difference]: Finished difference Result 620 states and 1820 transitions. [2020-02-10 19:50:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:31,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:31,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:31,269 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:50:31,269 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 19:50:31,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 19:50:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 19:50:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 388. [2020-02-10 19:50:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:50:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-02-10 19:50:31,278 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-02-10 19:50:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:31,278 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-02-10 19:50:31,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-02-10 19:50:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:31,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:31,279 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:31,279 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 19:50:31,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:31,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1424580844, now seen corresponding path program 962 times [2020-02-10 19:50:31,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:31,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245649055] [2020-02-10 19:50:31,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:31,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 19:50:31,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245649055] [2020-02-10 19:50:31,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:31,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:31,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542070558] [2020-02-10 19:50:31,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:31,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:31,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:31,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:31,580 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:50:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:31,687 INFO L93 Difference]: Finished difference Result 615 states and 1807 transitions. [2020-02-10 19:50:31,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:31,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:31,689 INFO L225 Difference]: With dead ends: 615 [2020-02-10 19:50:31,689 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:50:31,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:31,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:50:31,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 384. [2020-02-10 19:50:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1330 transitions. [2020-02-10 19:50:31,699 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1330 transitions. Word has length 22 [2020-02-10 19:50:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:31,700 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1330 transitions. [2020-02-10 19:50:31,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1330 transitions. [2020-02-10 19:50:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:31,700 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:31,700 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:31,700 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 19:50:31,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:31,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1662296410, now seen corresponding path program 963 times [2020-02-10 19:50:31,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:31,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270107634] [2020-02-10 19:50:31,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:31,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270107634] [2020-02-10 19:50:31,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:31,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:31,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114478847] [2020-02-10 19:50:31,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:31,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:31,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:31,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:31,980 INFO L87 Difference]: Start difference. First operand 384 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:50:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:32,067 INFO L93 Difference]: Finished difference Result 616 states and 1808 transitions. [2020-02-10 19:50:32,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:32,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:32,069 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:50:32,069 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:50:32,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 19:50:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:50:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 386. [2020-02-10 19:50:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:50:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1332 transitions. [2020-02-10 19:50:32,079 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1332 transitions. Word has length 22 [2020-02-10 19:50:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:32,080 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1332 transitions. [2020-02-10 19:50:32,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1332 transitions. [2020-02-10 19:50:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:32,080 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:32,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 19:50:32,080 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 19:50:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:32,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1101227918, now seen corresponding path program 964 times [2020-02-10 19:50:32,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:32,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53835642] [2020-02-10 19:50:32,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:32,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 19:50:32,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53835642] [2020-02-10 19:50:32,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:32,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:32,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453581889] [2020-02-10 19:50:32,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:32,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:32,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:32,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:32,368 INFO L87 Difference]: Start difference. First operand 386 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:50:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:32,470 INFO L93 Difference]: Finished difference Result 609 states and 1793 transitions. [2020-02-10 19:50:32,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:32,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:32,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:32,472 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:50:32,472 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:50:32,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 19:50:32,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:50:32,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 384. [2020-02-10 19:50:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1328 transitions. [2020-02-10 19:50:32,490 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1328 transitions. Word has length 22 [2020-02-10 19:50:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:32,491 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1328 transitions. [2020-02-10 19:50:32,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1328 transitions. [2020-02-10 19:50:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:32,491 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:32,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 19:50:32,491 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 19:50:32,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:32,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1438380680, now seen corresponding path program 965 times [2020-02-10 19:50:32,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:32,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815486165] [2020-02-10 19:50:32,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:32,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 19:50:32,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815486165] [2020-02-10 19:50:32,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:32,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:32,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195466720] [2020-02-10 19:50:32,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:32,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:32,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:32,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:32,785 INFO L87 Difference]: Start difference. First operand 384 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:50:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:32,904 INFO L93 Difference]: Finished difference Result 605 states and 1786 transitions. [2020-02-10 19:50:32,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:32,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:32,905 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:50:32,905 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:50:32,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:32,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:50:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 385. [2020-02-10 19:50:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:50:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1329 transitions. [2020-02-10 19:50:32,915 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1329 transitions. Word has length 22 [2020-02-10 19:50:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:32,916 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1329 transitions. [2020-02-10 19:50:32,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1329 transitions. [2020-02-10 19:50:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:32,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:32,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 19:50:32,916 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 19:50:32,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:32,917 INFO L82 PathProgramCache]: Analyzing trace with hash -7136330, now seen corresponding path program 966 times [2020-02-10 19:50:32,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:32,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209696257] [2020-02-10 19:50:32,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:33,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 19:50:33,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209696257] [2020-02-10 19:50:33,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:33,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:33,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713190515] [2020-02-10 19:50:33,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:33,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:33,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:33,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:33,209 INFO L87 Difference]: Start difference. First operand 385 states and 1329 transitions. Second operand 9 states. [2020-02-10 19:50:33,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:33,292 INFO L93 Difference]: Finished difference Result 603 states and 1781 transitions. [2020-02-10 19:50:33,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:33,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:33,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:33,294 INFO L225 Difference]: With dead ends: 603 [2020-02-10 19:50:33,294 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:50:33,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 19:50:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:50:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 382. [2020-02-10 19:50:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:50:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1324 transitions. [2020-02-10 19:50:33,303 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1324 transitions. Word has length 22 [2020-02-10 19:50:33,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:33,304 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1324 transitions. [2020-02-10 19:50:33,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1324 transitions. [2020-02-10 19:50:33,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:33,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:33,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 19:50:33,304 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 19:50:33,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:33,305 INFO L82 PathProgramCache]: Analyzing trace with hash -479932374, now seen corresponding path program 967 times [2020-02-10 19:50:33,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:33,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355498746] [2020-02-10 19:50:33,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:33,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 19:50:33,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355498746] [2020-02-10 19:50:33,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:33,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:33,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323917314] [2020-02-10 19:50:33,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:33,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:33,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:33,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:33,607 INFO L87 Difference]: Start difference. First operand 382 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:50:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:33,699 INFO L93 Difference]: Finished difference Result 636 states and 1860 transitions. [2020-02-10 19:50:33,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:33,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:33,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:33,701 INFO L225 Difference]: With dead ends: 636 [2020-02-10 19:50:33,701 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 19:50:33,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 19:50:33,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 391. [2020-02-10 19:50:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:50:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1346 transitions. [2020-02-10 19:50:33,711 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1346 transitions. Word has length 22 [2020-02-10 19:50:33,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:33,711 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1346 transitions. [2020-02-10 19:50:33,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:33,711 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1346 transitions. [2020-02-10 19:50:33,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:33,711 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:33,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 19:50:33,712 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 19:50:33,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:33,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1110333512, now seen corresponding path program 968 times [2020-02-10 19:50:33,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:33,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002903284] [2020-02-10 19:50:33,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:34,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 19:50:34,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002903284] [2020-02-10 19:50:34,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:34,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:34,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846132323] [2020-02-10 19:50:34,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:34,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:34,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:34,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:34,006 INFO L87 Difference]: Start difference. First operand 391 states and 1346 transitions. Second operand 9 states. [2020-02-10 19:50:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:34,119 INFO L93 Difference]: Finished difference Result 631 states and 1847 transitions. [2020-02-10 19:50:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:34,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:34,121 INFO L225 Difference]: With dead ends: 631 [2020-02-10 19:50:34,121 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:50: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 19:50:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:50:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 387. [2020-02-10 19:50:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:50:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-02-10 19:50:34,132 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-02-10 19:50:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:34,132 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-02-10 19:50:34,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-02-10 19:50:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:34,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:34,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 19:50:34,133 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 19:50:34,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:34,133 INFO L82 PathProgramCache]: Analyzing trace with hash -214881510, now seen corresponding path program 969 times [2020-02-10 19:50:34,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:34,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233025516] [2020-02-10 19:50:34,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:34,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233025516] [2020-02-10 19:50:34,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:34,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:34,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609370157] [2020-02-10 19:50:34,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:34,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:34,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:34,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:34,444 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:50:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:34,528 INFO L93 Difference]: Finished difference Result 643 states and 1872 transitions. [2020-02-10 19:50:34,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:34,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:34,529 INFO L225 Difference]: With dead ends: 643 [2020-02-10 19:50:34,530 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 19:50:34,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 19:50:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 19:50:34,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 395. [2020-02-10 19:50:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:50:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1349 transitions. [2020-02-10 19:50:34,539 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1349 transitions. Word has length 22 [2020-02-10 19:50:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:34,539 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1349 transitions. [2020-02-10 19:50:34,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1349 transitions. [2020-02-10 19:50:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:34,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:34,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 19:50:34,540 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 19:50:34,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:34,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1712453060, now seen corresponding path program 970 times [2020-02-10 19:50:34,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:34,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80897995] [2020-02-10 19:50:34,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:34,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 19:50:34,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80897995] [2020-02-10 19:50:34,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:34,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:34,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121940705] [2020-02-10 19:50:34,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:34,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:34,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:34,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:34,854 INFO L87 Difference]: Start difference. First operand 395 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:50:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:34,988 INFO L93 Difference]: Finished difference Result 641 states and 1862 transitions. [2020-02-10 19:50:34,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:34,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:34,990 INFO L225 Difference]: With dead ends: 641 [2020-02-10 19:50:34,990 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 19:50:34,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 19:50:34,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 19:50:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 387. [2020-02-10 19:50:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:50:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1331 transitions. [2020-02-10 19:50:34,999 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1331 transitions. Word has length 22 [2020-02-10 19:50:34,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:34,999 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1331 transitions. [2020-02-10 19:50:34,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1331 transitions. [2020-02-10 19:50:35,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:35,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:35,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 19:50:35,000 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 19:50:35,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:35,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1430177924, now seen corresponding path program 971 times [2020-02-10 19:50:35,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:35,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047850035] [2020-02-10 19:50:35,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:35,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 19:50:35,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047850035] [2020-02-10 19:50:35,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:35,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:35,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659477286] [2020-02-10 19:50:35,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:35,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:35,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:35,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:35,301 INFO L87 Difference]: Start difference. First operand 387 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:50:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:35,418 INFO L93 Difference]: Finished difference Result 628 states and 1837 transitions. [2020-02-10 19:50:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:35,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:35,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:35,420 INFO L225 Difference]: With dead ends: 628 [2020-02-10 19:50:35,420 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:50:35,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 19:50:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:50:35,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 390. [2020-02-10 19:50:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:50:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1336 transitions. [2020-02-10 19:50:35,430 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1336 transitions. Word has length 22 [2020-02-10 19:50:35,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:35,430 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1336 transitions. [2020-02-10 19:50:35,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:35,430 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1336 transitions. [2020-02-10 19:50:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:35,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:35,431 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:35,431 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 19:50:35,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:35,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1411743898, now seen corresponding path program 972 times [2020-02-10 19:50:35,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:35,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465140067] [2020-02-10 19:50:35,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:35,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 19:50:35,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465140067] [2020-02-10 19:50:35,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:35,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:35,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553191281] [2020-02-10 19:50:35,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:35,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:35,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:35,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:35,725 INFO L87 Difference]: Start difference. First operand 390 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:50:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:35,837 INFO L93 Difference]: Finished difference Result 631 states and 1840 transitions. [2020-02-10 19:50:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:35,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:35,839 INFO L225 Difference]: With dead ends: 631 [2020-02-10 19:50:35,839 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 19:50:35,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 19:50:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 19:50:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 382. [2020-02-10 19:50:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:50:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-02-10 19:50:35,859 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-02-10 19:50:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:35,859 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-02-10 19:50:35,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-02-10 19:50:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:35,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:35,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 19:50:35,860 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 19:50:35,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:35,860 INFO L82 PathProgramCache]: Analyzing trace with hash 679179110, now seen corresponding path program 973 times [2020-02-10 19:50:35,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:35,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776180741] [2020-02-10 19:50:35,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:36,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 19:50:36,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776180741] [2020-02-10 19:50:36,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:36,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:36,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631721853] [2020-02-10 19:50:36,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:36,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:36,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:36,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:36,147 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:50:36,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:36,229 INFO L93 Difference]: Finished difference Result 624 states and 1823 transitions. [2020-02-10 19:50:36,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:36,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:36,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:36,231 INFO L225 Difference]: With dead ends: 624 [2020-02-10 19:50:36,231 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 19:50:36,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 19:50:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 19:50:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 387. [2020-02-10 19:50:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:50:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1331 transitions. [2020-02-10 19:50:36,240 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1331 transitions. Word has length 22 [2020-02-10 19:50:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:36,240 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1331 transitions. [2020-02-10 19:50:36,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:36,240 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1331 transitions. [2020-02-10 19:50:36,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:36,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:36,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 19:50:36,241 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 19:50:36,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:36,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1240247602, now seen corresponding path program 974 times [2020-02-10 19:50:36,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:36,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106009349] [2020-02-10 19:50:36,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:36,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 19:50:36,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106009349] [2020-02-10 19:50:36,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:36,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:36,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895162834] [2020-02-10 19:50:36,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:36,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:36,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:36,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:36,525 INFO L87 Difference]: Start difference. First operand 387 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:50:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:36,608 INFO L93 Difference]: Finished difference Result 617 states and 1808 transitions. [2020-02-10 19:50:36,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:36,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:36,610 INFO L225 Difference]: With dead ends: 617 [2020-02-10 19:50:36,610 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:50:36,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 19:50:36,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:50:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 385. [2020-02-10 19:50:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:50:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1327 transitions. [2020-02-10 19:50:36,621 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1327 transitions. Word has length 22 [2020-02-10 19:50:36,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:36,621 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1327 transitions. [2020-02-10 19:50:36,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:36,621 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1327 transitions. [2020-02-10 19:50:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:36,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:36,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:36,622 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 19:50:36,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:36,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1691871642, now seen corresponding path program 975 times [2020-02-10 19:50:36,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:36,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384821230] [2020-02-10 19:50:36,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:36,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 19:50:36,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384821230] [2020-02-10 19:50:36,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:36,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:36,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662847861] [2020-02-10 19:50:36,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:36,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:36,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:36,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:36,917 INFO L87 Difference]: Start difference. First operand 385 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:50:37,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:37,018 INFO L93 Difference]: Finished difference Result 635 states and 1847 transitions. [2020-02-10 19:50:37,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:37,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:37,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:37,019 INFO L225 Difference]: With dead ends: 635 [2020-02-10 19:50:37,019 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 19:50:37,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 19:50:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 19:50:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 393. [2020-02-10 19:50:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:50:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1340 transitions. [2020-02-10 19:50:37,029 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1340 transitions. Word has length 22 [2020-02-10 19:50:37,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:37,029 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1340 transitions. [2020-02-10 19:50:37,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1340 transitions. [2020-02-10 19:50:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:37,030 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:37,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 19:50:37,030 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 19:50:37,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:37,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1561901196, now seen corresponding path program 976 times [2020-02-10 19:50:37,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:37,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834468868] [2020-02-10 19:50:37,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:37,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 19:50:37,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834468868] [2020-02-10 19:50:37,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:37,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:37,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327101538] [2020-02-10 19:50:37,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:37,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:37,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:37,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:37,322 INFO L87 Difference]: Start difference. First operand 393 states and 1340 transitions. Second operand 9 states. [2020-02-10 19:50:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:37,440 INFO L93 Difference]: Finished difference Result 633 states and 1837 transitions. [2020-02-10 19:50:37,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:37,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:37,442 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:50:37,442 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 19:50:37,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 19:50:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 19:50:37,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 385. [2020-02-10 19:50:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:50:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-02-10 19:50:37,453 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-02-10 19:50:37,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:37,453 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-02-10 19:50:37,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-02-10 19:50:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:37,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:37,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 19:50:37,453 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 19:50:37,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:37,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1746593868, now seen corresponding path program 977 times [2020-02-10 19:50:37,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:37,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435802800] [2020-02-10 19:50:37,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:37,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 19:50:37,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435802800] [2020-02-10 19:50:37,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:37,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:37,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006110730] [2020-02-10 19:50:37,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:37,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:37,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:37,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:37,742 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:50:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:37,854 INFO L93 Difference]: Finished difference Result 614 states and 1800 transitions. [2020-02-10 19:50:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:37,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:37,856 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:50:37,856 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 19:50:37,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:37,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 19:50:37,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 386. [2020-02-10 19:50:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:50:37,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-02-10 19:50:37,866 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-02-10 19:50:37,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:37,866 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-02-10 19:50:37,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-02-10 19:50:37,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:37,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:37,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 19:50:37,867 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 19:50:37,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:37,867 INFO L82 PathProgramCache]: Analyzing trace with hash 670882712, now seen corresponding path program 978 times [2020-02-10 19:50:37,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:37,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537921485] [2020-02-10 19:50:37,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:38,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 19:50:38,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537921485] [2020-02-10 19:50:38,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:38,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:38,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239273673] [2020-02-10 19:50:38,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:38,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:38,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:38,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:38,145 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:50:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:38,278 INFO L93 Difference]: Finished difference Result 619 states and 1809 transitions. [2020-02-10 19:50:38,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:38,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:38,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:38,280 INFO L225 Difference]: With dead ends: 619 [2020-02-10 19:50:38,280 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 19:50:38,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 19:50:38,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 19:50:38,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 382. [2020-02-10 19:50:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:50:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1318 transitions. [2020-02-10 19:50:38,290 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1318 transitions. Word has length 22 [2020-02-10 19:50:38,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:38,290 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1318 transitions. [2020-02-10 19:50:38,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1318 transitions. [2020-02-10 19:50:38,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:38,290 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:38,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 19:50:38,291 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 19:50:38,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:38,291 INFO L82 PathProgramCache]: Analyzing trace with hash -958010236, now seen corresponding path program 979 times [2020-02-10 19:50:38,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:38,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998579052] [2020-02-10 19:50:38,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:38,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 19:50:38,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998579052] [2020-02-10 19:50:38,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:38,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:38,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409198510] [2020-02-10 19:50:38,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:38,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:38,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:38,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:38,581 INFO L87 Difference]: Start difference. First operand 382 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:50:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:38,709 INFO L93 Difference]: Finished difference Result 600 states and 1772 transitions. [2020-02-10 19:50:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:38,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:38,710 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:50:38,711 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 19:50:38,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 19:50:38,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 384. [2020-02-10 19:50:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1322 transitions. [2020-02-10 19:50:38,720 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1322 transitions. Word has length 22 [2020-02-10 19:50:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:38,721 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1322 transitions. [2020-02-10 19:50:38,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1322 transitions. [2020-02-10 19:50:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:38,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:38,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:38,721 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 19:50:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:38,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1891440050, now seen corresponding path program 980 times [2020-02-10 19:50:38,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:38,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233218727] [2020-02-10 19:50:38,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:39,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 19:50:39,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233218727] [2020-02-10 19:50:39,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:39,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:39,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857842785] [2020-02-10 19:50:39,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:39,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:39,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:39,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:39,021 INFO L87 Difference]: Start difference. First operand 384 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:50:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:39,117 INFO L93 Difference]: Finished difference Result 598 states and 1767 transitions. [2020-02-10 19:50:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:39,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:39,119 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:50:39,119 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:50:39,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:50:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 383. [2020-02-10 19:50:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-02-10 19:50:39,130 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-02-10 19:50:39,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:39,130 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-02-10 19:50:39,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:39,130 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-02-10 19:50:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:39,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:39,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 19:50:39,131 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 19:50:39,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:39,131 INFO L82 PathProgramCache]: Analyzing trace with hash 54682296, now seen corresponding path program 981 times [2020-02-10 19:50:39,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:39,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543439681] [2020-02-10 19:50:39,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:39,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 19:50:39,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543439681] [2020-02-10 19:50:39,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:39,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:39,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997292333] [2020-02-10 19:50:39,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:39,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:39,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:39,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:39,463 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:50:39,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:39,594 INFO L93 Difference]: Finished difference Result 607 states and 1787 transitions. [2020-02-10 19:50:39,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:39,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:39,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:39,596 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:50:39,596 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:50:39,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 19:50:39,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:50:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 386. [2020-02-10 19:50:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:50:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-02-10 19:50:39,606 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-02-10 19:50:39,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:39,606 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-02-10 19:50:39,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-02-10 19:50:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:39,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:39,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 19:50:39,607 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 19:50:39,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:39,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1440717426, now seen corresponding path program 982 times [2020-02-10 19:50:39,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:39,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139999449] [2020-02-10 19:50:39,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:39,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 19:50:39,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139999449] [2020-02-10 19:50:39,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:39,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:39,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054207060] [2020-02-10 19:50:39,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:39,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:39,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:39,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:39,897 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:50:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:40,024 INFO L93 Difference]: Finished difference Result 610 states and 1790 transitions. [2020-02-10 19:50:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:40,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:40,026 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:50:40,026 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:50:40,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:50:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 383. [2020-02-10 19:50:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1319 transitions. [2020-02-10 19:50:40,036 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1319 transitions. Word has length 22 [2020-02-10 19:50:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:40,036 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1319 transitions. [2020-02-10 19:50:40,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1319 transitions. [2020-02-10 19:50:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:40,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50: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 19:50:40,037 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 19:50:40,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:40,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1303694728, now seen corresponding path program 983 times [2020-02-10 19:50:40,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:40,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533219333] [2020-02-10 19:50:40,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50: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 19:50:40,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533219333] [2020-02-10 19:50:40,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:40,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:40,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996916676] [2020-02-10 19:50:40,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:40,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:40,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:40,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:40,327 INFO L87 Difference]: Start difference. First operand 383 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:50:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:40,417 INFO L93 Difference]: Finished difference Result 601 states and 1772 transitions. [2020-02-10 19:50:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:40,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:40,419 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:50:40,419 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:50:40,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 19:50:40,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:50:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 384. [2020-02-10 19:50:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1320 transitions. [2020-02-10 19:50:40,429 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1320 transitions. Word has length 22 [2020-02-10 19:50:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:40,430 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1320 transitions. [2020-02-10 19:50:40,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1320 transitions. [2020-02-10 19:50:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:40,430 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:40,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 19:50:40,430 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 19:50:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:40,431 INFO L82 PathProgramCache]: Analyzing trace with hash 227983572, now seen corresponding path program 984 times [2020-02-10 19:50:40,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:40,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133453104] [2020-02-10 19:50:40,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:40,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 19:50:40,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133453104] [2020-02-10 19:50:40,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:40,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:40,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871252970] [2020-02-10 19:50:40,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:40,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:40,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:40,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:40,711 INFO L87 Difference]: Start difference. First operand 384 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:50:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:40,841 INFO L93 Difference]: Finished difference Result 606 states and 1781 transitions. [2020-02-10 19:50:40,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:40,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:40,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:40,843 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:50:40,843 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:50:40,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 19:50:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:50:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 379. [2020-02-10 19:50:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:50:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1312 transitions. [2020-02-10 19:50:40,852 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1312 transitions. Word has length 22 [2020-02-10 19:50:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:40,853 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1312 transitions. [2020-02-10 19:50:40,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1312 transitions. [2020-02-10 19:50:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:40,853 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:40,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 19:50:40,853 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 19:50:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1067964948, now seen corresponding path program 985 times [2020-02-10 19:50:40,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:40,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398724516] [2020-02-10 19:50:40,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:41,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 19:50:41,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398724516] [2020-02-10 19:50:41,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:41,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:41,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750635603] [2020-02-10 19:50:41,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:41,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:41,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:41,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:41,138 INFO L87 Difference]: Start difference. First operand 379 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:50:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:41,236 INFO L93 Difference]: Finished difference Result 610 states and 1793 transitions. [2020-02-10 19:50:41,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:41,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:41,238 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:50:41,238 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:50:41,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 19:50:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:50:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 387. [2020-02-10 19:50:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:50:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1332 transitions. [2020-02-10 19:50:41,248 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1332 transitions. Word has length 22 [2020-02-10 19:50:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:41,248 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1332 transitions. [2020-02-10 19:50:41,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1332 transitions. [2020-02-10 19:50:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:41,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:41,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 19:50:41,249 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 19:50:41,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:41,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1636736462, now seen corresponding path program 986 times [2020-02-10 19:50:41,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:41,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044696403] [2020-02-10 19:50:41,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:41,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 19:50:41,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044696403] [2020-02-10 19:50:41,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:41,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:41,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144075296] [2020-02-10 19:50:41,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:41,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:41,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:41,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:41,531 INFO L87 Difference]: Start difference. First operand 387 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:50:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:41,663 INFO L93 Difference]: Finished difference Result 605 states and 1780 transitions. [2020-02-10 19:50:41,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:41,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:41,665 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:50:41,665 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:50:41,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 19:50:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:50:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 383. [2020-02-10 19:50:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-02-10 19:50:41,674 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-02-10 19:50:41,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:41,675 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-02-10 19:50:41,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-02-10 19:50:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:41,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:41,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:41,675 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 19:50:41,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:41,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1874452028, now seen corresponding path program 987 times [2020-02-10 19:50:41,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:41,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948003236] [2020-02-10 19:50:41,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:41,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 19:50:41,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948003236] [2020-02-10 19:50:41,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:41,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:41,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281323097] [2020-02-10 19:50:41,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:41,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:41,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:41,958 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:50:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:42,042 INFO L93 Difference]: Finished difference Result 606 states and 1781 transitions. [2020-02-10 19:50:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:42,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:42,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:42,044 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:50:42,044 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:50:42,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:50:42,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 385. [2020-02-10 19:50:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:50:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1326 transitions. [2020-02-10 19:50:42,054 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1326 transitions. Word has length 22 [2020-02-10 19:50:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:42,054 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1326 transitions. [2020-02-10 19:50:42,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1326 transitions. [2020-02-10 19:50:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:42,055 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:42,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 19:50:42,055 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 19:50:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:42,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1313383536, now seen corresponding path program 988 times [2020-02-10 19:50:42,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:42,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362436723] [2020-02-10 19:50:42,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:42,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362436723] [2020-02-10 19:50:42,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:42,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:42,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574143866] [2020-02-10 19:50:42,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:42,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:42,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:42,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:42,341 INFO L87 Difference]: Start difference. First operand 385 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:50:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:42,440 INFO L93 Difference]: Finished difference Result 599 states and 1766 transitions. [2020-02-10 19:50:42,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:42,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:42,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:42,442 INFO L225 Difference]: With dead ends: 599 [2020-02-10 19:50:42,442 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:50:42,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:42,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:50:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 383. [2020-02-10 19:50:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1322 transitions. [2020-02-10 19:50:42,452 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1322 transitions. Word has length 22 [2020-02-10 19:50:42,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:42,452 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1322 transitions. [2020-02-10 19:50:42,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1322 transitions. [2020-02-10 19:50:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:42,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50: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 19:50:42,453 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 19:50:42,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:42,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1226225062, now seen corresponding path program 989 times [2020-02-10 19:50:42,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:42,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458993887] [2020-02-10 19:50:42,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:42,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 19:50:42,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458993887] [2020-02-10 19:50:42,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:42,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:42,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010492747] [2020-02-10 19:50:42,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:42,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:42,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:42,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:42,735 INFO L87 Difference]: Start difference. First operand 383 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:50:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:42,862 INFO L93 Difference]: Finished difference Result 595 states and 1759 transitions. [2020-02-10 19:50:42,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:42,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:42,864 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:50:42,864 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:50:42,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 19:50:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:50:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-02-10 19:50:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-02-10 19:50:42,874 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-02-10 19:50:42,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:42,874 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-02-10 19:50:42,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-02-10 19:50:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:42,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:42,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 19:50:42,875 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 19:50:42,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:42,875 INFO L82 PathProgramCache]: Analyzing trace with hash -219291948, now seen corresponding path program 990 times [2020-02-10 19:50:42,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:42,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351161404] [2020-02-10 19:50:42,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:43,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 19:50:43,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351161404] [2020-02-10 19:50:43,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:43,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:43,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336224562] [2020-02-10 19:50:43,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:43,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:43,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:43,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:43,161 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:50:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:43,266 INFO L93 Difference]: Finished difference Result 593 states and 1754 transitions. [2020-02-10 19:50:43,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:43,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:43,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:43,268 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:50:43,268 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 19:50:43,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 19:50:43,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 19:50:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 381. [2020-02-10 19:50:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1318 transitions. [2020-02-10 19:50:43,278 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1318 transitions. Word has length 22 [2020-02-10 19:50:43,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:43,278 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1318 transitions. [2020-02-10 19:50:43,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1318 transitions. [2020-02-10 19:50:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:43,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:43,279 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:43,279 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 19:50:43,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:43,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1114573718, now seen corresponding path program 991 times [2020-02-10 19:50:43,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:43,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437761160] [2020-02-10 19:50:43,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:43,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 19:50:43,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437761160] [2020-02-10 19:50:43,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:43,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:43,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404334065] [2020-02-10 19:50:43,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:43,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:43,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:43,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:43,574 INFO L87 Difference]: Start difference. First operand 381 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:50:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:43,660 INFO L93 Difference]: Finished difference Result 616 states and 1810 transitions. [2020-02-10 19:50:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:43,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:43,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:43,662 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:50:43,663 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:50:43,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:50:43,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2020-02-10 19:50:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:50:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-02-10 19:50:43,672 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-02-10 19:50:43,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:43,672 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-02-10 19:50:43,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-02-10 19:50:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:43,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50: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 19:50:43,673 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 19:50:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:43,673 INFO L82 PathProgramCache]: Analyzing trace with hash 475692168, now seen corresponding path program 992 times [2020-02-10 19:50:43,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:43,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041584648] [2020-02-10 19:50:43,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:43,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 19:50:43,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041584648] [2020-02-10 19:50:43,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:43,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:43,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063048432] [2020-02-10 19:50:43,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:43,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:43,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:43,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:43,954 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:50:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:44,070 INFO L93 Difference]: Finished difference Result 611 states and 1797 transitions. [2020-02-10 19:50:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:44,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:44,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:44,072 INFO L225 Difference]: With dead ends: 611 [2020-02-10 19:50:44,072 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:50:44,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:50:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 385. [2020-02-10 19:50:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:50:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1328 transitions. [2020-02-10 19:50:44,082 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1328 transitions. Word has length 22 [2020-02-10 19:50:44,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:44,082 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1328 transitions. [2020-02-10 19:50:44,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1328 transitions. [2020-02-10 19:50:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:44,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:44,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 19:50:44,083 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 19:50:44,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:44,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1831716826, now seen corresponding path program 993 times [2020-02-10 19:50:44,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:44,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135786493] [2020-02-10 19:50:44,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:44,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 19:50:44,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135786493] [2020-02-10 19:50:44,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:44,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:44,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862212456] [2020-02-10 19:50:44,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:44,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:44,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:44,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:44,373 INFO L87 Difference]: Start difference. First operand 385 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:50:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:44,477 INFO L93 Difference]: Finished difference Result 610 states and 1797 transitions. [2020-02-10 19:50:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:44,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:44,478 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:50:44,478 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:50:44,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 19:50:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:50:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 390. [2020-02-10 19:50:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:50:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1336 transitions. [2020-02-10 19:50:44,487 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1336 transitions. Word has length 22 [2020-02-10 19:50:44,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:44,487 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1336 transitions. [2020-02-10 19:50:44,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1336 transitions. [2020-02-10 19:50:44,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:44,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:44,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 19:50:44,488 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 19:50:44,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:44,488 INFO L82 PathProgramCache]: Analyzing trace with hash 130388924, now seen corresponding path program 994 times [2020-02-10 19:50:44,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:44,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691507563] [2020-02-10 19:50:44,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:44,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 19:50:44,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691507563] [2020-02-10 19:50:44,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:44,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:44,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890561140] [2020-02-10 19:50:44,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:44,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:44,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:44,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:44,778 INFO L87 Difference]: Start difference. First operand 390 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:50:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:44,904 INFO L93 Difference]: Finished difference Result 597 states and 1777 transitions. [2020-02-10 19:50:44,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:44,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:44,906 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:50:44,906 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:50:44,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 19:50:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:50:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 385. [2020-02-10 19:50:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:50:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-02-10 19:50:44,916 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-02-10 19:50:44,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:44,916 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-02-10 19:50:44,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-02-10 19:50:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:44,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:44,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 19:50:44,917 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 19:50:44,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:44,917 INFO L82 PathProgramCache]: Analyzing trace with hash 616420412, now seen corresponding path program 995 times [2020-02-10 19:50:44,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:44,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825434038] [2020-02-10 19:50:44,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:45,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825434038] [2020-02-10 19:50:45,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:45,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:45,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019893270] [2020-02-10 19:50:45,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:45,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:45,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:45,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:45,214 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:50:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:45,336 INFO L93 Difference]: Finished difference Result 603 states and 1779 transitions. [2020-02-10 19:50:45,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:45,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:45,338 INFO L225 Difference]: With dead ends: 603 [2020-02-10 19:50:45,338 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:50:45,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 19:50:45,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:50:45,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 388. [2020-02-10 19:50:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:50:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1329 transitions. [2020-02-10 19:50:45,347 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1329 transitions. Word has length 22 [2020-02-10 19:50:45,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:45,348 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1329 transitions. [2020-02-10 19:50:45,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1329 transitions. [2020-02-10 19:50:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:45,348 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:45,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 19:50:45,348 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 19:50:45,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:45,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1490161092, now seen corresponding path program 996 times [2020-02-10 19:50:45,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:45,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125239434] [2020-02-10 19:50:45,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:45,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 19:50:45,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125239434] [2020-02-10 19:50:45,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:45,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:45,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036978741] [2020-02-10 19:50:45,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:45,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:45,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:45,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:45,648 INFO L87 Difference]: Start difference. First operand 388 states and 1329 transitions. Second operand 9 states. [2020-02-10 19:50:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:45,771 INFO L93 Difference]: Finished difference Result 595 states and 1770 transitions. [2020-02-10 19:50:45,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:45,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:45,773 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:50:45,773 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:50: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 19:50:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:50:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 381. [2020-02-10 19:50:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1316 transitions. [2020-02-10 19:50:45,783 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1316 transitions. Word has length 22 [2020-02-10 19:50:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:45,783 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1316 transitions. [2020-02-10 19:50:45,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1316 transitions. [2020-02-10 19:50:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:45,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:45,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 19:50:45,784 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 19:50:45,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:45,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1970571844, now seen corresponding path program 997 times [2020-02-10 19:50:45,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:45,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162570379] [2020-02-10 19:50:45,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:46,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162570379] [2020-02-10 19:50:46,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:46,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:46,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351160682] [2020-02-10 19:50:46,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:46,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:46,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:46,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:46,069 INFO L87 Difference]: Start difference. First operand 381 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:50:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:46,151 INFO L93 Difference]: Finished difference Result 606 states and 1780 transitions. [2020-02-10 19:50:46,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:46,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:46,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:46,153 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:50:46,153 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:50:46,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 19:50:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:50:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 385. [2020-02-10 19:50:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:50:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-02-10 19:50:46,163 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-02-10 19:50:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:46,163 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-02-10 19:50:46,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-02-10 19:50:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:46,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:46,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 19:50:46,164 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 19:50:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:46,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1763326960, now seen corresponding path program 998 times [2020-02-10 19:50:46,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:46,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508141016] [2020-02-10 19:50:46,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:46,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 19:50:46,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508141016] [2020-02-10 19:50:46,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:46,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:46,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574558227] [2020-02-10 19:50:46,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:46,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:46,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:46,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:46,443 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:50:46,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:46,536 INFO L93 Difference]: Finished difference Result 599 states and 1765 transitions. [2020-02-10 19:50:46,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:46,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:46,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:46,538 INFO L225 Difference]: With dead ends: 599 [2020-02-10 19:50:46,538 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:50:46,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:46,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:50:46,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 383. [2020-02-10 19:50:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-02-10 19:50:46,547 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-02-10 19:50:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:46,547 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-02-10 19:50:46,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-02-10 19:50:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:46,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:46,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 19:50:46,548 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 19:50:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1382826522, now seen corresponding path program 999 times [2020-02-10 19:50:46,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:46,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085154655] [2020-02-10 19:50:46,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:46,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 19:50:46,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085154655] [2020-02-10 19:50:46,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:46,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:46,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438175550] [2020-02-10 19:50:46,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:46,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:46,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:46,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:46,847 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:50:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:46,939 INFO L93 Difference]: Finished difference Result 604 states and 1779 transitions. [2020-02-10 19:50:46,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:46,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:46,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:46,941 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:50:46,941 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:50:46,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 19:50:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:50:46,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 388. [2020-02-10 19:50:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:50:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1328 transitions. [2020-02-10 19:50:46,951 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1328 transitions. Word has length 22 [2020-02-10 19:50:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:46,951 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1328 transitions. [2020-02-10 19:50:46,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1328 transitions. [2020-02-10 19:50:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:46,952 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:46,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 19:50:46,952 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 19:50:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:46,952 INFO L82 PathProgramCache]: Analyzing trace with hash -890224116, now seen corresponding path program 1000 times [2020-02-10 19:50:46,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:46,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385428080] [2020-02-10 19:50:46,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:47,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 19:50:47,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385428080] [2020-02-10 19:50:47,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:47,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:47,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917546335] [2020-02-10 19:50:47,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:47,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:47,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:47,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:47,239 INFO L87 Difference]: Start difference. First operand 388 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:50:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:47,362 INFO L93 Difference]: Finished difference Result 591 states and 1759 transitions. [2020-02-10 19:50:47,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:47,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:47,364 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:50:47,364 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:50:47,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 19:50:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:50:47,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 383. [2020-02-10 19:50:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 19:50:47,375 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 19:50:47,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:47,375 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 19:50:47,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 19:50:47,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:47,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:47,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 19:50:47,376 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 19:50:47,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:47,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1437548748, now seen corresponding path program 1001 times [2020-02-10 19:50:47,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:47,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814010818] [2020-02-10 19:50:47,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:47,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 19:50:47,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814010818] [2020-02-10 19:50:47,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:47,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:47,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498617133] [2020-02-10 19:50:47,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:47,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:47,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:47,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:47,659 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:50:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:47,744 INFO L93 Difference]: Finished difference Result 593 states and 1753 transitions. [2020-02-10 19:50:47,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:47,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:47,746 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:50:47,746 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:50:47,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:47,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:50:47,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-02-10 19:50:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:47,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-02-10 19:50:47,760 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-02-10 19:50:47,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:47,761 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-02-10 19:50:47,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-02-10 19:50:47,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:47,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:47,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 19:50:47,761 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 19:50:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:47,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1972778550, now seen corresponding path program 1002 times [2020-02-10 19:50:47,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:47,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092325650] [2020-02-10 19:50:47,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:48,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 19:50:48,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092325650] [2020-02-10 19:50:48,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:48,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:48,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688771760] [2020-02-10 19:50:48,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:48,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:48,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:48,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:48,035 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:50:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:48,156 INFO L93 Difference]: Finished difference Result 587 states and 1750 transitions. [2020-02-10 19:50:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:48,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:48,158 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:50:48,158 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:50:48,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 19:50:48,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:50:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 381. [2020-02-10 19:50:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:50:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1314 transitions. [2020-02-10 19:50:48,167 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1314 transitions. Word has length 22 [2020-02-10 19:50:48,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:48,167 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1314 transitions. [2020-02-10 19:50:48,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:48,167 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1314 transitions. [2020-02-10 19:50:48,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:48,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:48,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 19:50:48,168 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 19:50:48,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:48,168 INFO L82 PathProgramCache]: Analyzing trace with hash 333382498, now seen corresponding path program 1003 times [2020-02-10 19:50:48,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:48,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503923309] [2020-02-10 19:50:48,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:48,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 19:50:48,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503923309] [2020-02-10 19:50:48,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:48,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:48,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826430956] [2020-02-10 19:50:48,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:48,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:48,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:48,460 INFO L87 Difference]: Start difference. First operand 381 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:50:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:48,583 INFO L93 Difference]: Finished difference Result 587 states and 1741 transitions. [2020-02-10 19:50:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:48,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:48,585 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:50:48,585 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:50:48,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 19:50:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:50:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 383. [2020-02-10 19:50:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 19:50:48,595 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 19:50:48,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:48,596 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 19:50:48,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 19:50:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:48,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:48,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 19:50:48,596 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 19:50:48,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:48,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1112134512, now seen corresponding path program 1004 times [2020-02-10 19:50:48,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:48,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659356254] [2020-02-10 19:50:48,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:48,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 19:50:48,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659356254] [2020-02-10 19:50:48,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:48,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:48,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187729432] [2020-02-10 19:50:48,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:48,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:48,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:48,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:48,897 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:50:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:48,982 INFO L93 Difference]: Finished difference Result 585 states and 1736 transitions. [2020-02-10 19:50:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:48,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:48,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:48,984 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:50:48,984 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:50:48,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 19:50:48,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:50:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 382. [2020-02-10 19:50:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:50:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1316 transitions. [2020-02-10 19:50:48,993 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1316 transitions. Word has length 22 [2020-02-10 19:50:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:48,993 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1316 transitions. [2020-02-10 19:50:48,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1316 transitions. [2020-02-10 19:50:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:48,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:48,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 19:50:48,994 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 19:50:48,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:48,994 INFO L82 PathProgramCache]: Analyzing trace with hash -254362824, now seen corresponding path program 1005 times [2020-02-10 19:50:48,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:48,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970622506] [2020-02-10 19:50:48,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:49,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 19:50:49,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970622506] [2020-02-10 19:50:49,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:49,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:49,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662006596] [2020-02-10 19:50:49,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:49,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:49,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:49,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:49,284 INFO L87 Difference]: Start difference. First operand 382 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:50:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:49,392 INFO L93 Difference]: Finished difference Result 589 states and 1747 transitions. [2020-02-10 19:50:49,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:49,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:49,394 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:50:49,395 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:50:49,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 19:50:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:50:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 385. [2020-02-10 19:50:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:50:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-02-10 19:50:49,404 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-02-10 19:50:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:49,404 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-02-10 19:50:49,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-02-10 19:50:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:49,405 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:49,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 19:50:49,405 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 19:50:49,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:49,405 INFO L82 PathProgramCache]: Analyzing trace with hash 47655120, now seen corresponding path program 1006 times [2020-02-10 19:50:49,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:49,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832493636] [2020-02-10 19:50:49,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:49,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 19:50:49,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832493636] [2020-02-10 19:50:49,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:49,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:49,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519569124] [2020-02-10 19:50:49,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:49,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:49,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:49,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:49,696 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:50:49,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:49,827 INFO L93 Difference]: Finished difference Result 581 states and 1738 transitions. [2020-02-10 19:50:49,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:49,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:49,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:49,829 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:50:49,829 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:50:49,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 19:50:49,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:50:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 382. [2020-02-10 19:50:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:50:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-02-10 19:50:49,839 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-02-10 19:50:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:49,839 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-02-10 19:50:49,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-02-10 19:50:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:49,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:49,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 19:50:49,840 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 19:50:49,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:49,840 INFO L82 PathProgramCache]: Analyzing trace with hash 994649608, now seen corresponding path program 1007 times [2020-02-10 19:50:49,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:49,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012264061] [2020-02-10 19:50:49,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:50,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 19:50:50,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012264061] [2020-02-10 19:50:50,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:50,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:50,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545323477] [2020-02-10 19:50:50,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:50,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:50,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:50,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:50,136 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:50:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:50,238 INFO L93 Difference]: Finished difference Result 585 states and 1736 transitions. [2020-02-10 19:50:50,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:50,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:50,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:50,240 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:50:50,240 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:50:50,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:50:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 383. [2020-02-10 19:50:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:50:50,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-02-10 19:50:50,250 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-02-10 19:50:50,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:50,250 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-02-10 19:50:50,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-02-10 19:50:50,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:50,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:50,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 19:50:50,251 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 19:50:50,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:50,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1529879410, now seen corresponding path program 1008 times [2020-02-10 19:50:50,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:50,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009223616] [2020-02-10 19:50:50,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:50,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 19:50:50,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009223616] [2020-02-10 19:50:50,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:50,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:50,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946421719] [2020-02-10 19:50:50,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:50,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:50,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:50,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:50,541 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:50:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:50,663 INFO L93 Difference]: Finished difference Result 579 states and 1733 transitions. [2020-02-10 19:50:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:50,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:50,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:50,665 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:50:50,665 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:50:50,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:50:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 379. [2020-02-10 19:50:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:50:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1310 transitions. [2020-02-10 19:50:50,681 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1310 transitions. Word has length 22 [2020-02-10 19:50:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:50,681 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1310 transitions. [2020-02-10 19:50:50,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1310 transitions. [2020-02-10 19:50:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:50,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:50,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 19:50:50,682 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 19:50:50,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:50,683 INFO L82 PathProgramCache]: Analyzing trace with hash 580845716, now seen corresponding path program 1009 times [2020-02-10 19:50:50,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:50,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164526502] [2020-02-10 19:50:50,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:50,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 19:50:50,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164526502] [2020-02-10 19:50:50,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:50,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:50,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100178787] [2020-02-10 19:50:50,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:50,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:50,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:50,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:50,971 INFO L87 Difference]: Start difference. First operand 379 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:50:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:51,065 INFO L93 Difference]: Finished difference Result 651 states and 1909 transitions. [2020-02-10 19:50:51,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:51,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:51,067 INFO L225 Difference]: With dead ends: 651 [2020-02-10 19:50:51,068 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 19:50:51,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 19:50:51,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 19:50:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 393. [2020-02-10 19:50:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:50:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1353 transitions. [2020-02-10 19:50:51,077 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1353 transitions. Word has length 22 [2020-02-10 19:50:51,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:51,077 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1353 transitions. [2020-02-10 19:50:51,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1353 transitions. [2020-02-10 19:50:51,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:51,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:51,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 19:50:51,078 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 19:50:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:51,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2123855694, now seen corresponding path program 1010 times [2020-02-10 19:50:51,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:51,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994568681] [2020-02-10 19:50:51,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:51,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 19:50:51,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994568681] [2020-02-10 19:50:51,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:51,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:51,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137249429] [2020-02-10 19:50:51,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:51,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:51,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:51,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:51,367 INFO L87 Difference]: Start difference. First operand 393 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:50:51,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:51,489 INFO L93 Difference]: Finished difference Result 646 states and 1896 transitions. [2020-02-10 19:50:51,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:51,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:51,491 INFO L225 Difference]: With dead ends: 646 [2020-02-10 19:50:51,492 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 19:50:51,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 19:50:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 389. [2020-02-10 19:50:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:50:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1343 transitions. [2020-02-10 19:50:51,501 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1343 transitions. Word has length 22 [2020-02-10 19:50:51,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:51,501 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1343 transitions. [2020-02-10 19:50:51,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1343 transitions. [2020-02-10 19:50:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:51,502 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:51,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:51,502 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 19:50:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash 845896580, now seen corresponding path program 1011 times [2020-02-10 19:50:51,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:51,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010933770] [2020-02-10 19:50:51,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:51,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 19:50:51,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010933770] [2020-02-10 19:50:51,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:51,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:51,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913295585] [2020-02-10 19:50:51,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:51,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:51,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:51,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:51,805 INFO L87 Difference]: Start difference. First operand 389 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:50:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:51,887 INFO L93 Difference]: Finished difference Result 658 states and 1921 transitions. [2020-02-10 19:50:51,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:51,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:51,889 INFO L225 Difference]: With dead ends: 658 [2020-02-10 19:50:51,889 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 19:50:51,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 19:50:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 397. [2020-02-10 19:50:51,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:50:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1356 transitions. [2020-02-10 19:50:51,899 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1356 transitions. Word has length 22 [2020-02-10 19:50:51,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:51,899 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1356 transitions. [2020-02-10 19:50:51,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1356 transitions. [2020-02-10 19:50:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:51,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:51,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 19:50:51,900 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 19:50:51,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:51,900 INFO L82 PathProgramCache]: Analyzing trace with hash -651674970, now seen corresponding path program 1012 times [2020-02-10 19:50:51,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:51,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984928883] [2020-02-10 19:50:51,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:52,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 19:50:52,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984928883] [2020-02-10 19:50:52,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:52,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:52,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240339265] [2020-02-10 19:50:52,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:52,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:52,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:52,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:52,198 INFO L87 Difference]: Start difference. First operand 397 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:50:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:52,329 INFO L93 Difference]: Finished difference Result 656 states and 1911 transitions. [2020-02-10 19:50:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:52,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:52,331 INFO L225 Difference]: With dead ends: 656 [2020-02-10 19:50:52,331 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 19:50:52,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 19:50:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 389. [2020-02-10 19:50:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:50:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-02-10 19:50:52,342 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-02-10 19:50:52,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:52,342 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-02-10 19:50:52,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-02-10 19:50:52,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:52,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:52,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 19:50:52,342 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 19:50:52,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:52,343 INFO L82 PathProgramCache]: Analyzing trace with hash -369399834, now seen corresponding path program 1013 times [2020-02-10 19:50:52,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:52,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165022462] [2020-02-10 19:50:52,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:52,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 19:50:52,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165022462] [2020-02-10 19:50:52,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:52,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:52,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409356573] [2020-02-10 19:50:52,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:52,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:52,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:52,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:52,643 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:50:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:52,777 INFO L93 Difference]: Finished difference Result 643 states and 1886 transitions. [2020-02-10 19:50:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:52,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:52,779 INFO L225 Difference]: With dead ends: 643 [2020-02-10 19:50:52,779 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 19:50:52,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:52,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 19:50:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 392. [2020-02-10 19:50:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:50:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1343 transitions. [2020-02-10 19:50:52,790 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1343 transitions. Word has length 22 [2020-02-10 19:50:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:52,790 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1343 transitions. [2020-02-10 19:50:52,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1343 transitions. [2020-02-10 19:50:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:52,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:52,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:52,791 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 19:50:52,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:52,791 INFO L82 PathProgramCache]: Analyzing trace with hash -350965808, now seen corresponding path program 1014 times [2020-02-10 19:50:52,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:52,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022833189] [2020-02-10 19:50:52,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:53,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 19:50:53,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022833189] [2020-02-10 19:50:53,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:53,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:53,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852621981] [2020-02-10 19:50:53,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:53,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:53,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:53,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:53,082 INFO L87 Difference]: Start difference. First operand 392 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:50:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:53,200 INFO L93 Difference]: Finished difference Result 646 states and 1889 transitions. [2020-02-10 19:50:53,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:53,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:53,202 INFO L225 Difference]: With dead ends: 646 [2020-02-10 19:50:53,202 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 19:50:53,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 19:50:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 19:50:53,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 384. [2020-02-10 19:50:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1326 transitions. [2020-02-10 19:50:53,213 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1326 transitions. Word has length 22 [2020-02-10 19:50:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:53,213 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1326 transitions. [2020-02-10 19:50:53,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1326 transitions. [2020-02-10 19:50:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:53,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:53,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 19:50:53,214 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 19:50:53,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:53,214 INFO L82 PathProgramCache]: Analyzing trace with hash 158359990, now seen corresponding path program 1015 times [2020-02-10 19:50:53,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:53,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602254079] [2020-02-10 19:50:53,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:53,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602254079] [2020-02-10 19:50:53,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:53,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:53,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635258262] [2020-02-10 19:50:53,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:53,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:53,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:53,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:53,507 INFO L87 Difference]: Start difference. First operand 384 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:50:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:53,608 INFO L93 Difference]: Finished difference Result 641 states and 1881 transitions. [2020-02-10 19:50:53,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:53,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:53,610 INFO L225 Difference]: With dead ends: 641 [2020-02-10 19:50:53,611 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 19:50:53,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 19:50:53,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 19:50:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 392. [2020-02-10 19:50:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:50:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1346 transitions. [2020-02-10 19:50:53,621 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1346 transitions. Word has length 22 [2020-02-10 19:50:53,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:53,621 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1346 transitions. [2020-02-10 19:50:53,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1346 transitions. [2020-02-10 19:50:53,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:53,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:53,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:53,622 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 19:50:53,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:53,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1748625876, now seen corresponding path program 1016 times [2020-02-10 19:50:53,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:53,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004849962] [2020-02-10 19:50:53,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:53,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 19:50:53,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004849962] [2020-02-10 19:50:53,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:53,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:53,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909591233] [2020-02-10 19:50:53,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:53,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:53,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:53,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:53,902 INFO L87 Difference]: Start difference. First operand 392 states and 1346 transitions. Second operand 9 states. [2020-02-10 19:50:54,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:54,032 INFO L93 Difference]: Finished difference Result 636 states and 1868 transitions. [2020-02-10 19:50:54,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:54,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:54,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:54,034 INFO L225 Difference]: With dead ends: 636 [2020-02-10 19:50:54,034 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 19:50:54,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 19:50:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 19:50:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 388. [2020-02-10 19:50:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:50:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1336 transitions. [2020-02-10 19:50:54,044 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1336 transitions. Word has length 22 [2020-02-10 19:50:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:54,044 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1336 transitions. [2020-02-10 19:50:54,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1336 transitions. [2020-02-10 19:50:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:54,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:54,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 19:50:54,045 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 19:50:54,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1190316762, now seen corresponding path program 1017 times [2020-02-10 19:50:54,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:54,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605176528] [2020-02-10 19:50:54,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:54,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 19:50:54,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605176528] [2020-02-10 19:50:54,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:54,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:54,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429456312] [2020-02-10 19:50:54,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:54,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:54,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:54,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:54,341 INFO L87 Difference]: Start difference. First operand 388 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:50:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:54,438 INFO L93 Difference]: Finished difference Result 635 states and 1868 transitions. [2020-02-10 19:50:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:54,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:54,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:54,440 INFO L225 Difference]: With dead ends: 635 [2020-02-10 19:50:54,440 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 19:50:54,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 19:50:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 19:50:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 393. [2020-02-10 19:50:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:50:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1344 transitions. [2020-02-10 19:50:54,451 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1344 transitions. Word has length 22 [2020-02-10 19:50:54,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:54,451 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1344 transitions. [2020-02-10 19:50:54,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1344 transitions. [2020-02-10 19:50:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:54,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:54,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 19:50:54,452 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 19:50:54,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:54,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1403322632, now seen corresponding path program 1018 times [2020-02-10 19:50:54,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:54,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510526660] [2020-02-10 19:50:54,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:54,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 19:50:54,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510526660] [2020-02-10 19:50:54,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:54,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:54,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086825755] [2020-02-10 19:50:54,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:54,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:54,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:54,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:54,748 INFO L87 Difference]: Start difference. First operand 393 states and 1344 transitions. Second operand 9 states. [2020-02-10 19:50:54,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:54,869 INFO L93 Difference]: Finished difference Result 622 states and 1848 transitions. [2020-02-10 19:50:54,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:54,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:54,871 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:50:54,871 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 19:50:54,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 19:50:54,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 19:50:54,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 388. [2020-02-10 19:50:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:50:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1332 transitions. [2020-02-10 19:50:54,882 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1332 transitions. Word has length 22 [2020-02-10 19:50:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:54,882 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1332 transitions. [2020-02-10 19:50:54,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1332 transitions. [2020-02-10 19:50:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:54,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50: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 19:50:54,883 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 19:50:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:54,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1889354120, now seen corresponding path program 1019 times [2020-02-10 19:50:54,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:54,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247163112] [2020-02-10 19:50:54,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:55,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 19:50:55,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247163112] [2020-02-10 19:50:55,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:55,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:55,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931120999] [2020-02-10 19:50:55,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:55,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:55,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:55,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:55,182 INFO L87 Difference]: Start difference. First operand 388 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:50:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:55,296 INFO L93 Difference]: Finished difference Result 628 states and 1850 transitions. [2020-02-10 19:50:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:55,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:55,298 INFO L225 Difference]: With dead ends: 628 [2020-02-10 19:50:55,298 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:50:55,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:50:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 391. [2020-02-10 19:50:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:50:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1337 transitions. [2020-02-10 19:50:55,308 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1337 transitions. Word has length 22 [2020-02-10 19:50:55,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:55,309 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1337 transitions. [2020-02-10 19:50:55,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1337 transitions. [2020-02-10 19:50:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:55,309 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:55,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 19:50:55,309 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 19:50:55,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:55,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1531872496, now seen corresponding path program 1020 times [2020-02-10 19:50:55,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:55,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930068617] [2020-02-10 19:50:55,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:55,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930068617] [2020-02-10 19:50:55,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:55,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:55,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584403150] [2020-02-10 19:50:55,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:55,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:55,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:55,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:55,602 INFO L87 Difference]: Start difference. First operand 391 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:50:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:55,717 INFO L93 Difference]: Finished difference Result 620 states and 1841 transitions. [2020-02-10 19:50:55,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:55,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:55,719 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:50:55,719 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 19:50:55,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:55,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 19:50:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 384. [2020-02-10 19:50:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1322 transitions. [2020-02-10 19:50:55,729 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1322 transitions. Word has length 22 [2020-02-10 19:50:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:55,729 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1322 transitions. [2020-02-10 19:50:55,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1322 transitions. [2020-02-10 19:50:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:55,730 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:55,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 19:50:55,735 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 19:50:55,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:55,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1986590228, now seen corresponding path program 1021 times [2020-02-10 19:50:55,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:55,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27958509] [2020-02-10 19:50:55,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:56,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 19:50:56,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27958509] [2020-02-10 19:50:56,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:56,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:56,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618805977] [2020-02-10 19:50:56,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:56,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:56,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:56,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:56,043 INFO L87 Difference]: Start difference. First operand 384 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:50:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:56,142 INFO L93 Difference]: Finished difference Result 654 states and 1908 transitions. [2020-02-10 19:50:56,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:56,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:56,144 INFO L225 Difference]: With dead ends: 654 [2020-02-10 19:50:56,144 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 19:50:56,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 19:50:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 398. [2020-02-10 19:50:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:50:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1355 transitions. [2020-02-10 19:50:56,153 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1355 transitions. Word has length 22 [2020-02-10 19:50:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:56,153 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1355 transitions. [2020-02-10 19:50:56,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1355 transitions. [2020-02-10 19:50:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:56,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:56,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 19:50:56,154 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 19:50:56,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:56,154 INFO L82 PathProgramCache]: Analyzing trace with hash 489018678, now seen corresponding path program 1022 times [2020-02-10 19:50:56,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:56,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369063563] [2020-02-10 19:50:56,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:56,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 19:50:56,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369063563] [2020-02-10 19:50:56,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:56,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:56,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327793164] [2020-02-10 19:50:56,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:56,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:56,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:56,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:56,452 INFO L87 Difference]: Start difference. First operand 398 states and 1355 transitions. Second operand 9 states. [2020-02-10 19:50:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:56,575 INFO L93 Difference]: Finished difference Result 652 states and 1898 transitions. [2020-02-10 19:50:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:56,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:56,577 INFO L225 Difference]: With dead ends: 652 [2020-02-10 19:50:56,577 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 19:50:56,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:56,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 19:50:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 390. [2020-02-10 19:50:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:50:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1336 transitions. [2020-02-10 19:50:56,587 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1336 transitions. Word has length 22 [2020-02-10 19:50:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:56,587 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1336 transitions. [2020-02-10 19:50:56,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:56,587 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1336 transitions. [2020-02-10 19:50:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:56,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:56,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 19:50:56,588 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 19:50:56,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:56,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1563674570, now seen corresponding path program 1023 times [2020-02-10 19:50:56,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:56,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277195991] [2020-02-10 19:50:56,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:56,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 19:50:56,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277195991] [2020-02-10 19:50:56,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:56,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:56,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896014283] [2020-02-10 19:50:56,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:56,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:56,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:56,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:56,883 INFO L87 Difference]: Start difference. First operand 390 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:50:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:56,989 INFO L93 Difference]: Finished difference Result 641 states and 1877 transitions. [2020-02-10 19:50:56,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:56,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:56,991 INFO L225 Difference]: With dead ends: 641 [2020-02-10 19:50:56,991 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 19:50:56,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 19:50:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 19:50:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 395. [2020-02-10 19:50:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:50:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1344 transitions. [2020-02-10 19:50:57,001 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1344 transitions. Word has length 22 [2020-02-10 19:50:57,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:57,001 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1344 transitions. [2020-02-10 19:50:57,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1344 transitions. [2020-02-10 19:50:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:57,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:57,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 19:50:57,002 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 19:50:57,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:57,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1029964824, now seen corresponding path program 1024 times [2020-02-10 19:50:57,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:57,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42038314] [2020-02-10 19:50:57,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:57,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 19:50:57,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42038314] [2020-02-10 19:50:57,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:57,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:57,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971708800] [2020-02-10 19:50:57,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:57,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:57,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:57,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:57,297 INFO L87 Difference]: Start difference. First operand 395 states and 1344 transitions. Second operand 9 states. [2020-02-10 19:50:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:57,428 INFO L93 Difference]: Finished difference Result 628 states and 1857 transitions. [2020-02-10 19:50:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:57,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:57,430 INFO L225 Difference]: With dead ends: 628 [2020-02-10 19:50:57,430 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 19:50:57,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 19:50:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 19:50:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 390. [2020-02-10 19:50:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:50:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1331 transitions. [2020-02-10 19:50:57,441 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1331 transitions. Word has length 22 [2020-02-10 19:50:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:57,441 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1331 transitions. [2020-02-10 19:50:57,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1331 transitions. [2020-02-10 19:50:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:57,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:57,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 19:50:57,442 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 19:50:57,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:57,442 INFO L82 PathProgramCache]: Analyzing trace with hash 115948978, now seen corresponding path program 1025 times [2020-02-10 19:50:57,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:57,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888067309] [2020-02-10 19:50:57,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:57,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 19:50:57,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888067309] [2020-02-10 19:50:57,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:57,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:57,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609349293] [2020-02-10 19:50:57,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:57,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:57,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:57,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:57,728 INFO L87 Difference]: Start difference. First operand 390 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:50:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:57,849 INFO L93 Difference]: Finished difference Result 638 states and 1867 transitions. [2020-02-10 19:50:57,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:57,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:57,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:57,851 INFO L225 Difference]: With dead ends: 638 [2020-02-10 19:50:57,851 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 19:50:57,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 19:50:57,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 19:50:57,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 394. [2020-02-10 19:50:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:50:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1338 transitions. [2020-02-10 19:50:57,861 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1338 transitions. Word has length 22 [2020-02-10 19:50:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:57,861 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1338 transitions. [2020-02-10 19:50:57,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1338 transitions. [2020-02-10 19:50:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:57,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:57,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 19:50:57,862 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 19:50:57,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:57,862 INFO L82 PathProgramCache]: Analyzing trace with hash 974823508, now seen corresponding path program 1026 times [2020-02-10 19:50:57,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:57,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282739008] [2020-02-10 19:50:57,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:58,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 19:50:58,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282739008] [2020-02-10 19:50:58,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:58,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:58,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583420427] [2020-02-10 19:50:58,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:58,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:58,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:58,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:58,150 INFO L87 Difference]: Start difference. First operand 394 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:50:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:58,287 INFO L93 Difference]: Finished difference Result 627 states and 1851 transitions. [2020-02-10 19:50:58,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:58,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:58,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:58,289 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:50:58,289 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 19:50:58,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 19:50:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 19:50:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 384. [2020-02-10 19:50:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:50:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-02-10 19:50:58,299 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-02-10 19:50:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:58,299 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-02-10 19:50:58,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-02-10 19:50:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:58,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:58,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 19:50:58,299 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 19:50:58,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:58,300 INFO L82 PathProgramCache]: Analyzing trace with hash -301791566, now seen corresponding path program 1027 times [2020-02-10 19:50:58,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:58,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128140452] [2020-02-10 19:50:58,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:58,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 19:50:58,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128140452] [2020-02-10 19:50:58,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:58,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:58,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418761277] [2020-02-10 19:50:58,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:58,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:58,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:58,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:58,584 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:50:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:58,717 INFO L93 Difference]: Finished difference Result 629 states and 1850 transitions. [2020-02-10 19:50:58,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:58,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:58,719 INFO L225 Difference]: With dead ends: 629 [2020-02-10 19:50:58,719 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 19:50:58,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 19:50:58,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 390. [2020-02-10 19:50:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:50:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1333 transitions. [2020-02-10 19:50:58,728 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1333 transitions. Word has length 22 [2020-02-10 19:50:58,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:58,728 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1333 transitions. [2020-02-10 19:50:58,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:58,728 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1333 transitions. [2020-02-10 19:50:58,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:58,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:58,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 19:50:58,729 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 19:50:58,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:58,729 INFO L82 PathProgramCache]: Analyzing trace with hash -283357540, now seen corresponding path program 1028 times [2020-02-10 19:50:58,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:58,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222189151] [2020-02-10 19:50:58,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:59,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 19:50:59,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222189151] [2020-02-10 19:50:59,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:59,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:59,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156040407] [2020-02-10 19:50:59,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:59,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:59,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:59,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:59,014 INFO L87 Difference]: Start difference. First operand 390 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:50:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:59,131 INFO L93 Difference]: Finished difference Result 632 states and 1853 transitions. [2020-02-10 19:50:59,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:59,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:59,133 INFO L225 Difference]: With dead ends: 632 [2020-02-10 19:50:59,134 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 19:50:59,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 19:50:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 387. [2020-02-10 19:50:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:50:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1325 transitions. [2020-02-10 19:50:59,143 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1325 transitions. Word has length 22 [2020-02-10 19:50:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:59,143 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1325 transitions. [2020-02-10 19:50:59,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1325 transitions. [2020-02-10 19:50:59,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:59,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:59,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 19:50:59,144 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 19:50:59,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:59,145 INFO L82 PathProgramCache]: Analyzing trace with hash 442910932, now seen corresponding path program 1029 times [2020-02-10 19:50:59,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:59,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315457074] [2020-02-10 19:50:59,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:59,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 19:50:59,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315457074] [2020-02-10 19:50:59,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:59,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:59,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661108400] [2020-02-10 19:50:59,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:59,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:59,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:59,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:59,441 INFO L87 Difference]: Start difference. First operand 387 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:50:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:59,562 INFO L93 Difference]: Finished difference Result 624 states and 1838 transitions. [2020-02-10 19:50:59,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:50:59,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:50:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:59,564 INFO L225 Difference]: With dead ends: 624 [2020-02-10 19:50:59,565 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 19:50:59,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 19:50:59,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 19:50:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 390. [2020-02-10 19:50:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:50:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1330 transitions. [2020-02-10 19:50:59,575 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1330 transitions. Word has length 22 [2020-02-10 19:50:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:59,575 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1330 transitions. [2020-02-10 19:50:59,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:50:59,575 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1330 transitions. [2020-02-10 19:50:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:50:59,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:59,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 19:50:59,576 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 19:50:59,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:59,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1316651612, now seen corresponding path program 1030 times [2020-02-10 19:50:59,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:59,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921350026] [2020-02-10 19:50:59,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:59,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 19:50:59,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921350026] [2020-02-10 19:50:59,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:59,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:50:59,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787934685] [2020-02-10 19:50:59,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:50:59,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:59,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:50:59,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:50:59,884 INFO L87 Difference]: Start difference. First operand 390 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:51:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:00,006 INFO L93 Difference]: Finished difference Result 616 states and 1829 transitions. [2020-02-10 19:51:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:00,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:00,008 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:51:00,008 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 19:51:00,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 19:51:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 19:51:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 387. [2020-02-10 19:51:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:51:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1322 transitions. [2020-02-10 19:51:00,020 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1322 transitions. Word has length 22 [2020-02-10 19:51:00,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:00,020 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1322 transitions. [2020-02-10 19:51:00,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1322 transitions. [2020-02-10 19:51:00,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:00,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:00,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:00,021 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 19:51:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1032799764, now seen corresponding path program 1031 times [2020-02-10 19:51:00,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:00,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318488736] [2020-02-10 19:51:00,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:00,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 19:51:00,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318488736] [2020-02-10 19:51:00,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:00,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:00,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620297884] [2020-02-10 19:51:00,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:00,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:00,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:00,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:00,306 INFO L87 Difference]: Start difference. First operand 387 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:51:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:00,426 INFO L93 Difference]: Finished difference Result 628 states and 1844 transitions. [2020-02-10 19:51:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:00,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:00,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:00,428 INFO L225 Difference]: With dead ends: 628 [2020-02-10 19:51:00,428 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 19:51:00,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 19:51:00,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 19:51:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 391. [2020-02-10 19:51:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:51:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1329 transitions. [2020-02-10 19:51:00,437 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1329 transitions. Word has length 22 [2020-02-10 19:51:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:00,438 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1329 transitions. [2020-02-10 19:51:00,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1329 transitions. [2020-02-10 19:51:00,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:00,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:00,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 19:51:00,438 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 19:51:00,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:00,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1888106418, now seen corresponding path program 1032 times [2020-02-10 19:51:00,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:00,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550634627] [2020-02-10 19:51:00,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:00,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550634627] [2020-02-10 19:51:00,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:00,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:00,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674205939] [2020-02-10 19:51:00,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:00,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:00,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:00,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:00,723 INFO L87 Difference]: Start difference. First operand 391 states and 1329 transitions. Second operand 9 states. [2020-02-10 19:51:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:00,856 INFO L93 Difference]: Finished difference Result 617 states and 1828 transitions. [2020-02-10 19:51:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:00,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:00,858 INFO L225 Difference]: With dead ends: 617 [2020-02-10 19:51:00,858 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:51:00,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 19:51:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:51:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 379. [2020-02-10 19:51:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:51:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1307 transitions. [2020-02-10 19:51:00,867 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1307 transitions. Word has length 22 [2020-02-10 19:51:00,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:00,867 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1307 transitions. [2020-02-10 19:51:00,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1307 transitions. [2020-02-10 19:51:00,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:00,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:00,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 19:51:00,868 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 19:51:00,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:00,868 INFO L82 PathProgramCache]: Analyzing trace with hash -384165146, now seen corresponding path program 1033 times [2020-02-10 19:51:00,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:00,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382193934] [2020-02-10 19:51:00,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:01,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 19:51:01,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382193934] [2020-02-10 19:51:01,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:01,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:01,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397303499] [2020-02-10 19:51:01,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:01,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:01,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:01,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:01,143 INFO L87 Difference]: Start difference. First operand 379 states and 1307 transitions. Second operand 9 states. [2020-02-10 19:51:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:01,229 INFO L93 Difference]: Finished difference Result 625 states and 1824 transitions. [2020-02-10 19:51:01,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:01,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:01,231 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:51:01,231 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 19:51:01,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 19:51:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 387. [2020-02-10 19:51:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:51:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-02-10 19:51:01,242 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-02-10 19:51:01,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:01,242 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-02-10 19:51:01,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-02-10 19:51:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:01,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:01,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 19:51:01,243 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 19:51:01,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:01,243 INFO L82 PathProgramCache]: Analyzing trace with hash 176903346, now seen corresponding path program 1034 times [2020-02-10 19:51:01,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:01,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201611228] [2020-02-10 19:51:01,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:01,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 19:51:01,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201611228] [2020-02-10 19:51:01,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:01,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:01,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59674765] [2020-02-10 19:51:01,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:01,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:01,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:01,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:01,517 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:51:01,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:01,604 INFO L93 Difference]: Finished difference Result 618 states and 1809 transitions. [2020-02-10 19:51:01,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:01,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:01,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:01,606 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:51:01,606 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 19:51:01,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 19:51:01,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 385. [2020-02-10 19:51:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:51:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-02-10 19:51:01,615 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-02-10 19:51:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:01,615 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-02-10 19:51:01,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-02-10 19:51:01,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:01,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:01,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 19:51:01,616 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 19:51:01,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:01,617 INFO L82 PathProgramCache]: Analyzing trace with hash 628527386, now seen corresponding path program 1035 times [2020-02-10 19:51:01,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:01,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380241270] [2020-02-10 19:51:01,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:01,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 19:51:01,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380241270] [2020-02-10 19:51:01,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:01,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:01,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312685477] [2020-02-10 19:51:01,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:01,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:01,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:01,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:01,916 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:51:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:02,008 INFO L93 Difference]: Finished difference Result 636 states and 1848 transitions. [2020-02-10 19:51:02,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:02,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:02,010 INFO L225 Difference]: With dead ends: 636 [2020-02-10 19:51:02,010 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 19:51:02,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 19:51:02,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 19:51:02,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 393. [2020-02-10 19:51:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:51:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1337 transitions. [2020-02-10 19:51:02,021 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1337 transitions. Word has length 22 [2020-02-10 19:51:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:02,021 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1337 transitions. [2020-02-10 19:51:02,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1337 transitions. [2020-02-10 19:51:02,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:02,022 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:02,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 19:51:02,022 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 19:51:02,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:02,022 INFO L82 PathProgramCache]: Analyzing trace with hash 498556940, now seen corresponding path program 1036 times [2020-02-10 19:51:02,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:02,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490245905] [2020-02-10 19:51:02,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:02,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 19:51:02,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490245905] [2020-02-10 19:51:02,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:02,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:02,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754388509] [2020-02-10 19:51:02,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:02,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:02,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:02,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:02,302 INFO L87 Difference]: Start difference. First operand 393 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:51:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:02,413 INFO L93 Difference]: Finished difference Result 634 states and 1838 transitions. [2020-02-10 19:51:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:02,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:02,415 INFO L225 Difference]: With dead ends: 634 [2020-02-10 19:51:02,416 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 19:51:02,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 19:51:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 19:51:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 385. [2020-02-10 19:51:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:51:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-02-10 19:51:02,425 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-02-10 19:51:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:02,425 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-02-10 19:51:02,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-02-10 19:51:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:02,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:02,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 19:51:02,426 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 19:51:02,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash 683249612, now seen corresponding path program 1037 times [2020-02-10 19:51:02,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:02,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188974651] [2020-02-10 19:51:02,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:02,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 19:51:02,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188974651] [2020-02-10 19:51:02,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:02,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:02,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349706548] [2020-02-10 19:51:02,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:02,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:02,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:02,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:02,704 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:51:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:02,795 INFO L93 Difference]: Finished difference Result 615 states and 1801 transitions. [2020-02-10 19:51:02,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:02,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:02,797 INFO L225 Difference]: With dead ends: 615 [2020-02-10 19:51:02,797 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:51:02,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 19:51:02,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:51:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 386. [2020-02-10 19:51:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:51:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-02-10 19:51:02,808 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-02-10 19:51:02,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:02,808 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-02-10 19:51:02,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-02-10 19:51:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:02,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:02,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 19:51:02,809 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 19:51:02,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:02,809 INFO L82 PathProgramCache]: Analyzing trace with hash -392461544, now seen corresponding path program 1038 times [2020-02-10 19:51:02,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:02,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442870507] [2020-02-10 19:51:02,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:03,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 19:51:03,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442870507] [2020-02-10 19:51:03,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:03,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:03,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659143593] [2020-02-10 19:51:03,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:03,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:03,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:03,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:03,072 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:51:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:03,190 INFO L93 Difference]: Finished difference Result 620 states and 1810 transitions. [2020-02-10 19:51:03,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:03,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:03,192 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:51:03,193 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:51:03,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 19:51:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:51:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 382. [2020-02-10 19:51:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:51:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-02-10 19:51:03,202 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-02-10 19:51:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:03,202 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-02-10 19:51:03,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-02-10 19:51:03,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:03,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:03,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 19:51:03,203 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 19:51:03,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:03,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1541868932, now seen corresponding path program 1039 times [2020-02-10 19:51:03,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:03,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553736166] [2020-02-10 19:51:03,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:03,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 19:51:03,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553736166] [2020-02-10 19:51:03,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:03,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:03,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818537979] [2020-02-10 19:51:03,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:03,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:03,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:03,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:03,481 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:51:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:03,576 INFO L93 Difference]: Finished difference Result 617 states and 1804 transitions. [2020-02-10 19:51:03,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:03,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:03,578 INFO L225 Difference]: With dead ends: 617 [2020-02-10 19:51:03,579 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 19:51:03,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 19:51:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 19:51:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 386. [2020-02-10 19:51:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:51:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1323 transitions. [2020-02-10 19:51:03,589 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1323 transitions. Word has length 22 [2020-02-10 19:51:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:03,589 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1323 transitions. [2020-02-10 19:51:03,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1323 transitions. [2020-02-10 19:51:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:03,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:03,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 19:51:03,590 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 19:51:03,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:03,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2102937424, now seen corresponding path program 1040 times [2020-02-10 19:51:03,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:03,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783643711] [2020-02-10 19:51:03,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:03,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 19:51:03,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783643711] [2020-02-10 19:51:03,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:03,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:03,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941081759] [2020-02-10 19:51:03,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:03,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:03,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:03,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:03,862 INFO L87 Difference]: Start difference. First operand 386 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:51:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:03,969 INFO L93 Difference]: Finished difference Result 610 states and 1789 transitions. [2020-02-10 19:51:03,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:03,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:03,970 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:51:03,971 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:51:03,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:51:03,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 384. [2020-02-10 19:51:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:51:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-02-10 19:51:03,980 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-02-10 19:51:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:03,980 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-02-10 19:51:03,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:03,981 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-02-10 19:51:03,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:03,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:03,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 19:51:03,981 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 19:51:03,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:03,981 INFO L82 PathProgramCache]: Analyzing trace with hash 954123610, now seen corresponding path program 1041 times [2020-02-10 19:51:03,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:03,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894635040] [2020-02-10 19:51:03,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:04,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 19:51:04,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894635040] [2020-02-10 19:51:04,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:04,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:04,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394485231] [2020-02-10 19:51:04,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:04,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:04,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:04,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:04,270 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:51:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:04,364 INFO L93 Difference]: Finished difference Result 615 states and 1803 transitions. [2020-02-10 19:51:04,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:04,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:04,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:04,366 INFO L225 Difference]: With dead ends: 615 [2020-02-10 19:51:04,366 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:51:04,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 19:51:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:51:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 389. [2020-02-10 19:51:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:51:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1327 transitions. [2020-02-10 19:51:04,375 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1327 transitions. Word has length 22 [2020-02-10 19:51:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:04,375 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1327 transitions. [2020-02-10 19:51:04,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1327 transitions. [2020-02-10 19:51:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:04,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:04,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 19:51:04,376 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 19:51:04,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:04,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1318927028, now seen corresponding path program 1042 times [2020-02-10 19:51:04,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:04,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005045151] [2020-02-10 19:51:04,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:04,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 19:51:04,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005045151] [2020-02-10 19:51:04,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:04,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:04,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655015940] [2020-02-10 19:51:04,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:04,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:04,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:04,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:04,663 INFO L87 Difference]: Start difference. First operand 389 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:51:04,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:04,770 INFO L93 Difference]: Finished difference Result 602 states and 1783 transitions. [2020-02-10 19:51:04,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:04,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:04,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:04,772 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:51:04,772 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:51:04,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 19:51:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:51:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 384. [2020-02-10 19:51:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:51:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-02-10 19:51:04,782 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-02-10 19:51:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:04,783 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-02-10 19:51:04,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-02-10 19:51:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:04,783 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:04,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 19:51:04,784 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 19:51:04,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:04,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1008845836, now seen corresponding path program 1043 times [2020-02-10 19:51:04,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:04,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974744651] [2020-02-10 19:51:04,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:05,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974744651] [2020-02-10 19:51:05,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:05,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:05,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755426060] [2020-02-10 19:51:05,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:05,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:05,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:05,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:05,069 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:51:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:05,173 INFO L93 Difference]: Finished difference Result 604 states and 1777 transitions. [2020-02-10 19:51:05,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:05,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:05,175 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:51:05,175 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 19:51:05,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 19:51:05,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 19:51:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 385. [2020-02-10 19:51:05,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:51:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1318 transitions. [2020-02-10 19:51:05,185 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1318 transitions. Word has length 22 [2020-02-10 19:51:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:05,185 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1318 transitions. [2020-02-10 19:51:05,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1318 transitions. [2020-02-10 19:51:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:05,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:05,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 19:51:05,186 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 19:51:05,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1544075638, now seen corresponding path program 1044 times [2020-02-10 19:51:05,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:05,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629973163] [2020-02-10 19:51:05,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:05,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 19:51:05,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629973163] [2020-02-10 19:51:05,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:05,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:05,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741763200] [2020-02-10 19:51:05,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:05,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:05,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:05,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:05,470 INFO L87 Difference]: Start difference. First operand 385 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:51:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:05,583 INFO L93 Difference]: Finished difference Result 598 states and 1774 transitions. [2020-02-10 19:51:05,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:05,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:05,585 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:51:05,585 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:51:05,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 19:51:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:51:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 382. [2020-02-10 19:51:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:51:05,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1313 transitions. [2020-02-10 19:51:05,595 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1313 transitions. Word has length 22 [2020-02-10 19:51:05,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:05,595 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1313 transitions. [2020-02-10 19:51:05,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1313 transitions. [2020-02-10 19:51:05,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:05,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:05,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 19:51:05,596 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 19:51:05,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:05,596 INFO L82 PathProgramCache]: Analyzing trace with hash -411708412, now seen corresponding path program 1045 times [2020-02-10 19:51:05,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:05,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181794457] [2020-02-10 19:51:05,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:05,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181794457] [2020-02-10 19:51:05,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:05,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:05,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521385333] [2020-02-10 19:51:05,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:05,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:05,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:05,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:05,899 INFO L87 Difference]: Start difference. First operand 382 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:51:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:06,000 INFO L93 Difference]: Finished difference Result 640 states and 1861 transitions. [2020-02-10 19:51:06,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:06,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:06,002 INFO L225 Difference]: With dead ends: 640 [2020-02-10 19:51:06,002 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 19:51:06,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 19:51:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 19:51:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 396. [2020-02-10 19:51:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:51:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1346 transitions. [2020-02-10 19:51:06,012 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1346 transitions. Word has length 22 [2020-02-10 19:51:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:06,013 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1346 transitions. [2020-02-10 19:51:06,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1346 transitions. [2020-02-10 19:51:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:06,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:06,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 19:51:06,013 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 19:51:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:06,014 INFO L82 PathProgramCache]: Analyzing trace with hash -541678858, now seen corresponding path program 1046 times [2020-02-10 19:51:06,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:06,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980976454] [2020-02-10 19:51:06,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51: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 19:51:06,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980976454] [2020-02-10 19:51:06,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:06,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:06,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656527975] [2020-02-10 19:51:06,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:06,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:06,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:06,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:06,312 INFO L87 Difference]: Start difference. First operand 396 states and 1346 transitions. Second operand 9 states. [2020-02-10 19:51:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:06,419 INFO L93 Difference]: Finished difference Result 638 states and 1851 transitions. [2020-02-10 19:51:06,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:06,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:06,421 INFO L225 Difference]: With dead ends: 638 [2020-02-10 19:51:06,421 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:51:06,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:06,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:51:06,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 388. [2020-02-10 19:51:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1327 transitions. [2020-02-10 19:51:06,431 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1327 transitions. Word has length 22 [2020-02-10 19:51:06,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:06,432 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1327 transitions. [2020-02-10 19:51:06,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1327 transitions. [2020-02-10 19:51:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:06,432 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:06,432 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:06,432 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 19:51:06,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:06,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2012146266, now seen corresponding path program 1047 times [2020-02-10 19:51:06,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:06,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585363407] [2020-02-10 19:51:06,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:06,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 19:51:06,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585363407] [2020-02-10 19:51:06,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:06,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:06,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355386996] [2020-02-10 19:51:06,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:06,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:06,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:06,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:06,730 INFO L87 Difference]: Start difference. First operand 388 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:51:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:06,812 INFO L93 Difference]: Finished difference Result 627 states and 1830 transitions. [2020-02-10 19:51:06,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:06,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:06,814 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:51:06,814 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 19:51:06,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 19:51:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 19:51:06,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 393. [2020-02-10 19:51:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:51:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1335 transitions. [2020-02-10 19:51:06,823 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1335 transitions. Word has length 22 [2020-02-10 19:51:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:06,824 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1335 transitions. [2020-02-10 19:51:06,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1335 transitions. [2020-02-10 19:51:06,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:06,824 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:06,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 19:51:06,825 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 19:51:06,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash 9770392, now seen corresponding path program 1048 times [2020-02-10 19:51:06,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:06,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61691946] [2020-02-10 19:51:06,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:07,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61691946] [2020-02-10 19:51:07,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:07,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:07,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614010691] [2020-02-10 19:51:07,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:07,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:07,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:07,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:07,114 INFO L87 Difference]: Start difference. First operand 393 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:51:07,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:07,225 INFO L93 Difference]: Finished difference Result 614 states and 1810 transitions. [2020-02-10 19:51:07,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:07,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:07,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:07,227 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:51:07,227 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 19:51:07,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 19:51:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 388. [2020-02-10 19:51:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1322 transitions. [2020-02-10 19:51:07,237 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1322 transitions. Word has length 22 [2020-02-10 19:51:07,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:07,237 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1322 transitions. [2020-02-10 19:51:07,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:07,237 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1322 transitions. [2020-02-10 19:51:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:07,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:07,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 19:51:07,238 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 19:51:07,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:07,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1458284190, now seen corresponding path program 1049 times [2020-02-10 19:51:07,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:07,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464262013] [2020-02-10 19:51:07,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51: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 19:51:07,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464262013] [2020-02-10 19:51:07,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:07,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:07,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915683117] [2020-02-10 19:51:07,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:07,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:07,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:07,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:07,524 INFO L87 Difference]: Start difference. First operand 388 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:51:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:07,648 INFO L93 Difference]: Finished difference Result 624 states and 1820 transitions. [2020-02-10 19:51:07,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:07,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:07,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:07,650 INFO L225 Difference]: With dead ends: 624 [2020-02-10 19:51:07,650 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:51:07,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 19:51:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:51:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 392. [2020-02-10 19:51:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:51:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1329 transitions. [2020-02-10 19:51:07,660 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1329 transitions. Word has length 22 [2020-02-10 19:51:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:07,660 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1329 transitions. [2020-02-10 19:51:07,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1329 transitions. [2020-02-10 19:51:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:07,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:07,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 19:51:07,661 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 19:51:07,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:07,661 INFO L82 PathProgramCache]: Analyzing trace with hash -599409660, now seen corresponding path program 1050 times [2020-02-10 19:51:07,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:07,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445146019] [2020-02-10 19:51:07,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:07,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445146019] [2020-02-10 19:51:07,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:07,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:07,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821085860] [2020-02-10 19:51:07,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:07,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:07,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:07,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:07,937 INFO L87 Difference]: Start difference. First operand 392 states and 1329 transitions. Second operand 9 states. [2020-02-10 19:51:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:08,066 INFO L93 Difference]: Finished difference Result 613 states and 1804 transitions. [2020-02-10 19:51:08,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:08,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:08,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:08,068 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:51:08,069 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:51:08,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:08,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:51:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 382. [2020-02-10 19:51:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:51:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-02-10 19:51:08,078 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-02-10 19:51:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:08,079 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-02-10 19:51:08,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-02-10 19:51:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:08,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:08,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 19:51:08,080 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 19:51:08,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:08,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1126148752, now seen corresponding path program 1051 times [2020-02-10 19:51:08,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:08,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505647224] [2020-02-10 19:51:08,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:08,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505647224] [2020-02-10 19:51:08,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:08,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:08,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584565897] [2020-02-10 19:51:08,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:08,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:08,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:08,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:08,346 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:51:08,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:08,438 INFO L93 Difference]: Finished difference Result 603 states and 1773 transitions. [2020-02-10 19:51:08,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:08,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:08,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:08,440 INFO L225 Difference]: With dead ends: 603 [2020-02-10 19:51:08,440 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:51:08,441 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:08,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:51:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 384. [2020-02-10 19:51:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:51:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1314 transitions. [2020-02-10 19:51:08,451 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1314 transitions. Word has length 22 [2020-02-10 19:51:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:08,451 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1314 transitions. [2020-02-10 19:51:08,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1314 transitions. [2020-02-10 19:51:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:08,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51: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 19:51:08,452 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 19:51:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:08,452 INFO L82 PathProgramCache]: Analyzing trace with hash 50437596, now seen corresponding path program 1052 times [2020-02-10 19:51:08,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:08,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399976829] [2020-02-10 19:51:08,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:08,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 19:51:08,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399976829] [2020-02-10 19:51:08,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:08,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:08,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981958170] [2020-02-10 19:51:08,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:08,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:08,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:08,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:08,723 INFO L87 Difference]: Start difference. First operand 384 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:51:08,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:08,854 INFO L93 Difference]: Finished difference Result 608 states and 1782 transitions. [2020-02-10 19:51:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:08,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:08,856 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:51:08,857 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:51:08,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:51:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 383. [2020-02-10 19:51:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:51:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1312 transitions. [2020-02-10 19:51:08,866 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1312 transitions. Word has length 22 [2020-02-10 19:51:08,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:08,866 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1312 transitions. [2020-02-10 19:51:08,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1312 transitions. [2020-02-10 19:51:08,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:08,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:08,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 19:51:08,867 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 19:51:08,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:08,867 INFO L82 PathProgramCache]: Analyzing trace with hash -474289102, now seen corresponding path program 1053 times [2020-02-10 19:51:08,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:08,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006196025] [2020-02-10 19:51:08,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:09,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 19:51:09,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006196025] [2020-02-10 19:51:09,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:09,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:09,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345246008] [2020-02-10 19:51:09,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:09,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:09,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:09,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:09,148 INFO L87 Difference]: Start difference. First operand 383 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:51:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:09,236 INFO L93 Difference]: Finished difference Result 600 states and 1767 transitions. [2020-02-10 19:51:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:09,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:09,238 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:51:09,238 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:51:09,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:51:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 384. [2020-02-10 19:51:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:51:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1313 transitions. [2020-02-10 19:51:09,248 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1313 transitions. Word has length 22 [2020-02-10 19:51:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:09,249 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1313 transitions. [2020-02-10 19:51:09,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1313 transitions. [2020-02-10 19:51:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:09,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:09,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 19:51:09,249 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 19:51:09,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash 60940700, now seen corresponding path program 1054 times [2020-02-10 19:51:09,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:09,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008353903] [2020-02-10 19:51:09,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:09,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 19:51:09,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008353903] [2020-02-10 19:51:09,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:09,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:09,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892123373] [2020-02-10 19:51:09,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:09,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:09,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:09,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:09,537 INFO L87 Difference]: Start difference. First operand 384 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:51:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:09,662 INFO L93 Difference]: Finished difference Result 594 states and 1764 transitions. [2020-02-10 19:51:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:09,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:09,664 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:51:09,664 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 19:51:09,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:09,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 19:51:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 383. [2020-02-10 19:51:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:51:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-02-10 19:51:09,675 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-02-10 19:51:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:09,675 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-02-10 19:51:09,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:09,675 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-02-10 19:51:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:09,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:09,676 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:09,676 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 19:51:09,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:09,676 INFO L82 PathProgramCache]: Analyzing trace with hash -537307726, now seen corresponding path program 1055 times [2020-02-10 19:51:09,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:09,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264050918] [2020-02-10 19:51:09,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:09,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 19:51:09,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264050918] [2020-02-10 19:51:09,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:09,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:09,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086060300] [2020-02-10 19:51:09,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:09,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:09,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:09,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:09,959 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:51:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:10,074 INFO L93 Difference]: Finished difference Result 608 states and 1785 transitions. [2020-02-10 19:51:10,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:10,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:10,076 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:51:10,076 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:51:10,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:10,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:51:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 387. [2020-02-10 19:51:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:51:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1318 transitions. [2020-02-10 19:51:10,086 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1318 transitions. Word has length 22 [2020-02-10 19:51:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:10,086 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1318 transitions. [2020-02-10 19:51:10,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1318 transitions. [2020-02-10 19:51:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:10,086 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:10,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 19:51:10,087 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 19:51:10,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:10,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1073633232, now seen corresponding path program 1056 times [2020-02-10 19:51:10,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:10,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459313333] [2020-02-10 19:51:10,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:10,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 19:51:10,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459313333] [2020-02-10 19:51:10,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:10,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:10,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768878978] [2020-02-10 19:51:10,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:10,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:10,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:10,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:10,361 INFO L87 Difference]: Start difference. First operand 387 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:51:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:10,484 INFO L93 Difference]: Finished difference Result 597 states and 1769 transitions. [2020-02-10 19:51:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:10,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:10,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:10,486 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:51:10,486 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:51:10,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 19:51:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:51:10,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-02-10 19:51:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:51:10,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1304 transitions. [2020-02-10 19:51:10,495 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1304 transitions. Word has length 22 [2020-02-10 19:51:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:10,495 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1304 transitions. [2020-02-10 19:51:10,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1304 transitions. [2020-02-10 19:51:10,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:10,496 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:10,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 19:51:10,496 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 19:51:10,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:10,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1428641352, now seen corresponding path program 1057 times [2020-02-10 19:51:10,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:10,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453973819] [2020-02-10 19:51:10,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:10,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453973819] [2020-02-10 19:51:10,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:10,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:10,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299045005] [2020-02-10 19:51:10,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:10,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:10,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:10,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:10,776 INFO L87 Difference]: Start difference. First operand 379 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:51:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:10,907 INFO L93 Difference]: Finished difference Result 582 states and 1726 transitions. [2020-02-10 19:51:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:10,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:10,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:10,909 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:51:10,909 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 19:51:10,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 19:51:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 19:51:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 382. [2020-02-10 19:51:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:51:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1312 transitions. [2020-02-10 19:51:10,919 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1312 transitions. Word has length 22 [2020-02-10 19:51:10,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:10,919 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1312 transitions. [2020-02-10 19:51:10,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1312 transitions. [2020-02-10 19:51:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:10,919 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:10,919 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:10,920 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 19:51:10,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:10,920 INFO L82 PathProgramCache]: Analyzing trace with hash -16875658, now seen corresponding path program 1058 times [2020-02-10 19:51:10,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:10,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962847480] [2020-02-10 19:51:10,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:11,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 19:51:11,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962847480] [2020-02-10 19:51:11,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:11,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:11,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367864058] [2020-02-10 19:51:11,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:11,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:11,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:11,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:11,199 INFO L87 Difference]: Start difference. First operand 382 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:51:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:11,284 INFO L93 Difference]: Finished difference Result 580 states and 1721 transitions. [2020-02-10 19:51:11,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:11,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:11,286 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:51:11,286 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:51:11,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 19:51:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:51:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 381. [2020-02-10 19:51:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:51:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-02-10 19:51:11,300 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-02-10 19:51:11,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:11,301 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-02-10 19:51:11,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-02-10 19:51:11,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:11,301 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:11,301 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:11,301 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 19:51:11,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:11,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1853633412, now seen corresponding path program 1059 times [2020-02-10 19:51:11,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:11,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379929749] [2020-02-10 19:51:11,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:11,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 19:51:11,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379929749] [2020-02-10 19:51:11,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:11,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:11,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665200606] [2020-02-10 19:51:11,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:11,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:11,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:11,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:11,575 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:51:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:11,705 INFO L93 Difference]: Finished difference Result 589 states and 1741 transitions. [2020-02-10 19:51:11,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:11,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:11,707 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:51:11,707 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:51:11,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 19:51:11,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:51:11,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 384. [2020-02-10 19:51:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:51:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-02-10 19:51:11,716 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-02-10 19:51:11,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:11,716 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-02-10 19:51:11,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:11,716 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-02-10 19:51:11,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:11,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:11,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 19:51:11,717 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 19:51:11,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:11,717 INFO L82 PathProgramCache]: Analyzing trace with hash -467598282, now seen corresponding path program 1060 times [2020-02-10 19:51:11,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:11,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627499856] [2020-02-10 19:51:11,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:11,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 19:51:11,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627499856] [2020-02-10 19:51:11,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:11,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:11,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950714922] [2020-02-10 19:51:11,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:11,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:11,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:11,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:11,994 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:51:12,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:12,121 INFO L93 Difference]: Finished difference Result 592 states and 1744 transitions. [2020-02-10 19:51:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:12,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:12,123 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:51:12,123 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:51:12,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 19:51:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:51:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 381. [2020-02-10 19:51:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:51:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1309 transitions. [2020-02-10 19:51:12,133 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1309 transitions. Word has length 22 [2020-02-10 19:51:12,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:12,133 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1309 transitions. [2020-02-10 19:51:12,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1309 transitions. [2020-02-10 19:51:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:12,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:12,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 19:51:12,134 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 19:51:12,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:12,134 INFO L82 PathProgramCache]: Analyzing trace with hash -604620980, now seen corresponding path program 1061 times [2020-02-10 19:51:12,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:12,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407676140] [2020-02-10 19:51:12,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:12,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 19:51:12,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407676140] [2020-02-10 19:51:12,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:12,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:12,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008067579] [2020-02-10 19:51:12,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:12,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:12,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:12,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:12,414 INFO L87 Difference]: Start difference. First operand 381 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:51:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:12,505 INFO L93 Difference]: Finished difference Result 583 states and 1726 transitions. [2020-02-10 19:51:12,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:12,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:12,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:12,507 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:51:12,507 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:51:12,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 19:51:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:51:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 382. [2020-02-10 19:51:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:51:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-02-10 19:51:12,516 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-02-10 19:51:12,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:12,516 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-02-10 19:51:12,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-02-10 19:51:12,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:12,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:12,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 19:51:12,517 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 19:51:12,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:12,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1680332136, now seen corresponding path program 1062 times [2020-02-10 19:51:12,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:12,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441208596] [2020-02-10 19:51:12,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:12,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 19:51:12,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441208596] [2020-02-10 19:51:12,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:12,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:12,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976001544] [2020-02-10 19:51:12,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:12,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:12,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:12,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:12,809 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:51:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:12,929 INFO L93 Difference]: Finished difference Result 588 states and 1735 transitions. [2020-02-10 19:51:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:12,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:12,931 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:51:12,931 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:51:12,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 19:51:12,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:51:12,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 380. [2020-02-10 19:51:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:51:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1307 transitions. [2020-02-10 19:51:12,941 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1307 transitions. Word has length 22 [2020-02-10 19:51:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:12,941 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1307 transitions. [2020-02-10 19:51:12,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1307 transitions. [2020-02-10 19:51:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:12,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:12,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 19:51:12,942 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 19:51:12,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:12,942 INFO L82 PathProgramCache]: Analyzing trace with hash -940291866, now seen corresponding path program 1063 times [2020-02-10 19:51:12,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:12,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578727190] [2020-02-10 19:51:12,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:13,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 19:51:13,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578727190] [2020-02-10 19:51:13,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:13,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:13,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042576912] [2020-02-10 19:51:13,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:13,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:13,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:13,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:13,224 INFO L87 Difference]: Start difference. First operand 380 states and 1307 transitions. Second operand 9 states. [2020-02-10 19:51:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:13,369 INFO L93 Difference]: Finished difference Result 579 states and 1719 transitions. [2020-02-10 19:51:13,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:13,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:13,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:13,370 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:51:13,371 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:51:13,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:13,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:51:13,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 382. [2020-02-10 19:51:13,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:51:13,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1311 transitions. [2020-02-10 19:51:13,380 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1311 transitions. Word has length 22 [2020-02-10 19:51:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:13,380 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1311 transitions. [2020-02-10 19:51:13,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1311 transitions. [2020-02-10 19:51:13,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:13,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:13,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:13,381 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 19:51:13,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:13,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1909158420, now seen corresponding path program 1064 times [2020-02-10 19:51:13,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:13,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221021569] [2020-02-10 19:51:13,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:13,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 19:51:13,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221021569] [2020-02-10 19:51:13,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:13,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:13,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965625879] [2020-02-10 19:51:13,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:13,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:13,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:13,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:13,664 INFO L87 Difference]: Start difference. First operand 382 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:51:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:13,767 INFO L93 Difference]: Finished difference Result 577 states and 1714 transitions. [2020-02-10 19:51:13,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:13,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:13,769 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:51:13,769 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:51:13,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 19:51:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:51:13,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 381. [2020-02-10 19:51:13,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:51:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1309 transitions. [2020-02-10 19:51:13,779 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1309 transitions. Word has length 22 [2020-02-10 19:51:13,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:13,779 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1309 transitions. [2020-02-10 19:51:13,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1309 transitions. [2020-02-10 19:51:13,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:13,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:13,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 19:51:13,780 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 19:51:13,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:13,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1528037188, now seen corresponding path program 1065 times [2020-02-10 19:51:13,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:13,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412144243] [2020-02-10 19:51:13,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:14,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 19:51:14,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412144243] [2020-02-10 19:51:14,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:14,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:14,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010124095] [2020-02-10 19:51:14,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:14,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:14,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:14,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:14,065 INFO L87 Difference]: Start difference. First operand 381 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:51:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:14,211 INFO L93 Difference]: Finished difference Result 581 states and 1725 transitions. [2020-02-10 19:51:14,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:14,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:14,213 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:51:14,213 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:51:14,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:14,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:51:14,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 384. [2020-02-10 19:51:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:51:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1314 transitions. [2020-02-10 19:51:14,222 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1314 transitions. Word has length 22 [2020-02-10 19:51:14,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:14,222 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1314 transitions. [2020-02-10 19:51:14,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:14,222 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1314 transitions. [2020-02-10 19:51:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:14,223 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:14,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 19:51:14,223 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 19:51:14,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:14,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1226019244, now seen corresponding path program 1066 times [2020-02-10 19:51:14,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:14,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005973347] [2020-02-10 19:51:14,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:14,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 19:51:14,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005973347] [2020-02-10 19:51:14,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:14,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:14,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122746343] [2020-02-10 19:51:14,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:14,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:14,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:14,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:14,499 INFO L87 Difference]: Start difference. First operand 384 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:51:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:14,648 INFO L93 Difference]: Finished difference Result 573 states and 1716 transitions. [2020-02-10 19:51:14,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:14,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:14,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:14,650 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:51:14,650 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:51:14,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 19:51:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:51:14,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 381. [2020-02-10 19:51:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:51:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1308 transitions. [2020-02-10 19:51:14,660 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1308 transitions. Word has length 22 [2020-02-10 19:51:14,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:14,660 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1308 transitions. [2020-02-10 19:51:14,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:14,660 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1308 transitions. [2020-02-10 19:51:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:14,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:14,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 19:51:14,661 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 19:51:14,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:14,661 INFO L82 PathProgramCache]: Analyzing trace with hash -279024756, now seen corresponding path program 1067 times [2020-02-10 19:51:14,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:14,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307466822] [2020-02-10 19:51:14,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:14,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307466822] [2020-02-10 19:51:14,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:14,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:14,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674482916] [2020-02-10 19:51:14,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:14,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:14,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:14,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:14,938 INFO L87 Difference]: Start difference. First operand 381 states and 1308 transitions. Second operand 9 states. [2020-02-10 19:51:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:15,057 INFO L93 Difference]: Finished difference Result 577 states and 1714 transitions. [2020-02-10 19:51:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:15,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:15,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:15,059 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:51:15,059 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:51:15,059 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:51:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 382. [2020-02-10 19:51:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:51:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1309 transitions. [2020-02-10 19:51:15,069 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1309 transitions. Word has length 22 [2020-02-10 19:51:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:15,069 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1309 transitions. [2020-02-10 19:51:15,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1309 transitions. [2020-02-10 19:51:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:15,070 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:15,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 19:51:15,070 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 19:51:15,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:15,070 INFO L82 PathProgramCache]: Analyzing trace with hash 256205046, now seen corresponding path program 1068 times [2020-02-10 19:51:15,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:15,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138626085] [2020-02-10 19:51:15,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:15,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 19:51:15,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138626085] [2020-02-10 19:51:15,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:15,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:15,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704380083] [2020-02-10 19:51:15,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:15,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:15,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:15,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:15,349 INFO L87 Difference]: Start difference. First operand 382 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:51:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:15,476 INFO L93 Difference]: Finished difference Result 571 states and 1711 transitions. [2020-02-10 19:51:15,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:15,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:15,478 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:51:15,478 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:51:15,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 19:51:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:51:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 380. [2020-02-10 19:51:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:51:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1306 transitions. [2020-02-10 19:51:15,488 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1306 transitions. Word has length 22 [2020-02-10 19:51:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:15,488 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1306 transitions. [2020-02-10 19:51:15,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1306 transitions. [2020-02-10 19:51:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:15,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:15,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 19:51:15,489 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 19:51:15,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1401098086, now seen corresponding path program 1069 times [2020-02-10 19:51:15,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:15,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303618072] [2020-02-10 19:51:15,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:15,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 19:51:15,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303618072] [2020-02-10 19:51:15,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:15,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:15,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364259599] [2020-02-10 19:51:15,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:15,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:15,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:15,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:15,763 INFO L87 Difference]: Start difference. First operand 380 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:51:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:15,903 INFO L93 Difference]: Finished difference Result 596 states and 1761 transitions. [2020-02-10 19:51:15,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:15,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:15,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:15,905 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:51:15,905 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:51:15,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:15,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:51:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 386. [2020-02-10 19:51:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:51:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-02-10 19:51:15,915 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-02-10 19:51:15,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:15,915 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-02-10 19:51:15,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-02-10 19:51:15,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:15,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:15,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 19:51:15,916 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 19:51:15,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:15,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1507834080, now seen corresponding path program 1070 times [2020-02-10 19:51:15,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:15,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817426859] [2020-02-10 19:51:15,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:16,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817426859] [2020-02-10 19:51:16,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:16,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:16,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459733719] [2020-02-10 19:51:16,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:16,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:16,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:16,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:16,192 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:51:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:16,309 INFO L93 Difference]: Finished difference Result 599 states and 1764 transitions. [2020-02-10 19:51:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:16,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:16,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:16,311 INFO L225 Difference]: With dead ends: 599 [2020-02-10 19:51:16,311 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:51:16,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:51:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 383. [2020-02-10 19:51:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:51:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1314 transitions. [2020-02-10 19:51:16,321 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1314 transitions. Word has length 22 [2020-02-10 19:51:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:16,321 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1314 transitions. [2020-02-10 19:51:16,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1314 transitions. [2020-02-10 19:51:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:16,322 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:16,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 19:51:16,322 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 19:51:16,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:16,322 INFO L82 PathProgramCache]: Analyzing trace with hash -199339768, now seen corresponding path program 1071 times [2020-02-10 19:51:16,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:16,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847191545] [2020-02-10 19:51:16,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:16,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847191545] [2020-02-10 19:51:16,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:16,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:16,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633606484] [2020-02-10 19:51:16,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:16,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:16,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:16,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:16,598 INFO L87 Difference]: Start difference. First operand 383 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:51:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:16,715 INFO L93 Difference]: Finished difference Result 591 states and 1749 transitions. [2020-02-10 19:51:16,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:16,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:16,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:16,717 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:51:16,717 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:51:16,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 19:51:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:51:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 386. [2020-02-10 19:51:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:51:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1319 transitions. [2020-02-10 19:51:16,727 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1319 transitions. Word has length 22 [2020-02-10 19:51:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:16,727 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1319 transitions. [2020-02-10 19:51:16,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1319 transitions. [2020-02-10 19:51:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:16,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:16,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 19:51:16,728 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 19:51:16,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:16,728 INFO L82 PathProgramCache]: Analyzing trace with hash 102678176, now seen corresponding path program 1072 times [2020-02-10 19:51:16,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:16,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063378268] [2020-02-10 19:51:16,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:17,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 19:51:17,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063378268] [2020-02-10 19:51:17,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:17,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:17,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323048678] [2020-02-10 19:51:17,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:17,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:17,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:17,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:17,008 INFO L87 Difference]: Start difference. First operand 386 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:51:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:17,151 INFO L93 Difference]: Finished difference Result 583 states and 1740 transitions. [2020-02-10 19:51:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:17,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:17,153 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:51:17,153 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:51:17,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 19:51:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:51:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 383. [2020-02-10 19:51:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:51:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-02-10 19:51:17,163 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-02-10 19:51:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:17,163 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-02-10 19:51:17,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-02-10 19:51:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:17,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:17,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 19:51:17,164 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 19:51:17,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:17,164 INFO L82 PathProgramCache]: Analyzing trace with hash -735212408, now seen corresponding path program 1073 times [2020-02-10 19:51:17,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:17,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134068585] [2020-02-10 19:51:17,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:17,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 19:51:17,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134068585] [2020-02-10 19:51:17,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:17,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:17,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496879964] [2020-02-10 19:51:17,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:17,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:17,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:17,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:17,434 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:51:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:17,579 INFO L93 Difference]: Finished difference Result 595 states and 1755 transitions. [2020-02-10 19:51:17,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:17,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:17,581 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:51:17,581 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 19:51:17,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 19:51:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 19:51:17,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 387. [2020-02-10 19:51:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:51:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1318 transitions. [2020-02-10 19:51:17,592 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1318 transitions. Word has length 22 [2020-02-10 19:51:17,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:17,592 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1318 transitions. [2020-02-10 19:51:17,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1318 transitions. [2020-02-10 19:51:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:17,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:17,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 19:51:17,593 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 19:51:17,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash 120094246, now seen corresponding path program 1074 times [2020-02-10 19:51:17,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:17,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489459612] [2020-02-10 19:51:17,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:17,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 19:51:17,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489459612] [2020-02-10 19:51:17,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:17,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:17,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751996509] [2020-02-10 19:51:17,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:17,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:17,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:17,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:17,859 INFO L87 Difference]: Start difference. First operand 387 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:51:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:17,983 INFO L93 Difference]: Finished difference Result 584 states and 1739 transitions. [2020-02-10 19:51:17,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:17,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:17,985 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:51:17,985 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:51:17,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:51:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 380. [2020-02-10 19:51:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:51:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1305 transitions. [2020-02-10 19:51:17,995 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1305 transitions. Word has length 22 [2020-02-10 19:51:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:17,995 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1305 transitions. [2020-02-10 19:51:17,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1305 transitions. [2020-02-10 19:51:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:17,996 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:17,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 19:51:17,996 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 19:51:17,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:17,996 INFO L82 PathProgramCache]: Analyzing trace with hash 281177300, now seen corresponding path program 1075 times [2020-02-10 19:51:17,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:17,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243004383] [2020-02-10 19:51:17,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:18,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 19:51:18,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243004383] [2020-02-10 19:51:18,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:18,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:18,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092635215] [2020-02-10 19:51:18,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:18,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:18,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:18,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:18,260 INFO L87 Difference]: Start difference. First operand 380 states and 1305 transitions. Second operand 9 states. [2020-02-10 19:51:18,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:18,373 INFO L93 Difference]: Finished difference Result 584 states and 1728 transitions. [2020-02-10 19:51:18,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:18,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:18,375 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:51:18,375 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:51:18,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 19:51:18,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:51:18,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 382. [2020-02-10 19:51:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:51:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1309 transitions. [2020-02-10 19:51:18,385 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1309 transitions. Word has length 22 [2020-02-10 19:51:18,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:18,385 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1309 transitions. [2020-02-10 19:51:18,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1309 transitions. [2020-02-10 19:51:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:18,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:18,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 19:51:18,386 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 19:51:18,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:18,386 INFO L82 PathProgramCache]: Analyzing trace with hash -794533856, now seen corresponding path program 1076 times [2020-02-10 19:51:18,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:18,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369224340] [2020-02-10 19:51:18,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:18,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 19:51:18,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369224340] [2020-02-10 19:51:18,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:18,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:18,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376624953] [2020-02-10 19:51:18,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:18,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:18,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:18,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:18,641 INFO L87 Difference]: Start difference. First operand 382 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:51:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:18,781 INFO L93 Difference]: Finished difference Result 589 states and 1737 transitions. [2020-02-10 19:51:18,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:18,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:18,783 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:51:18,783 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:51:18,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 19:51:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:51:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 381. [2020-02-10 19:51:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:51:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1307 transitions. [2020-02-10 19:51:18,793 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1307 transitions. Word has length 22 [2020-02-10 19:51:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:18,794 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1307 transitions. [2020-02-10 19:51:18,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:18,794 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1307 transitions. [2020-02-10 19:51:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:18,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:18,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 19:51:18,794 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 19:51:18,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1319260554, now seen corresponding path program 1077 times [2020-02-10 19:51:18,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:18,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884327405] [2020-02-10 19:51:18,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:19,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 19:51:19,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884327405] [2020-02-10 19:51:19,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:19,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:19,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246700967] [2020-02-10 19:51:19,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:19,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:19,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:19,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:19,072 INFO L87 Difference]: Start difference. First operand 381 states and 1307 transitions. Second operand 9 states. [2020-02-10 19:51:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:19,192 INFO L93 Difference]: Finished difference Result 581 states and 1722 transitions. [2020-02-10 19:51:19,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:19,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:19,194 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:51:19,194 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:51:19,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:51:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 382. [2020-02-10 19:51:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:51:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1308 transitions. [2020-02-10 19:51:19,204 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1308 transitions. Word has length 22 [2020-02-10 19:51:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:19,204 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1308 transitions. [2020-02-10 19:51:19,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1308 transitions. [2020-02-10 19:51:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:19,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:19,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 19:51:19,205 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 19:51:19,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:19,205 INFO L82 PathProgramCache]: Analyzing trace with hash -784030752, now seen corresponding path program 1078 times [2020-02-10 19:51:19,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:19,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712645325] [2020-02-10 19:51:19,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:19,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 19:51:19,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712645325] [2020-02-10 19:51:19,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:19,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:19,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270421743] [2020-02-10 19:51:19,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:19,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:19,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:19,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:19,473 INFO L87 Difference]: Start difference. First operand 382 states and 1308 transitions. Second operand 9 states. [2020-02-10 19:51:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:19,619 INFO L93 Difference]: Finished difference Result 575 states and 1719 transitions. [2020-02-10 19:51:19,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:19,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:19,621 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:51:19,621 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:51:19,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 19:51:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:51:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 381. [2020-02-10 19:51:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:51:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-02-10 19:51:19,631 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-02-10 19:51:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:19,631 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-02-10 19:51:19,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-02-10 19:51:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:19,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:19,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 19:51:19,632 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 19:51:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1382279178, now seen corresponding path program 1079 times [2020-02-10 19:51:19,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:19,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62160628] [2020-02-10 19:51:19,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:19,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 19:51:19,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62160628] [2020-02-10 19:51:19,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:19,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:19,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845014356] [2020-02-10 19:51:19,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:19,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:19,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:19,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:19,897 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:51:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:20,040 INFO L93 Difference]: Finished difference Result 589 states and 1740 transitions. [2020-02-10 19:51:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:20,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:20,042 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:51:20,042 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:51:20,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 19:51:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:51:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 385. [2020-02-10 19:51:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:51:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1313 transitions. [2020-02-10 19:51:20,051 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1313 transitions. Word has length 22 [2020-02-10 19:51:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:20,051 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1313 transitions. [2020-02-10 19:51:20,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1313 transitions. [2020-02-10 19:51:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:20,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51: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 19:51:20,052 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 19:51:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:20,052 INFO L82 PathProgramCache]: Analyzing trace with hash 228661780, now seen corresponding path program 1080 times [2020-02-10 19:51:20,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:20,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527386136] [2020-02-10 19:51:20,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:20,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 19:51:20,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527386136] [2020-02-10 19:51:20,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:20,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:20,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557402782] [2020-02-10 19:51:20,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:20,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:20,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:20,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:20,317 INFO L87 Difference]: Start difference. First operand 385 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:51:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:20,467 INFO L93 Difference]: Finished difference Result 578 states and 1724 transitions. [2020-02-10 19:51:20,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:20,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:20,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:20,469 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:51:20,469 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:51:20,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:51:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 376. [2020-02-10 19:51:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:51:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1298 transitions. [2020-02-10 19:51:20,479 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1298 transitions. Word has length 22 [2020-02-10 19:51:20,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:20,479 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1298 transitions. [2020-02-10 19:51:20,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1298 transitions. [2020-02-10 19:51:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:20,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:20,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 19:51:20,480 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 19:51:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1636377640, now seen corresponding path program 1081 times [2020-02-10 19:51:20,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:20,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089174527] [2020-02-10 19:51:20,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:20,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 19:51:20,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089174527] [2020-02-10 19:51:20,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:20,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:20,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853705088] [2020-02-10 19:51:20,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:20,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:20,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:20,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:20,770 INFO L87 Difference]: Start difference. First operand 376 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:51:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:20,883 INFO L93 Difference]: Finished difference Result 647 states and 1916 transitions. [2020-02-10 19:51:20,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:20,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:20,885 INFO L225 Difference]: With dead ends: 647 [2020-02-10 19:51:20,885 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 19:51:20,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 19:51:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 19:51:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 391. [2020-02-10 19:51:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:51:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1350 transitions. [2020-02-10 19:51:20,895 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1350 transitions. Word has length 22 [2020-02-10 19:51:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:20,895 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1350 transitions. [2020-02-10 19:51:20,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1350 transitions. [2020-02-10 19:51:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:20,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:20,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:20,896 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 19:51:20,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:20,896 INFO L82 PathProgramCache]: Analyzing trace with hash -46111754, now seen corresponding path program 1082 times [2020-02-10 19:51:20,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:20,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351252361] [2020-02-10 19:51:20,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:21,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 19:51:21,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351252361] [2020-02-10 19:51:21,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:21,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:21,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177595261] [2020-02-10 19:51:21,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:21,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:21,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:21,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:21,187 INFO L87 Difference]: Start difference. First operand 391 states and 1350 transitions. Second operand 9 states. [2020-02-10 19:51:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:21,327 INFO L93 Difference]: Finished difference Result 642 states and 1903 transitions. [2020-02-10 19:51:21,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:21,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:21,329 INFO L225 Difference]: With dead ends: 642 [2020-02-10 19:51:21,329 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 19:51:21,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:21,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 19:51:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 387. [2020-02-10 19:51:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:51:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1341 transitions. [2020-02-10 19:51:21,339 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1341 transitions. Word has length 22 [2020-02-10 19:51:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:21,339 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1341 transitions. [2020-02-10 19:51:21,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1341 transitions. [2020-02-10 19:51:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:21,340 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:21,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 19:51:21,340 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 19:51:21,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1535465468, now seen corresponding path program 1083 times [2020-02-10 19:51:21,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:21,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778013716] [2020-02-10 19:51:21,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:21,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 19:51:21,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778013716] [2020-02-10 19:51:21,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:21,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:21,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952881529] [2020-02-10 19:51:21,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:21,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:21,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:21,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:21,637 INFO L87 Difference]: Start difference. First operand 387 states and 1341 transitions. Second operand 9 states. [2020-02-10 19:51:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:21,752 INFO L93 Difference]: Finished difference Result 645 states and 1908 transitions. [2020-02-10 19:51:21,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:21,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:21,754 INFO L225 Difference]: With dead ends: 645 [2020-02-10 19:51:21,754 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 19:51:21,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:21,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 19:51:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 390. [2020-02-10 19:51:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:51:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1345 transitions. [2020-02-10 19:51:21,764 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1345 transitions. Word has length 22 [2020-02-10 19:51:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:21,764 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1345 transitions. [2020-02-10 19:51:21,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1345 transitions. [2020-02-10 19:51:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:21,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:21,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 19:51:21,765 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 19:51:21,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:21,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1408829094, now seen corresponding path program 1084 times [2020-02-10 19:51:21,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:21,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294948293] [2020-02-10 19:51:21,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:22,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 19:51:22,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294948293] [2020-02-10 19:51:22,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:22,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:22,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977122534] [2020-02-10 19:51:22,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:22,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:22,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:22,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:22,062 INFO L87 Difference]: Start difference. First operand 390 states and 1345 transitions. Second operand 9 states. [2020-02-10 19:51:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:22,204 INFO L93 Difference]: Finished difference Result 639 states and 1894 transitions. [2020-02-10 19:51:22,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:22,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:22,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:22,206 INFO L225 Difference]: With dead ends: 639 [2020-02-10 19:51:22,206 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 19:51:22,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 19:51:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 19:51:22,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 387. [2020-02-10 19:51:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:51:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-02-10 19:51:22,216 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-02-10 19:51:22,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:22,216 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-02-10 19:51:22,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:22,216 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-02-10 19:51:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:22,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:22,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:22,217 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 19:51:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:22,217 INFO L82 PathProgramCache]: Analyzing trace with hash 471120034, now seen corresponding path program 1085 times [2020-02-10 19:51:22,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:22,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839314956] [2020-02-10 19:51:22,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:22,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839314956] [2020-02-10 19:51:22,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:22,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:22,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674380722] [2020-02-10 19:51:22,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:22,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:22,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:22,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:22,498 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:51:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:22,634 INFO L93 Difference]: Finished difference Result 634 states and 1885 transitions. [2020-02-10 19:51:22,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:22,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:22,636 INFO L225 Difference]: With dead ends: 634 [2020-02-10 19:51:22,636 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 19:51:22,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 19:51:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 19:51:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 389. [2020-02-10 19:51:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:51:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-02-10 19:51:22,646 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-02-10 19:51:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:22,646 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-02-10 19:51:22,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-02-10 19:51:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:22,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:22,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 19:51:22,647 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 19:51:22,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:22,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1813052822, now seen corresponding path program 1086 times [2020-02-10 19:51:22,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:22,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628111467] [2020-02-10 19:51:22,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:22,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 19:51:22,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628111467] [2020-02-10 19:51:22,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:22,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:22,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533884919] [2020-02-10 19:51:22,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:22,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:22,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:22,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:22,945 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-02-10 19:51:23,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:23,073 INFO L93 Difference]: Finished difference Result 633 states and 1881 transitions. [2020-02-10 19:51:23,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:23,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:23,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:23,075 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:51:23,075 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 19:51:23,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:23,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 19:51:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 384. [2020-02-10 19:51:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:51:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1331 transitions. [2020-02-10 19:51:23,085 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1331 transitions. Word has length 22 [2020-02-10 19:51:23,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:23,086 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1331 transitions. [2020-02-10 19:51:23,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:23,086 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1331 transitions. [2020-02-10 19:51:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:23,086 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:23,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 19:51:23,086 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 19:51:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:23,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1321022442, now seen corresponding path program 1087 times [2020-02-10 19:51:23,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:23,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056931857] [2020-02-10 19:51:23,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:23,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 19:51:23,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056931857] [2020-02-10 19:51:23,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:23,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:23,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585765637] [2020-02-10 19:51:23,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:23,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:23,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:23,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:23,379 INFO L87 Difference]: Start difference. First operand 384 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:51:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:23,490 INFO L93 Difference]: Finished difference Result 659 states and 1943 transitions. [2020-02-10 19:51:23,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:23,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:23,493 INFO L225 Difference]: With dead ends: 659 [2020-02-10 19:51:23,493 INFO L226 Difference]: Without dead ends: 643 [2020-02-10 19:51:23,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-02-10 19:51:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 393. [2020-02-10 19:51:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:51:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1353 transitions. [2020-02-10 19:51:23,502 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1353 transitions. Word has length 22 [2020-02-10 19:51:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:23,503 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1353 transitions. [2020-02-10 19:51:23,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1353 transitions. [2020-02-10 19:51:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:23,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:23,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 19:51:23,503 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 19:51:23,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:23,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1383678968, now seen corresponding path program 1088 times [2020-02-10 19:51:23,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:23,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224560782] [2020-02-10 19:51:23,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:23,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 19:51:23,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224560782] [2020-02-10 19:51:23,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:23,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:23,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929779747] [2020-02-10 19:51:23,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:23,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:23,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:23,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:23,793 INFO L87 Difference]: Start difference. First operand 393 states and 1353 transitions. Second operand 9 states. [2020-02-10 19:51:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:23,929 INFO L93 Difference]: Finished difference Result 654 states and 1930 transitions. [2020-02-10 19:51:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:23,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:23,931 INFO L225 Difference]: With dead ends: 654 [2020-02-10 19:51:23,931 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 19:51:23,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 19:51:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 19:51:23,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 389. [2020-02-10 19:51:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:51:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1343 transitions. [2020-02-10 19:51:23,942 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1343 transitions. Word has length 22 [2020-02-10 19:51:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:23,942 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1343 transitions. [2020-02-10 19:51:23,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1343 transitions. [2020-02-10 19:51:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:23,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:23,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 19:51:23,943 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 19:51:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:23,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1586073306, now seen corresponding path program 1089 times [2020-02-10 19:51:23,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:23,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037517321] [2020-02-10 19:51:23,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:24,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 19:51:24,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037517321] [2020-02-10 19:51:24,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:24,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:24,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015918616] [2020-02-10 19:51:24,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:24,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:24,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:24,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:24,254 INFO L87 Difference]: Start difference. First operand 389 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:51:24,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:24,369 INFO L93 Difference]: Finished difference Result 666 states and 1955 transitions. [2020-02-10 19:51:24,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:24,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:24,371 INFO L225 Difference]: With dead ends: 666 [2020-02-10 19:51:24,371 INFO L226 Difference]: Without dead ends: 650 [2020-02-10 19:51:24,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:24,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-02-10 19:51:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 397. [2020-02-10 19:51:24,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:51:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1356 transitions. [2020-02-10 19:51:24,380 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1356 transitions. Word has length 22 [2020-02-10 19:51:24,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:24,381 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1356 transitions. [2020-02-10 19:51:24,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:24,381 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1356 transitions. [2020-02-10 19:51:24,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:24,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:24,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:24,381 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 19:51:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:24,382 INFO L82 PathProgramCache]: Analyzing trace with hash 88501756, now seen corresponding path program 1090 times [2020-02-10 19:51:24,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:24,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643360050] [2020-02-10 19:51:24,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:24,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 19:51:24,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643360050] [2020-02-10 19:51:24,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:24,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:24,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225677507] [2020-02-10 19:51:24,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:24,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:24,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:24,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:24,687 INFO L87 Difference]: Start difference. First operand 397 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:51:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:24,833 INFO L93 Difference]: Finished difference Result 664 states and 1945 transitions. [2020-02-10 19:51:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:24,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:24,835 INFO L225 Difference]: With dead ends: 664 [2020-02-10 19:51:24,835 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 19:51:24,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 19:51:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 19:51:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 389. [2020-02-10 19:51:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:51:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-02-10 19:51:24,845 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-02-10 19:51:24,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:24,845 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-02-10 19:51:24,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:24,845 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-02-10 19:51:24,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:24,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:24,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 19:51:24,845 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 19:51:24,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:24,846 INFO L82 PathProgramCache]: Analyzing trace with hash 370776892, now seen corresponding path program 1091 times [2020-02-10 19:51:24,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:24,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923233762] [2020-02-10 19:51:24,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:25,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 19:51:25,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923233762] [2020-02-10 19:51:25,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:25,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:25,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429508709] [2020-02-10 19:51:25,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:25,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:25,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:25,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:25,139 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:51:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:25,275 INFO L93 Difference]: Finished difference Result 651 states and 1920 transitions. [2020-02-10 19:51:25,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:25,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:25,278 INFO L225 Difference]: With dead ends: 651 [2020-02-10 19:51:25,278 INFO L226 Difference]: Without dead ends: 640 [2020-02-10 19:51:25,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 19:51:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-02-10 19:51:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 392. [2020-02-10 19:51:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:51:25,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1343 transitions. [2020-02-10 19:51:25,288 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1343 transitions. Word has length 22 [2020-02-10 19:51:25,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:25,288 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1343 transitions. [2020-02-10 19:51:25,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1343 transitions. [2020-02-10 19:51:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:25,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:25,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 19:51:25,289 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 19:51:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash 389210918, now seen corresponding path program 1092 times [2020-02-10 19:51:25,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:25,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771678866] [2020-02-10 19:51:25,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:25,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 19:51:25,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771678866] [2020-02-10 19:51:25,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:25,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:25,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930662293] [2020-02-10 19:51:25,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:25,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:25,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:25,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:25,581 INFO L87 Difference]: Start difference. First operand 392 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:51:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:25,727 INFO L93 Difference]: Finished difference Result 654 states and 1923 transitions. [2020-02-10 19:51:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:25,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:25,729 INFO L225 Difference]: With dead ends: 654 [2020-02-10 19:51:25,730 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 19:51:25,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:25,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 19:51:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 384. [2020-02-10 19:51:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:51:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-02-10 19:51:25,739 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-02-10 19:51:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:25,740 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-02-10 19:51:25,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-02-10 19:51:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:25,740 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:25,740 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:25,740 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 19:51:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:25,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2037057798, now seen corresponding path program 1093 times [2020-02-10 19:51:25,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:25,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812251771] [2020-02-10 19:51:25,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:26,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 19:51:26,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812251771] [2020-02-10 19:51:26,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:26,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:26,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182533132] [2020-02-10 19:51:26,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:26,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:26,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:26,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:26,042 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:51:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:26,154 INFO L93 Difference]: Finished difference Result 653 states and 1922 transitions. [2020-02-10 19:51:26,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:26,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:26,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:26,156 INFO L225 Difference]: With dead ends: 653 [2020-02-10 19:51:26,156 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 19:51:26,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 19:51:26,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 19:51:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 391. [2020-02-10 19:51:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:51:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1343 transitions. [2020-02-10 19:51:26,166 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1343 transitions. Word has length 22 [2020-02-10 19:51:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:26,167 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1343 transitions. [2020-02-10 19:51:26,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1343 transitions. [2020-02-10 19:51:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:26,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:26,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 19:51:26,167 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 19:51:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1910421424, now seen corresponding path program 1094 times [2020-02-10 19:51:26,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:26,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085778865] [2020-02-10 19:51:26,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:26,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 19:51:26,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085778865] [2020-02-10 19:51:26,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:26,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:26,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314417245] [2020-02-10 19:51:26,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:26,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:26,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:26,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:26,468 INFO L87 Difference]: Start difference. First operand 391 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:51:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:26,603 INFO L93 Difference]: Finished difference Result 647 states and 1908 transitions. [2020-02-10 19:51:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:26,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:26,605 INFO L225 Difference]: With dead ends: 647 [2020-02-10 19:51:26,606 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 19:51:26,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 19:51:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 19:51:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 388. [2020-02-10 19:51:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1336 transitions. [2020-02-10 19:51:26,616 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1336 transitions. Word has length 22 [2020-02-10 19:51:26,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:26,616 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1336 transitions. [2020-02-10 19:51:26,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1336 transitions. [2020-02-10 19:51:26,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:26,617 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:26,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 19:51:26,617 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 19:51:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash -428742616, now seen corresponding path program 1095 times [2020-02-10 19:51:26,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:26,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374034714] [2020-02-10 19:51:26,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:26,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 19:51:26,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374034714] [2020-02-10 19:51:26,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:26,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:26,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147533612] [2020-02-10 19:51:26,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:26,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:26,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:26,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:26,922 INFO L87 Difference]: Start difference. First operand 388 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:51:27,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:27,032 INFO L93 Difference]: Finished difference Result 662 states and 1940 transitions. [2020-02-10 19:51:27,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:27,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:27,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:27,034 INFO L225 Difference]: With dead ends: 662 [2020-02-10 19:51:27,034 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 19:51:27,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 19:51:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 19:51:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 396. [2020-02-10 19:51:27,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:51:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1349 transitions. [2020-02-10 19:51:27,045 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1349 transitions. Word has length 22 [2020-02-10 19:51:27,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:27,045 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1349 transitions. [2020-02-10 19:51:27,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1349 transitions. [2020-02-10 19:51:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:27,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:27,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 19:51:27,046 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 19:51:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:27,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1078188208, now seen corresponding path program 1096 times [2020-02-10 19:51:27,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:27,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136653984] [2020-02-10 19:51:27,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:27,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 19:51:27,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136653984] [2020-02-10 19:51:27,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:27,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:27,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981472658] [2020-02-10 19:51:27,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:27,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:27,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:27,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:27,353 INFO L87 Difference]: Start difference. First operand 396 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:51:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:27,486 INFO L93 Difference]: Finished difference Result 660 states and 1930 transitions. [2020-02-10 19:51:27,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:27,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:27,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:27,489 INFO L225 Difference]: With dead ends: 660 [2020-02-10 19:51:27,489 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 19:51:27,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 19:51:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 388. [2020-02-10 19:51:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1332 transitions. [2020-02-10 19:51:27,499 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1332 transitions. Word has length 22 [2020-02-10 19:51:27,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:27,500 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1332 transitions. [2020-02-10 19:51:27,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:27,500 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1332 transitions. [2020-02-10 19:51:27,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:27,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:27,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 19:51:27,500 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 19:51:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:27,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1846690294, now seen corresponding path program 1097 times [2020-02-10 19:51:27,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:27,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638874209] [2020-02-10 19:51:27,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:27,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 19:51:27,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638874209] [2020-02-10 19:51:27,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:27,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:27,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161420915] [2020-02-10 19:51:27,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:27,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:27,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:27,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:27,794 INFO L87 Difference]: Start difference. First operand 388 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:51:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:27,934 INFO L93 Difference]: Finished difference Result 644 states and 1899 transitions. [2020-02-10 19:51:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:27,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:27,936 INFO L225 Difference]: With dead ends: 644 [2020-02-10 19:51:27,936 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 19:51:27,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 19:51:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 19:51:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 390. [2020-02-10 19:51:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:51:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1335 transitions. [2020-02-10 19:51:27,945 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1335 transitions. Word has length 22 [2020-02-10 19:51:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:27,945 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1335 transitions. [2020-02-10 19:51:27,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:27,945 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1335 transitions. [2020-02-10 19:51:27,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:27,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:27,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 19:51:27,946 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 19:51:27,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:27,946 INFO L82 PathProgramCache]: Analyzing trace with hash 928740104, now seen corresponding path program 1098 times [2020-02-10 19:51:27,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:27,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864355772] [2020-02-10 19:51:27,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:28,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 19:51:28,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864355772] [2020-02-10 19:51:28,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:28,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:28,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621368393] [2020-02-10 19:51:28,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:28,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:28,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:28,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:28,235 INFO L87 Difference]: Start difference. First operand 390 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:51:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:28,356 INFO L93 Difference]: Finished difference Result 648 states and 1905 transitions. [2020-02-10 19:51:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:28,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:28,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:28,358 INFO L225 Difference]: With dead ends: 648 [2020-02-10 19:51:28,358 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 19:51:28,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 19:51:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 19:51:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 384. [2020-02-10 19:51:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:51:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-02-10 19:51:28,368 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-02-10 19:51:28,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:28,368 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-02-10 19:51:28,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-02-10 19:51:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:28,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:28,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 19:51:28,369 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 19:51:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:28,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1063619292, now seen corresponding path program 1099 times [2020-02-10 19:51:28,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:28,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516110626] [2020-02-10 19:51:28,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:28,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 19:51:28,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516110626] [2020-02-10 19:51:28,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:28,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:28,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403569280] [2020-02-10 19:51:28,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:28,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:28,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:28,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:28,663 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:51:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:28,792 INFO L93 Difference]: Finished difference Result 629 states and 1870 transitions. [2020-02-10 19:51:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:28,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:28,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:28,794 INFO L225 Difference]: With dead ends: 629 [2020-02-10 19:51:28,794 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 19:51:28,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 19:51:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 19:51:28,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 388. [2020-02-10 19:51:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1333 transitions. [2020-02-10 19:51:28,803 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1333 transitions. Word has length 22 [2020-02-10 19:51:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:28,803 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1333 transitions. [2020-02-10 19:51:28,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1333 transitions. [2020-02-10 19:51:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:28,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:28,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 19:51:28,804 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 19:51:28,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:28,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1889415216, now seen corresponding path program 1100 times [2020-02-10 19:51:28,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:28,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151175180] [2020-02-10 19:51:28,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:29,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 19:51:29,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151175180] [2020-02-10 19:51:29,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:29,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:29,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066090447] [2020-02-10 19:51:29,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:29,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:29,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:29,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:29,107 INFO L87 Difference]: Start difference. First operand 388 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:51:29,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:29,248 INFO L93 Difference]: Finished difference Result 628 states and 1866 transitions. [2020-02-10 19:51:29,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:29,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:29,250 INFO L225 Difference]: With dead ends: 628 [2020-02-10 19:51:29,250 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:51:29,250 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:51:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 386. [2020-02-10 19:51:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:51:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-02-10 19:51:29,260 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-02-10 19:51:29,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:29,260 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-02-10 19:51:29,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-02-10 19:51:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:29,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:29,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 19:51:29,261 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 19:51:29,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:29,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1623032822, now seen corresponding path program 1101 times [2020-02-10 19:51:29,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:29,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434009673] [2020-02-10 19:51:29,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:29,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 19:51:29,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434009673] [2020-02-10 19:51:29,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:29,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:29,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244305320] [2020-02-10 19:51:29,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:29,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:29,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:29,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:29,552 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:51:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:29,691 INFO L93 Difference]: Finished difference Result 634 states and 1879 transitions. [2020-02-10 19:51:29,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:29,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:29,694 INFO L225 Difference]: With dead ends: 634 [2020-02-10 19:51:29,694 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 19:51: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 19:51:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 19:51:29,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 389. [2020-02-10 19:51:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:51:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1333 transitions. [2020-02-10 19:51:29,704 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1333 transitions. Word has length 22 [2020-02-10 19:51:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:29,704 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1333 transitions. [2020-02-10 19:51:29,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1333 transitions. [2020-02-10 19:51:29,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:29,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:29,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 19:51:29,705 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 19:51:29,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:29,705 INFO L82 PathProgramCache]: Analyzing trace with hash -756472838, now seen corresponding path program 1102 times [2020-02-10 19:51:29,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:29,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150791782] [2020-02-10 19:51:29,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:29,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 19:51:29,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150791782] [2020-02-10 19:51:29,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:29,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:29,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260928233] [2020-02-10 19:51:29,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:29,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:29,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:29,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:29,995 INFO L87 Difference]: Start difference. First operand 389 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:51:30,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:30,134 INFO L93 Difference]: Finished difference Result 637 states and 1882 transitions. [2020-02-10 19:51:30,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:30,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:30,136 INFO L225 Difference]: With dead ends: 637 [2020-02-10 19:51:30,136 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 19:51:30,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 19:51:30,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 386. [2020-02-10 19:51:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:51:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1326 transitions. [2020-02-10 19:51:30,145 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1326 transitions. Word has length 22 [2020-02-10 19:51:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:30,146 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1326 transitions. [2020-02-10 19:51:30,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1326 transitions. [2020-02-10 19:51:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:30,146 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:30,146 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:30,146 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 19:51:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:30,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1354185414, now seen corresponding path program 1103 times [2020-02-10 19:51:30,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:30,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273074344] [2020-02-10 19:51:30,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:30,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 19:51:30,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273074344] [2020-02-10 19:51:30,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:30,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:30,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295240550] [2020-02-10 19:51:30,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:30,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:30,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:30,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:30,439 INFO L87 Difference]: Start difference. First operand 386 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:51:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:30,578 INFO L93 Difference]: Finished difference Result 631 states and 1870 transitions. [2020-02-10 19:51:30,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:30,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:30,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:30,580 INFO L225 Difference]: With dead ends: 631 [2020-02-10 19:51:30,580 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 19:51:30,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 19:51:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 388. [2020-02-10 19:51:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1329 transitions. [2020-02-10 19:51:30,590 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1329 transitions. Word has length 22 [2020-02-10 19:51:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:30,590 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1329 transitions. [2020-02-10 19:51:30,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1329 transitions. [2020-02-10 19:51:30,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:30,591 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:30,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 19:51:30,591 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 19:51:30,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:30,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2022831692, now seen corresponding path program 1104 times [2020-02-10 19:51:30,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:30,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005691853] [2020-02-10 19:51:30,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:30,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 19:51:30,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005691853] [2020-02-10 19:51:30,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:30,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:30,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780163735] [2020-02-10 19:51:30,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:30,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:30,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:30,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:30,874 INFO L87 Difference]: Start difference. First operand 388 states and 1329 transitions. Second operand 9 states. [2020-02-10 19:51:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:31,005 INFO L93 Difference]: Finished difference Result 635 states and 1876 transitions. [2020-02-10 19:51:31,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:31,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:31,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:31,007 INFO L225 Difference]: With dead ends: 635 [2020-02-10 19:51:31,008 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 19:51:31,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 19:51:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 19:51:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 380. [2020-02-10 19:51:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:51:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1314 transitions. [2020-02-10 19:51:31,017 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1314 transitions. Word has length 22 [2020-02-10 19:51:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:31,018 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1314 transitions. [2020-02-10 19:51:31,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1314 transitions. [2020-02-10 19:51:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:31,018 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:31,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 19:51:31,018 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 19:51:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:31,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1848533258, now seen corresponding path program 1105 times [2020-02-10 19:51:31,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:31,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881118803] [2020-02-10 19:51:31,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:31,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 19:51:31,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881118803] [2020-02-10 19:51:31,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:31,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:31,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801967843] [2020-02-10 19:51:31,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:31,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:31,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:31,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:31,310 INFO L87 Difference]: Start difference. First operand 380 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:51:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:31,402 INFO L93 Difference]: Finished difference Result 636 states and 1884 transitions. [2020-02-10 19:51:31,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:31,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:31,404 INFO L225 Difference]: With dead ends: 636 [2020-02-10 19:51:31,404 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 19:51:31,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 19:51:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 19:51:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 390. [2020-02-10 19:51:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:51:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-02-10 19:51:31,413 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-02-10 19:51:31,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:31,413 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-02-10 19:51:31,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-02-10 19:51:31,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:31,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:31,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 19:51:31,414 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 19:51:31,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:31,414 INFO L82 PathProgramCache]: Analyzing trace with hash -258267372, now seen corresponding path program 1106 times [2020-02-10 19:51:31,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:31,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71149782] [2020-02-10 19:51:31,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:31,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 19:51:31,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71149782] [2020-02-10 19:51:31,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:31,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:31,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575746401] [2020-02-10 19:51:31,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:31,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:31,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:31,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:31,698 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:51:31,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:31,840 INFO L93 Difference]: Finished difference Result 631 states and 1871 transitions. [2020-02-10 19:51:31,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:31,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:31,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:31,842 INFO L225 Difference]: With dead ends: 631 [2020-02-10 19:51:31,842 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:51:31,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 19:51:31,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:51:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 386. [2020-02-10 19:51:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:51:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-02-10 19:51:31,852 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-02-10 19:51:31,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:31,852 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-02-10 19:51:31,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:31,852 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-02-10 19:51:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:31,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:31,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 19:51:31,853 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 19:51:31,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:31,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1747621086, now seen corresponding path program 1107 times [2020-02-10 19:51:31,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:31,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665170969] [2020-02-10 19:51:31,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:32,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 19:51:32,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665170969] [2020-02-10 19:51:32,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:32,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:32,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712190340] [2020-02-10 19:51:32,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:32,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:32,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:32,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:32,162 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:51:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:32,279 INFO L93 Difference]: Finished difference Result 634 states and 1876 transitions. [2020-02-10 19:51:32,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:32,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:32,281 INFO L225 Difference]: With dead ends: 634 [2020-02-10 19:51:32,281 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 19:51:32,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 19:51:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 19:51:32,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 389. [2020-02-10 19:51:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:51:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-02-10 19:51:32,290 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-02-10 19:51:32,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:32,290 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-02-10 19:51:32,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-02-10 19:51:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:32,291 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:32,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 19:51:32,291 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 19:51:32,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:32,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1620984712, now seen corresponding path program 1108 times [2020-02-10 19:51:32,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:32,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842931396] [2020-02-10 19:51:32,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:32,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842931396] [2020-02-10 19:51:32,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:32,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:32,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330247880] [2020-02-10 19:51:32,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:32,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:32,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:32,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:32,583 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:51:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:32,729 INFO L93 Difference]: Finished difference Result 628 states and 1862 transitions. [2020-02-10 19:51:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:32,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:32,731 INFO L225 Difference]: With dead ends: 628 [2020-02-10 19:51:32,731 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 19:51:32,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 19:51:32,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 19:51:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 386. [2020-02-10 19:51:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:51:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1331 transitions. [2020-02-10 19:51:32,741 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1331 transitions. Word has length 22 [2020-02-10 19:51:32,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:32,742 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1331 transitions. [2020-02-10 19:51:32,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1331 transitions. [2020-02-10 19:51:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:32,742 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:32,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 19:51:32,742 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 19:51:32,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:32,742 INFO L82 PathProgramCache]: Analyzing trace with hash 258964416, now seen corresponding path program 1109 times [2020-02-10 19:51:32,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:32,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171059633] [2020-02-10 19:51:32,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:33,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 19:51:33,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171059633] [2020-02-10 19:51:33,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:33,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:33,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930852922] [2020-02-10 19:51:33,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:33,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:33,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:33,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:33,033 INFO L87 Difference]: Start difference. First operand 386 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:51:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:33,174 INFO L93 Difference]: Finished difference Result 623 states and 1853 transitions. [2020-02-10 19:51:33,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:33,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:33,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:33,176 INFO L225 Difference]: With dead ends: 623 [2020-02-10 19:51:33,176 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 19:51:33,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:33,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 19:51:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 388. [2020-02-10 19:51:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1334 transitions. [2020-02-10 19:51:33,186 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1334 transitions. Word has length 22 [2020-02-10 19:51:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:33,187 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1334 transitions. [2020-02-10 19:51:33,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1334 transitions. [2020-02-10 19:51:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:33,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:33,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:33,187 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 19:51:33,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:33,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1600897204, now seen corresponding path program 1110 times [2020-02-10 19:51:33,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:33,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087036043] [2020-02-10 19:51:33,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:33,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 19:51:33,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087036043] [2020-02-10 19:51:33,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:33,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:33,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804885825] [2020-02-10 19:51:33,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:33,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:33,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:33,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:33,471 INFO L87 Difference]: Start difference. First operand 388 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:51:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:33,578 INFO L93 Difference]: Finished difference Result 622 states and 1849 transitions. [2020-02-10 19:51:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:33,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:33,580 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:51:33,580 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 19:51:33,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:33,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 19:51:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 383. [2020-02-10 19:51:33,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:51:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-02-10 19:51:33,591 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-02-10 19:51:33,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:33,591 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-02-10 19:51:33,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-02-10 19:51:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:33,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:33,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 19:51:33,592 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 19:51:33,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:33,592 INFO L82 PathProgramCache]: Analyzing trace with hash 686381098, now seen corresponding path program 1111 times [2020-02-10 19:51:33,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:33,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865334893] [2020-02-10 19:51:33,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:33,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 19:51:33,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865334893] [2020-02-10 19:51:33,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:33,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:33,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745266757] [2020-02-10 19:51:33,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:33,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:33,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:33,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:33,891 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:51:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:33,973 INFO L93 Difference]: Finished difference Result 638 states and 1888 transitions. [2020-02-10 19:51:33,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:33,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:33,975 INFO L225 Difference]: With dead ends: 638 [2020-02-10 19:51:33,976 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 19:51:33,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 19:51:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 19:51:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 391. [2020-02-10 19:51:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:51:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1344 transitions. [2020-02-10 19:51:33,985 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1344 transitions. Word has length 22 [2020-02-10 19:51:33,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:33,985 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1344 transitions. [2020-02-10 19:51:33,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1344 transitions. [2020-02-10 19:51:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:33,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:33,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 19:51:33,986 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 19:51:33,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:33,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2018320312, now seen corresponding path program 1112 times [2020-02-10 19:51:33,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:33,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795163005] [2020-02-10 19:51:33,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:34,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 19:51:34,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795163005] [2020-02-10 19:51:34,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:34,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:34,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380018929] [2020-02-10 19:51:34,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:34,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:34,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:34,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:34,274 INFO L87 Difference]: Start difference. First operand 391 states and 1344 transitions. Second operand 9 states. [2020-02-10 19:51:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:34,379 INFO L93 Difference]: Finished difference Result 633 states and 1875 transitions. [2020-02-10 19:51:34,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:34,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:34,381 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:51:34,381 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 19:51:34,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:34,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 19:51:34,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 387. [2020-02-10 19:51:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:51:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1334 transitions. [2020-02-10 19:51:34,391 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1334 transitions. Word has length 22 [2020-02-10 19:51:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:34,391 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1334 transitions. [2020-02-10 19:51:34,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1334 transitions. [2020-02-10 19:51:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:34,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:34,391 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:34,392 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 19:51:34,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:34,392 INFO L82 PathProgramCache]: Analyzing trace with hash -662295654, now seen corresponding path program 1113 times [2020-02-10 19:51:34,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:34,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611546485] [2020-02-10 19:51:34,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:34,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 19:51:34,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611546485] [2020-02-10 19:51:34,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:34,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:34,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855376568] [2020-02-10 19:51:34,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:34,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:34,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:34,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:34,692 INFO L87 Difference]: Start difference. First operand 387 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:51:34,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:34,771 INFO L93 Difference]: Finished difference Result 632 states and 1875 transitions. [2020-02-10 19:51:34,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:34,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:34,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:34,773 INFO L225 Difference]: With dead ends: 632 [2020-02-10 19:51:34,774 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:51:34,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 19:51:34,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:51:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 392. [2020-02-10 19:51:34,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:51:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1342 transitions. [2020-02-10 19:51:34,784 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1342 transitions. Word has length 22 [2020-02-10 19:51:34,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:34,784 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1342 transitions. [2020-02-10 19:51:34,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1342 transitions. [2020-02-10 19:51:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:34,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:34,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 19:51:34,785 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 19:51:34,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:34,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1931343740, now seen corresponding path program 1114 times [2020-02-10 19:51:34,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:34,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4222540] [2020-02-10 19:51:34,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:35,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 19:51:35,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4222540] [2020-02-10 19:51:35,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:35,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:35,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917704856] [2020-02-10 19:51:35,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:35,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:35,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:35,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:35,078 INFO L87 Difference]: Start difference. First operand 392 states and 1342 transitions. Second operand 9 states. [2020-02-10 19:51:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:35,183 INFO L93 Difference]: Finished difference Result 619 states and 1855 transitions. [2020-02-10 19:51:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:35,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:35,185 INFO L225 Difference]: With dead ends: 619 [2020-02-10 19:51:35,185 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:51:35,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 19:51:35,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:51:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 387. [2020-02-10 19:51:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:51:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1330 transitions. [2020-02-10 19:51:35,195 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1330 transitions. Word has length 22 [2020-02-10 19:51:35,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:35,195 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1330 transitions. [2020-02-10 19:51:35,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1330 transitions. [2020-02-10 19:51:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:35,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51: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 19:51:35,196 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 19:51:35,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:35,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1877592068, now seen corresponding path program 1115 times [2020-02-10 19:51:35,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:35,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459617462] [2020-02-10 19:51:35,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:35,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 19:51:35,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459617462] [2020-02-10 19:51:35,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:35,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:35,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884873512] [2020-02-10 19:51:35,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:35,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:35,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:35,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:35,484 INFO L87 Difference]: Start difference. First operand 387 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:51:35,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:35,598 INFO L93 Difference]: Finished difference Result 625 states and 1857 transitions. [2020-02-10 19:51:35,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:35,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:35,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:35,600 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:51:35,600 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 19:51:35,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 19:51:35,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 19:51:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 390. [2020-02-10 19:51:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:51:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1335 transitions. [2020-02-10 19:51:35,609 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1335 transitions. Word has length 22 [2020-02-10 19:51:35,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:35,610 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1335 transitions. [2020-02-10 19:51:35,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1335 transitions. [2020-02-10 19:51:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:35,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51: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 19:51:35,610 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 19:51:35,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1003851388, now seen corresponding path program 1116 times [2020-02-10 19:51:35,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:35,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281596454] [2020-02-10 19:51:35,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:35,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281596454] [2020-02-10 19:51:35,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:35,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:35,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702334923] [2020-02-10 19:51:35,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:35,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:35,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:35,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:35,903 INFO L87 Difference]: Start difference. First operand 390 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:51:36,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:36,009 INFO L93 Difference]: Finished difference Result 617 states and 1848 transitions. [2020-02-10 19:51:36,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:36,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:36,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:36,011 INFO L225 Difference]: With dead ends: 617 [2020-02-10 19:51:36,011 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:51:36,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 19:51:36,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:51:36,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 383. [2020-02-10 19:51:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:51:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1321 transitions. [2020-02-10 19:51:36,022 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1321 transitions. Word has length 22 [2020-02-10 19:51:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:36,022 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1321 transitions. [2020-02-10 19:51:36,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1321 transitions. [2020-02-10 19:51:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:36,022 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:36,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 19:51:36,023 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 19:51:36,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:36,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1948864378, now seen corresponding path program 1117 times [2020-02-10 19:51:36,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:36,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748423515] [2020-02-10 19:51:36,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:36,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 19:51:36,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748423515] [2020-02-10 19:51:36,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:36,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:36,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463314285] [2020-02-10 19:51:36,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:36,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:36,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:36,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:36,311 INFO L87 Difference]: Start difference. First operand 383 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:51:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:36,406 INFO L93 Difference]: Finished difference Result 633 states and 1871 transitions. [2020-02-10 19:51:36,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:36,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:36,408 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:51:36,408 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:51:36,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:36,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:51:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 389. [2020-02-10 19:51:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:51:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1335 transitions. [2020-02-10 19:51:36,417 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1335 transitions. Word has length 22 [2020-02-10 19:51:36,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:36,417 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1335 transitions. [2020-02-10 19:51:36,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1335 transitions. [2020-02-10 19:51:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:36,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:36,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 19:51:36,418 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 19:51:36,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:36,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2075500752, now seen corresponding path program 1118 times [2020-02-10 19:51:36,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:36,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781812634] [2020-02-10 19:51:36,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:36,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 19:51:36,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781812634] [2020-02-10 19:51:36,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:36,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:36,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360247926] [2020-02-10 19:51:36,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:36,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:36,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:36,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:36,706 INFO L87 Difference]: Start difference. First operand 389 states and 1335 transitions. Second operand 9 states. [2020-02-10 19:51:36,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:36,807 INFO L93 Difference]: Finished difference Result 627 states and 1857 transitions. [2020-02-10 19:51:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:36,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:36,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:36,809 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:51:36,810 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 19:51:36,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 19:51:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 386. [2020-02-10 19:51:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:51:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-02-10 19:51:36,819 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-02-10 19:51:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:36,819 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-02-10 19:51:36,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-02-10 19:51:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:36,820 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:36,820 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:36,820 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 19:51:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:36,820 INFO L82 PathProgramCache]: Analyzing trace with hash 873153222, now seen corresponding path program 1119 times [2020-02-10 19:51:36,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:36,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755567304] [2020-02-10 19:51:36,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:37,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 19:51:37,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755567304] [2020-02-10 19:51:37,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:37,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:37,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286671276] [2020-02-10 19:51:37,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:37,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:37,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:37,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:37,110 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:51:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:37,204 INFO L93 Difference]: Finished difference Result 629 states and 1864 transitions. [2020-02-10 19:51:37,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:37,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:37,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:37,206 INFO L225 Difference]: With dead ends: 629 [2020-02-10 19:51:37,206 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 19:51:37,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 19:51:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 19:51:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 391. [2020-02-10 19:51:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:51:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1336 transitions. [2020-02-10 19:51:37,216 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1336 transitions. Word has length 22 [2020-02-10 19:51:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:37,217 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1336 transitions. [2020-02-10 19:51:37,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1336 transitions. [2020-02-10 19:51:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:37,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:37,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:37,218 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 19:51:37,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:37,218 INFO L82 PathProgramCache]: Analyzing trace with hash 764653776, now seen corresponding path program 1120 times [2020-02-10 19:51:37,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:37,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244432500] [2020-02-10 19:51:37,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:37,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244432500] [2020-02-10 19:51:37,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:37,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:37,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525797025] [2020-02-10 19:51:37,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:37,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:37,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:37,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:37,514 INFO L87 Difference]: Start difference. First operand 391 states and 1336 transitions. Second operand 9 states. [2020-02-10 19:51:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:37,617 INFO L93 Difference]: Finished difference Result 616 states and 1844 transitions. [2020-02-10 19:51:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:37,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:37,619 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:51:37,619 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:51:37,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 19:51:37,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:51:37,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 386. [2020-02-10 19:51:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:51:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-02-10 19:51:37,629 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-02-10 19:51:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:37,630 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-02-10 19:51:37,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-02-10 19:51:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:37,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:37,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 19:51:37,630 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 19:51:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:37,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1146381164, now seen corresponding path program 1121 times [2020-02-10 19:51:37,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:37,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945790645] [2020-02-10 19:51:37,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:37,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 19:51:37,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945790645] [2020-02-10 19:51:37,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:37,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:37,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350266457] [2020-02-10 19:51:37,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:37,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:37,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:37,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:37,917 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:51:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:38,022 INFO L93 Difference]: Finished difference Result 620 states and 1842 transitions. [2020-02-10 19:51:38,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:38,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:38,024 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:51:38,024 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:51:38,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 19:51:38,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:51:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 388. [2020-02-10 19:51:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1328 transitions. [2020-02-10 19:51:38,034 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1328 transitions. Word has length 22 [2020-02-10 19:51:38,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:38,034 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1328 transitions. [2020-02-10 19:51:38,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:38,035 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1328 transitions. [2020-02-10 19:51:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:38,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:38,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 19:51:38,035 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 19:51:38,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:38,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1319628856, now seen corresponding path program 1122 times [2020-02-10 19:51:38,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:38,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599041979] [2020-02-10 19:51:38,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:38,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 19:51:38,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599041979] [2020-02-10 19:51:38,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:38,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:38,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755594239] [2020-02-10 19:51:38,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:38,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:38,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:38,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:38,320 INFO L87 Difference]: Start difference. First operand 388 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:51:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:38,438 INFO L93 Difference]: Finished difference Result 613 states and 1836 transitions. [2020-02-10 19:51:38,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:38,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:38,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:38,440 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:51:38,440 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:51:38,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 19:51:38,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:51:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 383. [2020-02-10 19:51:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:51:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 19:51:38,450 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 19:51:38,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:38,450 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 19:51:38,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:38,450 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 19:51:38,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:38,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:38,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 19:51:38,451 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 19:51:38,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:38,451 INFO L82 PathProgramCache]: Analyzing trace with hash 754574172, now seen corresponding path program 1123 times [2020-02-10 19:51:38,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:38,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231323757] [2020-02-10 19:51:38,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:38,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 19:51:38,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231323757] [2020-02-10 19:51:38,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:38,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:38,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900578297] [2020-02-10 19:51:38,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:38,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:38,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:38,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:38,748 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:51:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:38,861 INFO L93 Difference]: Finished difference Result 614 states and 1831 transitions. [2020-02-10 19:51:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:38,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:38,863 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:51:38,863 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 19:51:38,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 19:51:38,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 19:51:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 387. [2020-02-10 19:51:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:51:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-02-10 19:51:38,873 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-02-10 19:51:38,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:38,873 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-02-10 19:51:38,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-02-10 19:51:38,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:38,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:38,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 19:51:38,874 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 19:51:38,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:38,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2096506960, now seen corresponding path program 1124 times [2020-02-10 19:51:38,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:38,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43072170] [2020-02-10 19:51:38,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:39,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 19:51:39,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43072170] [2020-02-10 19:51:39,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:39,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:39,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246148472] [2020-02-10 19:51:39,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:39,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:39,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:39,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:39,163 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:51:39,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:39,268 INFO L93 Difference]: Finished difference Result 613 states and 1827 transitions. [2020-02-10 19:51:39,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:39,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:39,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:39,270 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:51:39,270 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 19:51:39,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:39,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 19:51:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 385. [2020-02-10 19:51:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:51:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-02-10 19:51:39,279 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-02-10 19:51:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:39,279 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-02-10 19:51:39,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-02-10 19:51:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:39,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:39,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 19:51:39,280 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 19:51:39,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:39,280 INFO L82 PathProgramCache]: Analyzing trace with hash -321136984, now seen corresponding path program 1125 times [2020-02-10 19:51:39,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:39,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380099409] [2020-02-10 19:51:39,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:39,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 19:51:39,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380099409] [2020-02-10 19:51:39,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:39,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:39,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30414406] [2020-02-10 19:51:39,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:39,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:39,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:39,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:39,582 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:51:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:39,683 INFO L93 Difference]: Finished difference Result 614 states and 1831 transitions. [2020-02-10 19:51:39,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:39,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:39,685 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:51:39,685 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 19:51:39,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 19:51:39,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 19:51:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 388. [2020-02-10 19:51:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1328 transitions. [2020-02-10 19:51:39,696 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1328 transitions. Word has length 22 [2020-02-10 19:51:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:39,696 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1328 transitions. [2020-02-10 19:51:39,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1328 transitions. [2020-02-10 19:51:39,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:39,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:39,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 19:51:39,697 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 19:51:39,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:39,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2145432152, now seen corresponding path program 1126 times [2020-02-10 19:51:39,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:39,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487239283] [2020-02-10 19:51:39,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:39,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 19:51:39,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487239283] [2020-02-10 19:51:39,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:39,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:39,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461536711] [2020-02-10 19:51:39,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:39,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:39,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:39,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:39,987 INFO L87 Difference]: Start difference. First operand 388 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:51:40,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:40,092 INFO L93 Difference]: Finished difference Result 606 states and 1822 transitions. [2020-02-10 19:51:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:40,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:40,094 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:51:40,095 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:51:40,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 19:51:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:51:40,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 385. [2020-02-10 19:51:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:51:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-02-10 19:51:40,104 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-02-10 19:51:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:40,104 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-02-10 19:51:40,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-02-10 19:51:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:40,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:40,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 19:51:40,105 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 19:51:40,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:40,105 INFO L82 PathProgramCache]: Analyzing trace with hash -52289576, now seen corresponding path program 1127 times [2020-02-10 19:51:40,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:40,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962752079] [2020-02-10 19:51:40,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:40,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 19:51:40,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962752079] [2020-02-10 19:51:40,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:40,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:40,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665588331] [2020-02-10 19:51:40,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:40,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:40,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:40,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:40,397 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:51:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:40,507 INFO L93 Difference]: Finished difference Result 612 states and 1824 transitions. [2020-02-10 19:51:40,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:40,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:40,509 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:51:40,510 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:51:40,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:51:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 387. [2020-02-10 19:51:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:51:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1324 transitions. [2020-02-10 19:51:40,520 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1324 transitions. Word has length 22 [2020-02-10 19:51:40,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:40,520 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1324 transitions. [2020-02-10 19:51:40,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1324 transitions. [2020-02-10 19:51:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:40,520 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:40,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 19:51:40,521 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 19:51:40,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:40,521 INFO L82 PathProgramCache]: Analyzing trace with hash -225537268, now seen corresponding path program 1128 times [2020-02-10 19:51:40,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:40,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044862485] [2020-02-10 19:51:40,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:40,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 19:51:40,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044862485] [2020-02-10 19:51:40,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:40,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:40,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440366760] [2020-02-10 19:51:40,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:40,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:40,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:40,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:40,805 INFO L87 Difference]: Start difference. First operand 387 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:51:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:40,911 INFO L93 Difference]: Finished difference Result 605 states and 1818 transitions. [2020-02-10 19:51:40,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:40,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:40,913 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:51:40,913 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:51:40,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 19:51:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:51:40,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 380. [2020-02-10 19:51:40,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:51:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1311 transitions. [2020-02-10 19:51:40,922 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1311 transitions. Word has length 22 [2020-02-10 19:51:40,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:40,922 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1311 transitions. [2020-02-10 19:51:40,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:40,922 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1311 transitions. [2020-02-10 19:51:40,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:40,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:40,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 19:51:40,923 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 19:51:40,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:40,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1701011146, now seen corresponding path program 1129 times [2020-02-10 19:51:40,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:40,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899976777] [2020-02-10 19:51:40,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:41,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 19:51:41,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899976777] [2020-02-10 19:51:41,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:41,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:41,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099657508] [2020-02-10 19:51:41,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:41,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:41,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:41,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:41,216 INFO L87 Difference]: Start difference. First operand 380 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:51:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:41,296 INFO L93 Difference]: Finished difference Result 666 states and 1963 transitions. [2020-02-10 19:51:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:41,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:41,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:41,298 INFO L225 Difference]: With dead ends: 666 [2020-02-10 19:51:41,298 INFO L226 Difference]: Without dead ends: 650 [2020-02-10 19:51:41,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-02-10 19:51:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 394. [2020-02-10 19:51:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:51:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1354 transitions. [2020-02-10 19:51:41,308 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1354 transitions. Word has length 22 [2020-02-10 19:51:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:41,308 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1354 transitions. [2020-02-10 19:51:41,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1354 transitions. [2020-02-10 19:51:41,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:41,309 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:41,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 19:51:41,309 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 19:51:41,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:41,309 INFO L82 PathProgramCache]: Analyzing trace with hash -110745260, now seen corresponding path program 1130 times [2020-02-10 19:51:41,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:41,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424055361] [2020-02-10 19:51:41,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:41,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 19:51:41,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424055361] [2020-02-10 19:51:41,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:41,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:41,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948362716] [2020-02-10 19:51:41,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:41,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:41,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:41,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:41,607 INFO L87 Difference]: Start difference. First operand 394 states and 1354 transitions. Second operand 9 states. [2020-02-10 19:51:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:41,709 INFO L93 Difference]: Finished difference Result 661 states and 1950 transitions. [2020-02-10 19:51:41,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:41,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:41,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:41,711 INFO L225 Difference]: With dead ends: 661 [2020-02-10 19:51:41,711 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 19:51:41,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 19:51:41,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 390. [2020-02-10 19:51:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:51:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1344 transitions. [2020-02-10 19:51:41,720 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1344 transitions. Word has length 22 [2020-02-10 19:51:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:41,720 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1344 transitions. [2020-02-10 19:51:41,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1344 transitions. [2020-02-10 19:51:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:41,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:41,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:41,721 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 19:51:41,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:41,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1435960282, now seen corresponding path program 1131 times [2020-02-10 19:51:41,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:41,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58097274] [2020-02-10 19:51:41,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:42,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 19:51:42,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58097274] [2020-02-10 19:51:42,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:42,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:42,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179000227] [2020-02-10 19:51:42,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:42,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:42,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:42,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:42,023 INFO L87 Difference]: Start difference. First operand 390 states and 1344 transitions. Second operand 9 states. [2020-02-10 19:51:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:42,098 INFO L93 Difference]: Finished difference Result 673 states and 1975 transitions. [2020-02-10 19:51:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:42,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:42,100 INFO L225 Difference]: With dead ends: 673 [2020-02-10 19:51:42,100 INFO L226 Difference]: Without dead ends: 657 [2020-02-10 19:51:42,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 19:51:42,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-02-10 19:51:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 398. [2020-02-10 19:51:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:51:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1357 transitions. [2020-02-10 19:51:42,111 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1357 transitions. Word has length 22 [2020-02-10 19:51:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:42,111 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1357 transitions. [2020-02-10 19:51:42,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1357 transitions. [2020-02-10 19:51:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:42,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:42,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 19:51:42,112 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 19:51:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1361435464, now seen corresponding path program 1132 times [2020-02-10 19:51:42,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:42,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17140930] [2020-02-10 19:51:42,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:42,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 19:51:42,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17140930] [2020-02-10 19:51:42,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:42,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:42,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845551680] [2020-02-10 19:51:42,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:42,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:42,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:42,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:42,408 INFO L87 Difference]: Start difference. First operand 398 states and 1357 transitions. Second operand 9 states. [2020-02-10 19:51:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:42,525 INFO L93 Difference]: Finished difference Result 671 states and 1965 transitions. [2020-02-10 19:51:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:42,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:42,528 INFO L225 Difference]: With dead ends: 671 [2020-02-10 19:51:42,528 INFO L226 Difference]: Without dead ends: 649 [2020-02-10 19:51:42,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:42,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2020-02-10 19:51:42,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 390. [2020-02-10 19:51:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:51:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1339 transitions. [2020-02-10 19:51:42,546 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1339 transitions. Word has length 22 [2020-02-10 19:51:42,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:42,547 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1339 transitions. [2020-02-10 19:51:42,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1339 transitions. [2020-02-10 19:51:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:42,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:42,547 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:42,547 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 19:51:42,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:42,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1643710600, now seen corresponding path program 1133 times [2020-02-10 19:51:42,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:42,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155586925] [2020-02-10 19:51:42,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:42,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 19:51:42,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155586925] [2020-02-10 19:51:42,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:42,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:42,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165584996] [2020-02-10 19:51:42,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:42,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:42,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:42,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:42,845 INFO L87 Difference]: Start difference. First operand 390 states and 1339 transitions. Second operand 9 states. [2020-02-10 19:51:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:42,960 INFO L93 Difference]: Finished difference Result 658 states and 1940 transitions. [2020-02-10 19:51:42,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:42,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:42,963 INFO L225 Difference]: With dead ends: 658 [2020-02-10 19:51:42,963 INFO L226 Difference]: Without dead ends: 647 [2020-02-10 19:51:42,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:42,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-02-10 19:51:42,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 393. [2020-02-10 19:51:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:51:42,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1344 transitions. [2020-02-10 19:51:42,973 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1344 transitions. Word has length 22 [2020-02-10 19:51:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:42,973 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1344 transitions. [2020-02-10 19:51:42,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1344 transitions. [2020-02-10 19:51:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:42,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:42,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 19:51:42,974 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 19:51:42,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:42,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1662144626, now seen corresponding path program 1134 times [2020-02-10 19:51:42,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:42,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340567642] [2020-02-10 19:51:42,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:43,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340567642] [2020-02-10 19:51:43,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:43,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:43,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366374762] [2020-02-10 19:51:43,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:43,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:43,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:43,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:43,261 INFO L87 Difference]: Start difference. First operand 393 states and 1344 transitions. Second operand 9 states. [2020-02-10 19:51:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:43,370 INFO L93 Difference]: Finished difference Result 661 states and 1943 transitions. [2020-02-10 19:51:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:43,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:43,372 INFO L225 Difference]: With dead ends: 661 [2020-02-10 19:51:43,372 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 19:51:43,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 19:51:43,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 385. [2020-02-10 19:51:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:51:43,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1327 transitions. [2020-02-10 19:51:43,381 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1327 transitions. Word has length 22 [2020-02-10 19:51:43,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:43,381 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1327 transitions. [2020-02-10 19:51:43,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1327 transitions. [2020-02-10 19:51:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:43,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:43,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 19:51:43,382 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 19:51:43,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:43,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2123496872, now seen corresponding path program 1135 times [2020-02-10 19:51:43,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:43,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158099738] [2020-02-10 19:51:43,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:43,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 19:51:43,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158099738] [2020-02-10 19:51:43,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:43,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:43,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689487355] [2020-02-10 19:51:43,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:43,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:43,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:43,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:43,679 INFO L87 Difference]: Start difference. First operand 385 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:51:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:43,758 INFO L93 Difference]: Finished difference Result 656 states and 1935 transitions. [2020-02-10 19:51:43,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:43,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:43,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:43,760 INFO L225 Difference]: With dead ends: 656 [2020-02-10 19:51:43,760 INFO L226 Difference]: Without dead ends: 640 [2020-02-10 19:51:43,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 19:51:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-02-10 19:51:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 393. [2020-02-10 19:51:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:51:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1347 transitions. [2020-02-10 19:51:43,771 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1347 transitions. Word has length 22 [2020-02-10 19:51:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:43,771 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1347 transitions. [2020-02-10 19:51:43,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1347 transitions. [2020-02-10 19:51:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:43,772 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:43,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 19:51:43,772 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 19:51:43,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:43,772 INFO L82 PathProgramCache]: Analyzing trace with hash -533230986, now seen corresponding path program 1136 times [2020-02-10 19:51:43,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:43,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876640494] [2020-02-10 19:51:43,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:44,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 19:51:44,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876640494] [2020-02-10 19:51:44,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:44,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:44,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962657644] [2020-02-10 19:51:44,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:44,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:44,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:44,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:44,058 INFO L87 Difference]: Start difference. First operand 393 states and 1347 transitions. Second operand 9 states. [2020-02-10 19:51:44,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:44,165 INFO L93 Difference]: Finished difference Result 651 states and 1922 transitions. [2020-02-10 19:51:44,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:44,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:44,167 INFO L225 Difference]: With dead ends: 651 [2020-02-10 19:51:44,167 INFO L226 Difference]: Without dead ends: 636 [2020-02-10 19:51:44,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-02-10 19:51:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 389. [2020-02-10 19:51:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:51:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1337 transitions. [2020-02-10 19:51:44,178 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1337 transitions. Word has length 22 [2020-02-10 19:51:44,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:44,178 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1337 transitions. [2020-02-10 19:51:44,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1337 transitions. [2020-02-10 19:51:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:44,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:44,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 19:51:44,178 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 19:51:44,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:44,179 INFO L82 PathProgramCache]: Analyzing trace with hash 822793672, now seen corresponding path program 1137 times [2020-02-10 19:51:44,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:44,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050621539] [2020-02-10 19:51:44,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:44,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 19:51:44,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050621539] [2020-02-10 19:51:44,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:44,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:44,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375084867] [2020-02-10 19:51:44,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:44,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:44,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:44,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:44,482 INFO L87 Difference]: Start difference. First operand 389 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:51:44,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:44,561 INFO L93 Difference]: Finished difference Result 650 states and 1922 transitions. [2020-02-10 19:51:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:44,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:44,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:44,565 INFO L225 Difference]: With dead ends: 650 [2020-02-10 19:51:44,565 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 19:51:44,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 19:51:44,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 19:51:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 394. [2020-02-10 19:51:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:51:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1345 transitions. [2020-02-10 19:51:44,576 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1345 transitions. Word has length 22 [2020-02-10 19:51:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:44,576 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1345 transitions. [2020-02-10 19:51:44,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1345 transitions. [2020-02-10 19:51:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:44,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:44,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 19:51:44,577 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 19:51:44,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:44,577 INFO L82 PathProgramCache]: Analyzing trace with hash -878534230, now seen corresponding path program 1138 times [2020-02-10 19:51:44,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:44,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665190818] [2020-02-10 19:51:44,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:44,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 19:51:44,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665190818] [2020-02-10 19:51:44,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:44,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:44,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049652040] [2020-02-10 19:51:44,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:44,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:44,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:44,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:44,872 INFO L87 Difference]: Start difference. First operand 394 states and 1345 transitions. Second operand 9 states. [2020-02-10 19:51:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:44,978 INFO L93 Difference]: Finished difference Result 637 states and 1902 transitions. [2020-02-10 19:51:44,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:44,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:44,980 INFO L225 Difference]: With dead ends: 637 [2020-02-10 19:51:44,980 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 19:51:44,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 19:51:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 19:51:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 389. [2020-02-10 19:51:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:51:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1333 transitions. [2020-02-10 19:51:44,990 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1333 transitions. Word has length 22 [2020-02-10 19:51:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:44,990 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1333 transitions. [2020-02-10 19:51:44,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1333 transitions. [2020-02-10 19:51:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:44,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:44,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 19:51:44,991 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 19:51:44,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:44,991 INFO L82 PathProgramCache]: Analyzing trace with hash -392502742, now seen corresponding path program 1139 times [2020-02-10 19:51:44,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:44,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553088900] [2020-02-10 19:51:44,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:45,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 19:51:45,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553088900] [2020-02-10 19:51:45,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:45,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:45,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844789884] [2020-02-10 19:51:45,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:45,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:45,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:45,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:45,286 INFO L87 Difference]: Start difference. First operand 389 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:51:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:45,406 INFO L93 Difference]: Finished difference Result 643 states and 1904 transitions. [2020-02-10 19:51:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:45,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:45,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:45,408 INFO L225 Difference]: With dead ends: 643 [2020-02-10 19:51:45,409 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 19:51:45,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 19:51:45,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 392. [2020-02-10 19:51:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:51:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1338 transitions. [2020-02-10 19:51:45,418 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1338 transitions. Word has length 22 [2020-02-10 19:51:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:45,419 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1338 transitions. [2020-02-10 19:51:45,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1338 transitions. [2020-02-10 19:51:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:45,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:45,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 19:51:45,419 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 19:51:45,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:45,420 INFO L82 PathProgramCache]: Analyzing trace with hash 481237938, now seen corresponding path program 1140 times [2020-02-10 19:51:45,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:45,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28995716] [2020-02-10 19:51:45,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:45,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 19:51:45,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28995716] [2020-02-10 19:51:45,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:45,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:45,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741545988] [2020-02-10 19:51:45,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:45,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:45,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:45,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:45,744 INFO L87 Difference]: Start difference. First operand 392 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:51:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:45,852 INFO L93 Difference]: Finished difference Result 635 states and 1895 transitions. [2020-02-10 19:51:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:45,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:45,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:45,854 INFO L225 Difference]: With dead ends: 635 [2020-02-10 19:51:45,854 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:51:45,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 19:51:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:51:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 385. [2020-02-10 19:51:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:51:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-02-10 19:51:45,863 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-02-10 19:51:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:45,864 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-02-10 19:51:45,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-02-10 19:51:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:45,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51: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 19:51:45,864 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 19:51:45,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:45,865 INFO L82 PathProgramCache]: Analyzing trace with hash -295266634, now seen corresponding path program 1141 times [2020-02-10 19:51:45,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:45,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417459566] [2020-02-10 19:51:45,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:46,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 19:51:46,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417459566] [2020-02-10 19:51:46,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:46,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:46,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497900232] [2020-02-10 19:51:46,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:46,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:46,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:46,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:46,168 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:51:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:46,251 INFO L93 Difference]: Finished difference Result 669 states and 1962 transitions. [2020-02-10 19:51:46,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:46,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:46,254 INFO L225 Difference]: With dead ends: 669 [2020-02-10 19:51:46,254 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 19:51:46,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 19:51:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 19:51:46,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 399. [2020-02-10 19:51:46,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-02-10 19:51:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1356 transitions. [2020-02-10 19:51:46,264 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1356 transitions. Word has length 22 [2020-02-10 19:51:46,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:46,264 INFO L479 AbstractCegarLoop]: Abstraction has 399 states and 1356 transitions. [2020-02-10 19:51:46,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:46,264 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1356 transitions. [2020-02-10 19:51:46,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:46,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:46,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 19:51:46,265 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 19:51:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:46,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1792838184, now seen corresponding path program 1142 times [2020-02-10 19:51:46,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:46,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130666002] [2020-02-10 19:51:46,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51: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 19:51:46,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130666002] [2020-02-10 19:51:46,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:46,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:46,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48230417] [2020-02-10 19:51:46,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:46,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:46,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:46,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:46,569 INFO L87 Difference]: Start difference. First operand 399 states and 1356 transitions. Second operand 9 states. [2020-02-10 19:51:46,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:46,677 INFO L93 Difference]: Finished difference Result 667 states and 1952 transitions. [2020-02-10 19:51:46,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:46,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:46,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:46,679 INFO L225 Difference]: With dead ends: 667 [2020-02-10 19:51:46,679 INFO L226 Difference]: Without dead ends: 645 [2020-02-10 19:51:46,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 19:51:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-02-10 19:51:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 391. [2020-02-10 19:51:46,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:51:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1337 transitions. [2020-02-10 19:51:46,689 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1337 transitions. Word has length 22 [2020-02-10 19:51:46,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:46,689 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1337 transitions. [2020-02-10 19:51:46,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1337 transitions. [2020-02-10 19:51:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:46,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:46,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 19:51:46,690 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 19:51:46,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:46,690 INFO L82 PathProgramCache]: Analyzing trace with hash 449435864, now seen corresponding path program 1143 times [2020-02-10 19:51:46,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:46,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456701128] [2020-02-10 19:51:46,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:46,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 19:51:46,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456701128] [2020-02-10 19:51:46,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:46,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:46,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721772992] [2020-02-10 19:51:46,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:46,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:46,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:46,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:46,995 INFO L87 Difference]: Start difference. First operand 391 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:51:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:47,092 INFO L93 Difference]: Finished difference Result 656 states and 1931 transitions. [2020-02-10 19:51:47,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:47,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:47,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:47,094 INFO L225 Difference]: With dead ends: 656 [2020-02-10 19:51:47,094 INFO L226 Difference]: Without dead ends: 640 [2020-02-10 19:51:47,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 19:51:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-02-10 19:51:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 396. [2020-02-10 19:51:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:51:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1345 transitions. [2020-02-10 19:51:47,105 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1345 transitions. Word has length 22 [2020-02-10 19:51:47,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:47,105 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1345 transitions. [2020-02-10 19:51:47,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1345 transitions. [2020-02-10 19:51:47,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:47,106 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:47,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 19:51:47,106 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 19:51:47,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:47,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1251892038, now seen corresponding path program 1144 times [2020-02-10 19:51:47,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:47,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217375322] [2020-02-10 19:51:47,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:47,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 19:51:47,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217375322] [2020-02-10 19:51:47,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:47,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:47,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398133399] [2020-02-10 19:51:47,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:47,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:47,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:47,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:47,397 INFO L87 Difference]: Start difference. First operand 396 states and 1345 transitions. Second operand 9 states. [2020-02-10 19:51:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:47,506 INFO L93 Difference]: Finished difference Result 643 states and 1911 transitions. [2020-02-10 19:51:47,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:47,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:47,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:47,508 INFO L225 Difference]: With dead ends: 643 [2020-02-10 19:51:47,508 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 19:51:47,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 19:51:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 19:51:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 391. [2020-02-10 19:51:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:51:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1332 transitions. [2020-02-10 19:51:47,517 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1332 transitions. Word has length 22 [2020-02-10 19:51:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:47,517 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1332 transitions. [2020-02-10 19:51:47,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1332 transitions. [2020-02-10 19:51:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:47,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:47,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 19:51:47,518 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 19:51:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2129059412, now seen corresponding path program 1145 times [2020-02-10 19:51:47,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:47,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952067520] [2020-02-10 19:51:47,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:47,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 19:51:47,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952067520] [2020-02-10 19:51:47,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:47,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:47,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946143393] [2020-02-10 19:51:47,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:47,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:47,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:47,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:47,807 INFO L87 Difference]: Start difference. First operand 391 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:51:47,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:47,913 INFO L93 Difference]: Finished difference Result 653 states and 1921 transitions. [2020-02-10 19:51:47,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:47,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:47,915 INFO L225 Difference]: With dead ends: 653 [2020-02-10 19:51:47,916 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 19:51:47,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:47,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 19:51:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 395. [2020-02-10 19:51:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:51:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1339 transitions. [2020-02-10 19:51:47,924 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1339 transitions. Word has length 22 [2020-02-10 19:51:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:47,924 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1339 transitions. [2020-02-10 19:51:47,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:47,924 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1339 transitions. [2020-02-10 19:51:47,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:47,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:47,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 19:51:47,925 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 19:51:47,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:47,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1307033354, now seen corresponding path program 1146 times [2020-02-10 19:51:47,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:47,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772658489] [2020-02-10 19:51:47,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:48,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 19:51:48,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772658489] [2020-02-10 19:51:48,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:48,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:48,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334957050] [2020-02-10 19:51:48,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:48,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:48,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:48,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:48,209 INFO L87 Difference]: Start difference. First operand 395 states and 1339 transitions. Second operand 9 states. [2020-02-10 19:51:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:48,316 INFO L93 Difference]: Finished difference Result 642 states and 1905 transitions. [2020-02-10 19:51:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:48,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:48,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:48,318 INFO L225 Difference]: With dead ends: 642 [2020-02-10 19:51:48,318 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 19:51:48,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 19:51:48,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 385. [2020-02-10 19:51:48,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:51:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1318 transitions. [2020-02-10 19:51:48,329 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1318 transitions. Word has length 22 [2020-02-10 19:51:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:48,329 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1318 transitions. [2020-02-10 19:51:48,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1318 transitions. [2020-02-10 19:51:48,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:48,329 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:48,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 19:51:48,330 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 19:51:48,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1711318868, now seen corresponding path program 1147 times [2020-02-10 19:51:48,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:48,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304976053] [2020-02-10 19:51:48,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:48,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304976053] [2020-02-10 19:51:48,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:48,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:48,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582271140] [2020-02-10 19:51:48,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:48,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:48,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:48,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:48,621 INFO L87 Difference]: Start difference. First operand 385 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:51:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:48,734 INFO L93 Difference]: Finished difference Result 644 states and 1904 transitions. [2020-02-10 19:51:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:48,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:48,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:48,736 INFO L225 Difference]: With dead ends: 644 [2020-02-10 19:51:48,736 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 19:51:48,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 19:51:48,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 19:51:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 391. [2020-02-10 19:51:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:51:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1334 transitions. [2020-02-10 19:51:48,746 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1334 transitions. Word has length 22 [2020-02-10 19:51:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:48,746 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1334 transitions. [2020-02-10 19:51:48,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1334 transitions. [2020-02-10 19:51:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:48,747 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:48,747 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:48,747 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 19:51:48,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:48,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1729752894, now seen corresponding path program 1148 times [2020-02-10 19:51:48,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:48,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324563088] [2020-02-10 19:51:48,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:49,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 19:51:49,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324563088] [2020-02-10 19:51:49,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:49,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:49,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104013783] [2020-02-10 19:51:49,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:49,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:49,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:49,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:49,031 INFO L87 Difference]: Start difference. First operand 391 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:51:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:49,140 INFO L93 Difference]: Finished difference Result 647 states and 1907 transitions. [2020-02-10 19:51:49,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:49,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:49,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:49,142 INFO L225 Difference]: With dead ends: 647 [2020-02-10 19:51:49,142 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 19:51:49,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:49,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 19:51:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 388. [2020-02-10 19:51:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1326 transitions. [2020-02-10 19:51:49,151 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1326 transitions. Word has length 22 [2020-02-10 19:51:49,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:49,151 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1326 transitions. [2020-02-10 19:51:49,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:49,151 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1326 transitions. [2020-02-10 19:51:49,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:49,152 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:49,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 19:51:49,152 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 19:51:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:49,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1838945930, now seen corresponding path program 1149 times [2020-02-10 19:51:49,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:49,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952893196] [2020-02-10 19:51:49,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:49,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 19:51:49,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952893196] [2020-02-10 19:51:49,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:49,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:49,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957515082] [2020-02-10 19:51:49,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:49,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:49,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:49,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:49,439 INFO L87 Difference]: Start difference. First operand 388 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:51:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:49,553 INFO L93 Difference]: Finished difference Result 639 states and 1892 transitions. [2020-02-10 19:51:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:49,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:49,555 INFO L225 Difference]: With dead ends: 639 [2020-02-10 19:51:49,555 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 19:51:49,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:49,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 19:51:49,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 391. [2020-02-10 19:51:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:51:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1331 transitions. [2020-02-10 19:51:49,565 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1331 transitions. Word has length 22 [2020-02-10 19:51:49,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:49,565 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1331 transitions. [2020-02-10 19:51:49,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1331 transitions. [2020-02-10 19:51:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:49,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:49,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:49,566 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 19:51:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:49,566 INFO L82 PathProgramCache]: Analyzing trace with hash -965205250, now seen corresponding path program 1150 times [2020-02-10 19:51:49,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:49,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471478325] [2020-02-10 19:51:49,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:49,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 19:51:49,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471478325] [2020-02-10 19:51:49,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:49,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:49,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607559051] [2020-02-10 19:51:49,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:49,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:49,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:49,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:49,853 INFO L87 Difference]: Start difference. First operand 391 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:51:49,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:49,962 INFO L93 Difference]: Finished difference Result 631 states and 1883 transitions. [2020-02-10 19:51:49,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:49,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:49,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:49,964 INFO L225 Difference]: With dead ends: 631 [2020-02-10 19:51:49,964 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:51:49,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:51:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 388. [2020-02-10 19:51:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1323 transitions. [2020-02-10 19:51:49,974 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1323 transitions. Word has length 22 [2020-02-10 19:51:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:49,974 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1323 transitions. [2020-02-10 19:51:49,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1323 transitions. [2020-02-10 19:51:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:49,975 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:49,975 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:49,975 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 19:51:49,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:49,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1249057098, now seen corresponding path program 1151 times [2020-02-10 19:51:49,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:49,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031023735] [2020-02-10 19:51:49,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:50,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 19:51:50,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031023735] [2020-02-10 19:51:50,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:50,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:50,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859237178] [2020-02-10 19:51:50,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:50,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:50,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:50,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:50,259 INFO L87 Difference]: Start difference. First operand 388 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:51:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:50,368 INFO L93 Difference]: Finished difference Result 643 states and 1898 transitions. [2020-02-10 19:51:50,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:50,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:50,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:50,370 INFO L225 Difference]: With dead ends: 643 [2020-02-10 19:51:50,370 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 19:51:50,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 19:51:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 19:51:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 392. [2020-02-10 19:51:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:51:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1330 transitions. [2020-02-10 19:51:50,380 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1330 transitions. Word has length 22 [2020-02-10 19:51:50,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:50,380 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1330 transitions. [2020-02-10 19:51:50,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1330 transitions. [2020-02-10 19:51:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:50,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:50,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:50,381 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 19:51:50,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:50,381 INFO L82 PathProgramCache]: Analyzing trace with hash -393750444, now seen corresponding path program 1152 times [2020-02-10 19:51:50,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:50,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506719277] [2020-02-10 19:51:50,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:50,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 19:51:50,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506719277] [2020-02-10 19:51:50,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:50,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:50,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704076688] [2020-02-10 19:51:50,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:50,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:50,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:50,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:50,662 INFO L87 Difference]: Start difference. First operand 392 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:51:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:50,774 INFO L93 Difference]: Finished difference Result 632 states and 1882 transitions. [2020-02-10 19:51:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:50,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:50,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:50,776 INFO L225 Difference]: With dead ends: 632 [2020-02-10 19:51:50,776 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 19:51:50,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 19:51:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 19:51:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 380. [2020-02-10 19:51:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:51:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1307 transitions. [2020-02-10 19:51:50,787 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1307 transitions. Word has length 22 [2020-02-10 19:51:50,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:50,787 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1307 transitions. [2020-02-10 19:51:50,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1307 transitions. [2020-02-10 19:51:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:50,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:50,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 19:51:50,788 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 19:51:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:50,788 INFO L82 PathProgramCache]: Analyzing trace with hash 884841890, now seen corresponding path program 1153 times [2020-02-10 19:51:50,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:50,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406716499] [2020-02-10 19:51:50,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:51,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 19:51:51,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406716499] [2020-02-10 19:51:51,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:51,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:51,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528445092] [2020-02-10 19:51:51,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:51,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:51,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:51,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:51,051 INFO L87 Difference]: Start difference. First operand 380 states and 1307 transitions. Second operand 9 states. [2020-02-10 19:51:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:51,132 INFO L93 Difference]: Finished difference Result 653 states and 1918 transitions. [2020-02-10 19:51:51,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:51,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:51,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:51,134 INFO L225 Difference]: With dead ends: 653 [2020-02-10 19:51:51,134 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 19:51:51,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 19:51:51,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 19:51:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 391. [2020-02-10 19:51:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:51:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1339 transitions. [2020-02-10 19:51:51,149 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1339 transitions. Word has length 22 [2020-02-10 19:51:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:51,150 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1339 transitions. [2020-02-10 19:51:51,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1339 transitions. [2020-02-10 19:51:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:51,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:51,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 19:51:51,150 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 19:51:51,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:51,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1011478264, now seen corresponding path program 1154 times [2020-02-10 19:51:51,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:51,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247260261] [2020-02-10 19:51:51,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:51,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 19:51:51,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247260261] [2020-02-10 19:51:51,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:51,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:51,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444819478] [2020-02-10 19:51:51,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:51,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:51,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:51,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:51,410 INFO L87 Difference]: Start difference. First operand 391 states and 1339 transitions. Second operand 9 states. [2020-02-10 19:51:51,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:51,519 INFO L93 Difference]: Finished difference Result 647 states and 1904 transitions. [2020-02-10 19:51:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:51,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:51,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:51,521 INFO L225 Difference]: With dead ends: 647 [2020-02-10 19:51:51,521 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 19:51:51,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 19:51:51,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 388. [2020-02-10 19:51:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1332 transitions. [2020-02-10 19:51:51,531 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1332 transitions. Word has length 22 [2020-02-10 19:51:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:51,531 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1332 transitions. [2020-02-10 19:51:51,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1332 transitions. [2020-02-10 19:51:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:51,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51: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 19:51:51,532 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 19:51:51,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:51,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1801810224, now seen corresponding path program 1155 times [2020-02-10 19:51:51,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:51,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586525504] [2020-02-10 19:51:51,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:51,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 19:51:51,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586525504] [2020-02-10 19:51:51,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:51,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:51,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787905961] [2020-02-10 19:51:51,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:51,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:51,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:51,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:51,815 INFO L87 Difference]: Start difference. First operand 388 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:51:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:51,895 INFO L93 Difference]: Finished difference Result 662 states and 1936 transitions. [2020-02-10 19:51:51,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:51,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:51,897 INFO L225 Difference]: With dead ends: 662 [2020-02-10 19:51:51,897 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 19:51:51,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:51,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 19:51:51,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 396. [2020-02-10 19:51:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:51:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1345 transitions. [2020-02-10 19:51:51,915 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1345 transitions. Word has length 22 [2020-02-10 19:51:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:51,915 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1345 transitions. [2020-02-10 19:51:51,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1345 transitions. [2020-02-10 19:51:51,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:51,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:51,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 19:51:51,916 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 19:51:51,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:51,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1843711480, now seen corresponding path program 1156 times [2020-02-10 19:51:51,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:51,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922532527] [2020-02-10 19:51:51,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:52,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 19:51:52,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922532527] [2020-02-10 19:51:52,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:52,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:52,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118135937] [2020-02-10 19:51:52,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:52,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:52,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:52,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:52,195 INFO L87 Difference]: Start difference. First operand 396 states and 1345 transitions. Second operand 9 states. [2020-02-10 19:51:52,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:52,310 INFO L93 Difference]: Finished difference Result 660 states and 1926 transitions. [2020-02-10 19:51:52,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:52,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:52,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:52,312 INFO L225 Difference]: With dead ends: 660 [2020-02-10 19:51:52,312 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 19:51:52,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 19:51:52,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 19:51:52,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 388. [2020-02-10 19:51:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1328 transitions. [2020-02-10 19:51:52,323 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1328 transitions. Word has length 22 [2020-02-10 19:51:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:52,323 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1328 transitions. [2020-02-10 19:51:52,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1328 transitions. [2020-02-10 19:51:52,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:52,324 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:52,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 19:51:52,324 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 19:51:52,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:52,324 INFO L82 PathProgramCache]: Analyzing trace with hash 473622686, now seen corresponding path program 1157 times [2020-02-10 19:51:52,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:52,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98813521] [2020-02-10 19:51:52,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:52,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 19:51:52,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98813521] [2020-02-10 19:51:52,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:52,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:52,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902500816] [2020-02-10 19:51:52,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:52,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:52,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:52,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:52,590 INFO L87 Difference]: Start difference. First operand 388 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:51:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:52,704 INFO L93 Difference]: Finished difference Result 644 states and 1895 transitions. [2020-02-10 19:51:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:52,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:52,706 INFO L225 Difference]: With dead ends: 644 [2020-02-10 19:51:52,706 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 19:51:52,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 19:51:52,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 19:51:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 390. [2020-02-10 19:51:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:51:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1331 transitions. [2020-02-10 19:51:52,716 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1331 transitions. Word has length 22 [2020-02-10 19:51:52,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:52,716 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1331 transitions. [2020-02-10 19:51:52,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1331 transitions. [2020-02-10 19:51:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:52,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:52,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 19:51:52,717 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 19:51:52,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:52,717 INFO L82 PathProgramCache]: Analyzing trace with hash -444327504, now seen corresponding path program 1158 times [2020-02-10 19:51:52,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:52,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340854809] [2020-02-10 19:51:52,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:52,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 19:51:53,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340854809] [2020-02-10 19:51:53,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:53,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:53,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916742486] [2020-02-10 19:51:53,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:53,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:53,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:53,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:53,000 INFO L87 Difference]: Start difference. First operand 390 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:51:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:53,113 INFO L93 Difference]: Finished difference Result 648 states and 1901 transitions. [2020-02-10 19:51:53,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:53,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:53,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:53,115 INFO L225 Difference]: With dead ends: 648 [2020-02-10 19:51:53,115 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 19:51:53,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:53,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 19:51:53,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 384. [2020-02-10 19:51:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:51:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-02-10 19:51:53,125 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-02-10 19:51:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:53,125 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-02-10 19:51:53,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:53,125 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-02-10 19:51:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:53,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:53,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:53,126 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 19:51:53,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:53,126 INFO L82 PathProgramCache]: Analyzing trace with hash -715595964, now seen corresponding path program 1159 times [2020-02-10 19:51:53,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:53,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824218480] [2020-02-10 19:51:53,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:53,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824218480] [2020-02-10 19:51:53,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:53,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:53,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734363172] [2020-02-10 19:51:53,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:53,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:53,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:53,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:53,393 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:51:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:53,484 INFO L93 Difference]: Finished difference Result 644 states and 1894 transitions. [2020-02-10 19:51:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:53,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:53,486 INFO L225 Difference]: With dead ends: 644 [2020-02-10 19:51:53,486 INFO L226 Difference]: Without dead ends: 628 [2020-02-10 19:51:53,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 19:51:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-02-10 19:51:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 390. [2020-02-10 19:51:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:51:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1333 transitions. [2020-02-10 19:51:53,496 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1333 transitions. Word has length 22 [2020-02-10 19:51:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:53,496 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1333 transitions. [2020-02-10 19:51:53,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:53,496 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1333 transitions. [2020-02-10 19:51:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:53,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:53,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 19:51:53,497 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 19:51:53,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:53,497 INFO L82 PathProgramCache]: Analyzing trace with hash -588959590, now seen corresponding path program 1160 times [2020-02-10 19:51:53,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:53,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245038730] [2020-02-10 19:51:53,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:53,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 19:51:53,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245038730] [2020-02-10 19:51:53,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:53,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:53,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406859994] [2020-02-10 19:51:53,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:53,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:53,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:53,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:53,758 INFO L87 Difference]: Start difference. First operand 390 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:51:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:53,868 INFO L93 Difference]: Finished difference Result 638 states and 1880 transitions. [2020-02-10 19:51:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:53,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:53,870 INFO L225 Difference]: With dead ends: 638 [2020-02-10 19:51:53,870 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 19:51:53,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 19:51:53,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 19:51:53,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 387. [2020-02-10 19:51:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:51:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1326 transitions. [2020-02-10 19:51:53,880 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1326 transitions. Word has length 22 [2020-02-10 19:51:53,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:53,880 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1326 transitions. [2020-02-10 19:51:53,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1326 transitions. [2020-02-10 19:51:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:53,881 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:53,881 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:53,881 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 19:51:53,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:53,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1791307120, now seen corresponding path program 1161 times [2020-02-10 19:51:53,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:53,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196503849] [2020-02-10 19:51:53,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:54,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 19:51:54,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196503849] [2020-02-10 19:51:54,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:54,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:54,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747583342] [2020-02-10 19:51:54,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:54,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:54,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:54,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:54,162 INFO L87 Difference]: Start difference. First operand 387 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:51:54,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:54,249 INFO L93 Difference]: Finished difference Result 640 states and 1887 transitions. [2020-02-10 19:51:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:54,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:54,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:54,251 INFO L225 Difference]: With dead ends: 640 [2020-02-10 19:51:54,252 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 19:51:54,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:54,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 19:51:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 392. [2020-02-10 19:51:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:51:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1334 transitions. [2020-02-10 19:51:54,261 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1334 transitions. Word has length 22 [2020-02-10 19:51:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:54,261 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1334 transitions. [2020-02-10 19:51:54,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1334 transitions. [2020-02-10 19:51:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:54,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:54,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 19:51:54,262 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 19:51:54,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:54,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1899806566, now seen corresponding path program 1162 times [2020-02-10 19:51:54,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:54,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113874095] [2020-02-10 19:51:54,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:54,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 19:51:54,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113874095] [2020-02-10 19:51:54,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:54,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:54,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150454040] [2020-02-10 19:51:54,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:54,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:54,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:54,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:54,533 INFO L87 Difference]: Start difference. First operand 392 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:51:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:54,664 INFO L93 Difference]: Finished difference Result 627 states and 1867 transitions. [2020-02-10 19:51:54,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:54,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:54,666 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:51:54,666 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:51:54,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:51:54,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 387. [2020-02-10 19:51:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:51:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1323 transitions. [2020-02-10 19:51:54,676 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1323 transitions. Word has length 22 [2020-02-10 19:51:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:54,676 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1323 transitions. [2020-02-10 19:51:54,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1323 transitions. [2020-02-10 19:51:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:54,677 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:54,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 19:51:54,677 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 19:51:54,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:54,677 INFO L82 PathProgramCache]: Analyzing trace with hash 484125790, now seen corresponding path program 1163 times [2020-02-10 19:51:54,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:54,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714322548] [2020-02-10 19:51:54,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:54,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 19:51:54,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714322548] [2020-02-10 19:51:54,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:54,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:54,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887016688] [2020-02-10 19:51:54,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:54,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:54,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:54,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:54,951 INFO L87 Difference]: Start difference. First operand 387 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:51:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:55,061 INFO L93 Difference]: Finished difference Result 631 states and 1865 transitions. [2020-02-10 19:51:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:55,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:55,063 INFO L225 Difference]: With dead ends: 631 [2020-02-10 19:51:55,063 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 19:51:55,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 19:51:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 19:51:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 389. [2020-02-10 19:51:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:51:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1326 transitions. [2020-02-10 19:51:55,074 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1326 transitions. Word has length 22 [2020-02-10 19:51:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:55,074 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1326 transitions. [2020-02-10 19:51:55,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1326 transitions. [2020-02-10 19:51:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:55,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:55,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:55,075 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 19:51:55,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:55,075 INFO L82 PathProgramCache]: Analyzing trace with hash 310878098, now seen corresponding path program 1164 times [2020-02-10 19:51:55,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:55,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634759165] [2020-02-10 19:51:55,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:55,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 19:51:55,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634759165] [2020-02-10 19:51:55,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:55,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:55,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813953202] [2020-02-10 19:51:55,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:55,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:55,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:55,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:55,339 INFO L87 Difference]: Start difference. First operand 389 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:51:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:55,472 INFO L93 Difference]: Finished difference Result 624 states and 1859 transitions. [2020-02-10 19:51:55,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:55,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:55,474 INFO L225 Difference]: With dead ends: 624 [2020-02-10 19:51:55,474 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 19:51:55,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 19:51:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 19:51:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 384. [2020-02-10 19:51:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:51:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1316 transitions. [2020-02-10 19:51:55,483 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1316 transitions. Word has length 22 [2020-02-10 19:51:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:55,483 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1316 transitions. [2020-02-10 19:51:55,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1316 transitions. [2020-02-10 19:51:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:55,484 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:55,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:55,484 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 19:51:55,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:55,484 INFO L82 PathProgramCache]: Analyzing trace with hash -789117692, now seen corresponding path program 1165 times [2020-02-10 19:51:55,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:55,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166191405] [2020-02-10 19:51:55,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:55,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 19:51:55,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166191405] [2020-02-10 19:51:55,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:55,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:55,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76342795] [2020-02-10 19:51:55,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:55,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:55,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:55,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:55,779 INFO L87 Difference]: Start difference. First operand 384 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:51:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:55,863 INFO L93 Difference]: Finished difference Result 662 states and 1936 transitions. [2020-02-10 19:51:55,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:55,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:55,865 INFO L225 Difference]: With dead ends: 662 [2020-02-10 19:51:55,865 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 19:51:55,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 19:51:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 398. [2020-02-10 19:51:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-02-10 19:51:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1349 transitions. [2020-02-10 19:51:55,874 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1349 transitions. Word has length 22 [2020-02-10 19:51:55,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:55,874 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1349 transitions. [2020-02-10 19:51:55,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1349 transitions. [2020-02-10 19:51:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:55,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:55,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 19:51:55,875 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 19:51:55,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:55,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1438563284, now seen corresponding path program 1166 times [2020-02-10 19:51:55,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:55,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859383997] [2020-02-10 19:51:55,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:56,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 19:51:56,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859383997] [2020-02-10 19:51:56,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:56,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:56,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844366392] [2020-02-10 19:51:56,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:56,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:56,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:56,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:56,158 INFO L87 Difference]: Start difference. First operand 398 states and 1349 transitions. Second operand 9 states. [2020-02-10 19:51:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:56,276 INFO L93 Difference]: Finished difference Result 660 states and 1926 transitions. [2020-02-10 19:51:56,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:56,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:56,278 INFO L225 Difference]: With dead ends: 660 [2020-02-10 19:51:56,278 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 19:51:56,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 19:51:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 19:51:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 390. [2020-02-10 19:51:56,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:51:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1330 transitions. [2020-02-10 19:51:56,288 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1330 transitions. Word has length 22 [2020-02-10 19:51:56,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:56,288 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1330 transitions. [2020-02-10 19:51:56,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1330 transitions. [2020-02-10 19:51:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:56,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:56,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 19:51:56,289 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 19:51:56,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:56,289 INFO L82 PathProgramCache]: Analyzing trace with hash 821823266, now seen corresponding path program 1167 times [2020-02-10 19:51:56,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:56,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678738655] [2020-02-10 19:51:56,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:56,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 19:51:56,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678738655] [2020-02-10 19:51:56,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:56,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:56,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641045560] [2020-02-10 19:51:56,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:56,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:56,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:56,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:56,573 INFO L87 Difference]: Start difference. First operand 390 states and 1330 transitions. Second operand 9 states. [2020-02-10 19:51:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:56,662 INFO L93 Difference]: Finished difference Result 649 states and 1905 transitions. [2020-02-10 19:51:56,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:56,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:56,664 INFO L225 Difference]: With dead ends: 649 [2020-02-10 19:51:56,664 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 19:51:56,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:56,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 19:51:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 395. [2020-02-10 19:51:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:51:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1338 transitions. [2020-02-10 19:51:56,673 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1338 transitions. Word has length 22 [2020-02-10 19:51:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:56,673 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1338 transitions. [2020-02-10 19:51:56,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1338 transitions. [2020-02-10 19:51:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:56,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:56,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 19:51:56,674 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 19:51:56,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:56,674 INFO L82 PathProgramCache]: Analyzing trace with hash 713323820, now seen corresponding path program 1168 times [2020-02-10 19:51:56,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:56,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992099348] [2020-02-10 19:51:56,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:56,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 19:51:56,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992099348] [2020-02-10 19:51:56,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:56,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:56,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293371192] [2020-02-10 19:51:56,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:56,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:56,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:56,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:56,964 INFO L87 Difference]: Start difference. First operand 395 states and 1338 transitions. Second operand 9 states. [2020-02-10 19:51:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:57,073 INFO L93 Difference]: Finished difference Result 636 states and 1885 transitions. [2020-02-10 19:51:57,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:57,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:57,075 INFO L225 Difference]: With dead ends: 636 [2020-02-10 19:51:57,075 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 19:51:57,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:57,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 19:51:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 390. [2020-02-10 19:51:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:51:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1325 transitions. [2020-02-10 19:51:57,086 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1325 transitions. Word has length 22 [2020-02-10 19:51:57,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:57,086 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1325 transitions. [2020-02-10 19:51:57,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1325 transitions. [2020-02-10 19:51:57,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:57,087 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:57,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 19:51:57,087 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 19:51:57,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:57,087 INFO L82 PathProgramCache]: Analyzing trace with hash 321408896, now seen corresponding path program 1169 times [2020-02-10 19:51:57,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:57,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671105286] [2020-02-10 19:51:57,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:57,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 19:51:57,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671105286] [2020-02-10 19:51:57,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:57,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:57,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233465227] [2020-02-10 19:51:57,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:57,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:57,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:57,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:57,363 INFO L87 Difference]: Start difference. First operand 390 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:51:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:57,499 INFO L93 Difference]: Finished difference Result 646 states and 1895 transitions. [2020-02-10 19:51:57,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:57,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:57,501 INFO L225 Difference]: With dead ends: 646 [2020-02-10 19:51:57,501 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 19:51:57,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 19:51:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 19:51:57,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 394. [2020-02-10 19:51:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:51:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1332 transitions. [2020-02-10 19:51:57,517 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1332 transitions. Word has length 22 [2020-02-10 19:51:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:57,518 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1332 transitions. [2020-02-10 19:51:57,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1332 transitions. [2020-02-10 19:51:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:57,519 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:57,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 19:51:57,519 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 19:51:57,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:57,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1180283426, now seen corresponding path program 1170 times [2020-02-10 19:51:57,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:57,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552150323] [2020-02-10 19:51:57,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:57,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 19:51:57,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552150323] [2020-02-10 19:51:57,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:57,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:57,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621370306] [2020-02-10 19:51:57,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:57,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:57,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:57,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:57,789 INFO L87 Difference]: Start difference. First operand 394 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:51:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:57,896 INFO L93 Difference]: Finished difference Result 635 states and 1879 transitions. [2020-02-10 19:51:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:57,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:57,898 INFO L225 Difference]: With dead ends: 635 [2020-02-10 19:51:57,898 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 19:51:57,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 19:51:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 19:51:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 384. [2020-02-10 19:51:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:51:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1312 transitions. [2020-02-10 19:51:57,909 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1312 transitions. Word has length 22 [2020-02-10 19:51:57,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:57,909 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1312 transitions. [2020-02-10 19:51:57,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1312 transitions. [2020-02-10 19:51:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:57,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:57,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 19:51:57,910 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 19:51:57,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:57,910 INFO L82 PathProgramCache]: Analyzing trace with hash -620468902, now seen corresponding path program 1171 times [2020-02-10 19:51:57,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:57,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181507059] [2020-02-10 19:51:57,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51: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 19:51:58,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181507059] [2020-02-10 19:51:58,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:58,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:58,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55982201] [2020-02-10 19:51:58,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:58,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:58,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:58,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:58,158 INFO L87 Difference]: Start difference. First operand 384 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:51:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:58,273 INFO L93 Difference]: Finished difference Result 631 states and 1863 transitions. [2020-02-10 19:51:58,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:58,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:58,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:58,275 INFO L225 Difference]: With dead ends: 631 [2020-02-10 19:51:58,275 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 19:51:58,275 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 19:51:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 388. [2020-02-10 19:51:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1322 transitions. [2020-02-10 19:51:58,285 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1322 transitions. Word has length 22 [2020-02-10 19:51:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:58,285 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1322 transitions. [2020-02-10 19:51:58,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1322 transitions. [2020-02-10 19:51:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:58,285 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:58,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 19:51:58,286 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 19:51:58,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:58,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1538419092, now seen corresponding path program 1172 times [2020-02-10 19:51:58,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:58,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058839106] [2020-02-10 19:51:58,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:58,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058839106] [2020-02-10 19:51:58,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:58,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:58,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125847155] [2020-02-10 19:51:58,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:58,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:58,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:58,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:58,526 INFO L87 Difference]: Start difference. First operand 388 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:51:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:58,637 INFO L93 Difference]: Finished difference Result 635 states and 1869 transitions. [2020-02-10 19:51:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:58,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:58,639 INFO L225 Difference]: With dead ends: 635 [2020-02-10 19:51:58,639 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 19:51:58,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 19:51:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 386. [2020-02-10 19:51:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:51:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1317 transitions. [2020-02-10 19:51:58,649 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1317 transitions. Word has length 22 [2020-02-10 19:51:58,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:58,650 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1317 transitions. [2020-02-10 19:51:58,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:58,650 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1317 transitions. [2020-02-10 19:51:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:58,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:58,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 19:51:58,650 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 19:51:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:58,651 INFO L82 PathProgramCache]: Analyzing trace with hash 990472056, now seen corresponding path program 1173 times [2020-02-10 19:51:58,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:58,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415627801] [2020-02-10 19:51:58,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:58,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 19:51:58,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415627801] [2020-02-10 19:51:58,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:58,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:58,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737126801] [2020-02-10 19:51:58,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:58,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:58,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:58,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:58,907 INFO L87 Difference]: Start difference. First operand 386 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:51:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:59,038 INFO L93 Difference]: Finished difference Result 627 states and 1854 transitions. [2020-02-10 19:51:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:59,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:59,040 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:51:59,040 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:51:59,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:51:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 388. [2020-02-10 19:51:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:51:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1320 transitions. [2020-02-10 19:51:59,049 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1320 transitions. Word has length 22 [2020-02-10 19:51:59,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:59,049 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1320 transitions. [2020-02-10 19:51:59,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:59,049 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1320 transitions. [2020-02-10 19:51:59,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:59,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:59,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 19:51:59,050 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 19:51:59,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:59,050 INFO L82 PathProgramCache]: Analyzing trace with hash 817224364, now seen corresponding path program 1174 times [2020-02-10 19:51:59,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:59,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979383535] [2020-02-10 19:51:59,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:59,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 19:51:59,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979383535] [2020-02-10 19:51:59,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:59,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:59,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373090438] [2020-02-10 19:51:59,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:59,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:59,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:59,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:59,302 INFO L87 Difference]: Start difference. First operand 388 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:51:59,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:59,417 INFO L93 Difference]: Finished difference Result 620 states and 1848 transitions. [2020-02-10 19:51:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:59,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:59,419 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:51:59,419 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:51:59,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:51:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 386. [2020-02-10 19:51:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:51:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1315 transitions. [2020-02-10 19:51:59,434 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1315 transitions. Word has length 22 [2020-02-10 19:51:59,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:59,435 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1315 transitions. [2020-02-10 19:51:59,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:59,435 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1315 transitions. [2020-02-10 19:51:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:59,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:59,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 19:51:59,435 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 19:51:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:59,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1680837048, now seen corresponding path program 1175 times [2020-02-10 19:51:59,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:59,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228365859] [2020-02-10 19:51:59,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:59,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 19:51:59,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228365859] [2020-02-10 19:51:59,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:59,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:51:59,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827570903] [2020-02-10 19:51:59,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:51:59,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:59,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:51:59,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:51:59,686 INFO L87 Difference]: Start difference. First operand 386 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:51:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:59,827 INFO L93 Difference]: Finished difference Result 633 states and 1866 transitions. [2020-02-10 19:51:59,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:51:59,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:51:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:59,829 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:51:59,829 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 19:51:59,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 19:51:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 19:51:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 390. [2020-02-10 19:51:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:51:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1322 transitions. [2020-02-10 19:51:59,838 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1322 transitions. Word has length 22 [2020-02-10 19:51:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:59,838 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1322 transitions. [2020-02-10 19:51:59,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:51:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1322 transitions. [2020-02-10 19:51:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:51:59,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:59,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 19:51:59,839 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 19:51:59,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:59,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1869427750, now seen corresponding path program 1176 times [2020-02-10 19:51:59,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:59,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146507200] [2020-02-10 19:51:59,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:00,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 19:52:00,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146507200] [2020-02-10 19:52:00,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:00,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:00,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356291465] [2020-02-10 19:52:00,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:00,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:00,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:00,091 INFO L87 Difference]: Start difference. First operand 390 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:52:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:00,238 INFO L93 Difference]: Finished difference Result 622 states and 1850 transitions. [2020-02-10 19:52:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:00,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:00,240 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:52:00,240 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:52:00,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:52:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 380. [2020-02-10 19:52:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:52:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-02-10 19:52:00,250 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-02-10 19:52:00,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:00,250 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-02-10 19:52:00,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-02-10 19:52:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:00,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:00,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 19:52:00,251 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 19:52:00,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:00,251 INFO L82 PathProgramCache]: Analyzing trace with hash -752347456, now seen corresponding path program 1177 times [2020-02-10 19:52:00,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:00,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540531600] [2020-02-10 19:52:00,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:00,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 19:52:00,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540531600] [2020-02-10 19:52:00,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:00,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:00,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940274834] [2020-02-10 19:52:00,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:00,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:00,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:00,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:00,530 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-02-10 19:52:00,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:00,659 INFO L93 Difference]: Finished difference Result 610 states and 1819 transitions. [2020-02-10 19:52:00,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:00,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:00,661 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:52:00,662 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:52:00,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 19:52:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:52:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 386. [2020-02-10 19:52:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-02-10 19:52:00,671 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-02-10 19:52:00,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:00,671 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-02-10 19:52:00,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-02-10 19:52:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:00,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:00,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 19:52:00,672 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 19:52:00,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:00,672 INFO L82 PathProgramCache]: Analyzing trace with hash 589585332, now seen corresponding path program 1178 times [2020-02-10 19:52:00,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:00,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618087800] [2020-02-10 19:52:00,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:00,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 19:52:00,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618087800] [2020-02-10 19:52:00,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:00,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:00,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923840832] [2020-02-10 19:52:00,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:00,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:00,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:00,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:00,953 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:52:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:01,077 INFO L93 Difference]: Finished difference Result 609 states and 1815 transitions. [2020-02-10 19:52:01,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:01,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:01,079 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:52:01,079 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 19:52:01,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 19:52:01,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 19:52:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 384. [2020-02-10 19:52:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-02-10 19:52:01,088 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-02-10 19:52:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:01,089 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-02-10 19:52:01,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-02-10 19:52:01,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:01,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:01,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 19:52:01,089 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 19:52:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash 855967726, now seen corresponding path program 1179 times [2020-02-10 19:52:01,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:01,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968972193] [2020-02-10 19:52:01,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:01,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 19:52:01,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968972193] [2020-02-10 19:52:01,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:01,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:01,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009305769] [2020-02-10 19:52:01,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:01,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:01,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:01,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:01,370 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:52:01,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:01,485 INFO L93 Difference]: Finished difference Result 615 states and 1828 transitions. [2020-02-10 19:52:01,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:01,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:01,487 INFO L225 Difference]: With dead ends: 615 [2020-02-10 19:52:01,487 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 19:52:01,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 19:52:01,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 19:52:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 387. [2020-02-10 19:52:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:52:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1322 transitions. [2020-02-10 19:52:01,497 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1322 transitions. Word has length 22 [2020-02-10 19:52:01,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:01,498 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1322 transitions. [2020-02-10 19:52:01,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1322 transitions. [2020-02-10 19:52:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:01,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52: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 19:52:01,498 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 19:52:01,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:01,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1722527710, now seen corresponding path program 1180 times [2020-02-10 19:52:01,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:01,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429225761] [2020-02-10 19:52:01,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:01,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429225761] [2020-02-10 19:52:01,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:01,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:01,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131584805] [2020-02-10 19:52:01,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:01,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:01,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:01,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:01,781 INFO L87 Difference]: Start difference. First operand 387 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:52:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:01,897 INFO L93 Difference]: Finished difference Result 618 states and 1831 transitions. [2020-02-10 19:52:01,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:01,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:01,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:01,899 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:52:01,899 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 19:52:01,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 19:52:01,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 19:52:01,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 384. [2020-02-10 19:52:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:01,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-02-10 19:52:01,909 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-02-10 19:52:01,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:01,910 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-02-10 19:52:01,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:01,910 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-02-10 19:52:01,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:01,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:01,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 19:52:01,910 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 19:52:01,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:01,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1124815134, now seen corresponding path program 1181 times [2020-02-10 19:52:01,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:01,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18595574] [2020-02-10 19:52:01,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:02,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 19:52:02,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18595574] [2020-02-10 19:52:02,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:02,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:02,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849727567] [2020-02-10 19:52:02,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:02,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:02,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:02,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:02,180 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:52:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:02,288 INFO L93 Difference]: Finished difference Result 612 states and 1819 transitions. [2020-02-10 19:52:02,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:02,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:02,290 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:52:02,290 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:52:02,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:52:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-02-10 19:52:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1318 transitions. [2020-02-10 19:52:02,300 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1318 transitions. Word has length 22 [2020-02-10 19:52:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:02,301 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1318 transitions. [2020-02-10 19:52:02,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1318 transitions. [2020-02-10 19:52:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:02,301 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:02,301 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:02,301 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 19:52:02,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:02,302 INFO L82 PathProgramCache]: Analyzing trace with hash 206864944, now seen corresponding path program 1182 times [2020-02-10 19:52:02,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:02,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484196266] [2020-02-10 19:52:02,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:02,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 19:52:02,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484196266] [2020-02-10 19:52:02,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:02,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:02,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687025535] [2020-02-10 19:52:02,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:02,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:02,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:02,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:02,572 INFO L87 Difference]: Start difference. First operand 386 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:52:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:02,686 INFO L93 Difference]: Finished difference Result 616 states and 1825 transitions. [2020-02-10 19:52:02,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:02,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:02,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:02,688 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:52:02,688 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:52:02,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:52:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 382. [2020-02-10 19:52:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-02-10 19:52:02,699 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-02-10 19:52:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:02,699 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-02-10 19:52:02,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-02-10 19:52:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:02,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:02,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 19:52:02,699 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 19:52:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:02,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1942181986, now seen corresponding path program 1183 times [2020-02-10 19:52:02,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:02,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841921619] [2020-02-10 19:52:02,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:02,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841921619] [2020-02-10 19:52:02,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:02,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:02,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939056551] [2020-02-10 19:52:02,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:02,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:02,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:02,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:02,978 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:52:03,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:03,088 INFO L93 Difference]: Finished difference Result 606 states and 1808 transitions. [2020-02-10 19:52:03,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:03,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:03,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:03,090 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:52:03,090 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 19:52:03,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:03,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 19:52:03,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 386. [2020-02-10 19:52:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:03,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1320 transitions. [2020-02-10 19:52:03,100 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1320 transitions. Word has length 22 [2020-02-10 19:52:03,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:03,100 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1320 transitions. [2020-02-10 19:52:03,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1320 transitions. [2020-02-10 19:52:03,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:03,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:03,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 19:52:03,101 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 19:52:03,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:03,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1010852522, now seen corresponding path program 1184 times [2020-02-10 19:52:03,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:03,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692202408] [2020-02-10 19:52:03,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:03,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692202408] [2020-02-10 19:52:03,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:03,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:03,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182510467] [2020-02-10 19:52:03,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:03,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:03,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:03,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:03,384 INFO L87 Difference]: Start difference. First operand 386 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:52:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:03,495 INFO L93 Difference]: Finished difference Result 605 states and 1804 transitions. [2020-02-10 19:52:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:03,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:03,497 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:52:03,497 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:52:03,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 19:52:03,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:52:03,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 384. [2020-02-10 19:52:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-02-10 19:52:03,507 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-02-10 19:52:03,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:03,508 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-02-10 19:52:03,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-02-10 19:52:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:03,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:03,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 19:52:03,508 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 19:52:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash 866470830, now seen corresponding path program 1185 times [2020-02-10 19:52:03,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:03,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667284996] [2020-02-10 19:52:03,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52: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 19:52:03,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667284996] [2020-02-10 19:52:03,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:03,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:03,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557715517] [2020-02-10 19:52:03,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:03,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:03,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:03,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:03,791 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:52:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:03,910 INFO L93 Difference]: Finished difference Result 606 states and 1808 transitions. [2020-02-10 19:52:03,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:03,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:03,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:03,912 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:52:03,912 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 19:52:03,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 19:52:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 19:52:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 387. [2020-02-10 19:52:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:52:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1320 transitions. [2020-02-10 19:52:03,921 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1320 transitions. Word has length 22 [2020-02-10 19:52:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:03,921 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1320 transitions. [2020-02-10 19:52:03,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1320 transitions. [2020-02-10 19:52:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:03,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:03,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 19:52:03,922 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 19:52:03,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:03,922 INFO L82 PathProgramCache]: Analyzing trace with hash -961927330, now seen corresponding path program 1186 times [2020-02-10 19:52:03,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:03,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391840441] [2020-02-10 19:52:03,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:04,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 19:52:04,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391840441] [2020-02-10 19:52:04,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:04,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:04,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34657973] [2020-02-10 19:52:04,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:04,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:04,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:04,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:04,206 INFO L87 Difference]: Start difference. First operand 387 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:52:04,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:04,335 INFO L93 Difference]: Finished difference Result 598 states and 1799 transitions. [2020-02-10 19:52:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:04,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:04,337 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:52:04,337 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:52:04,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 19:52:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:52:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 384. [2020-02-10 19:52:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1313 transitions. [2020-02-10 19:52:04,347 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1313 transitions. Word has length 22 [2020-02-10 19:52:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:04,347 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1313 transitions. [2020-02-10 19:52:04,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1313 transitions. [2020-02-10 19:52:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:04,348 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:04,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 19:52:04,348 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 19:52:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1135318238, now seen corresponding path program 1187 times [2020-02-10 19:52:04,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:04,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461264814] [2020-02-10 19:52:04,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:04,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461264814] [2020-02-10 19:52:04,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:04,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:04,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676158967] [2020-02-10 19:52:04,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:04,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:04,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:04,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:04,621 INFO L87 Difference]: Start difference. First operand 384 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:52:04,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:04,736 INFO L93 Difference]: Finished difference Result 604 states and 1801 transitions. [2020-02-10 19:52:04,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:04,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:04,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:04,738 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:52:04,738 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:52:04,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:04,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:52:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 386. [2020-02-10 19:52:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1316 transitions. [2020-02-10 19:52:04,748 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1316 transitions. Word has length 22 [2020-02-10 19:52:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:04,748 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1316 transitions. [2020-02-10 19:52:04,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1316 transitions. [2020-02-10 19:52:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:04,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:04,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 19:52:04,749 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 19:52:04,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:04,749 INFO L82 PathProgramCache]: Analyzing trace with hash 962070546, now seen corresponding path program 1188 times [2020-02-10 19:52:04,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:04,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795010995] [2020-02-10 19:52:04,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:05,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 19:52:05,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795010995] [2020-02-10 19:52:05,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:05,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:05,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93091731] [2020-02-10 19:52:05,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:05,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:05,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:05,026 INFO L87 Difference]: Start difference. First operand 386 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:52:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:05,138 INFO L93 Difference]: Finished difference Result 597 states and 1795 transitions. [2020-02-10 19:52:05,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:05,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:05,140 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:52:05,140 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 19:52:05,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 19:52:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 19:52:05,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 382. [2020-02-10 19:52:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1308 transitions. [2020-02-10 19:52:05,150 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1308 transitions. Word has length 22 [2020-02-10 19:52:05,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:05,150 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1308 transitions. [2020-02-10 19:52:05,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1308 transitions. [2020-02-10 19:52:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:05,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:05,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 19:52:05,151 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 19:52:05,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:05,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1868660258, now seen corresponding path program 1189 times [2020-02-10 19:52:05,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:05,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59367554] [2020-02-10 19:52:05,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:05,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 19:52:05,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59367554] [2020-02-10 19:52:05,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:05,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:05,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051283375] [2020-02-10 19:52:05,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:05,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:05,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:05,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:05,424 INFO L87 Difference]: Start difference. First operand 382 states and 1308 transitions. Second operand 9 states. [2020-02-10 19:52:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:05,536 INFO L93 Difference]: Finished difference Result 618 states and 1835 transitions. [2020-02-10 19:52:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:05,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:05,538 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:52:05,539 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 19:52:05,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 19:52:05,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 19:52:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 388. [2020-02-10 19:52:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:52:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1324 transitions. [2020-02-10 19:52:05,548 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1324 transitions. Word has length 22 [2020-02-10 19:52:05,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:05,548 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1324 transitions. [2020-02-10 19:52:05,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1324 transitions. [2020-02-10 19:52:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:05,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:05,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 19:52:05,549 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 19:52:05,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:05,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1559747054, now seen corresponding path program 1190 times [2020-02-10 19:52:05,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:05,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360144478] [2020-02-10 19:52:05,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:05,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 19:52:05,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360144478] [2020-02-10 19:52:05,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:05,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:05,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885176713] [2020-02-10 19:52:05,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:05,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:05,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:05,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:05,828 INFO L87 Difference]: Start difference. First operand 388 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:52:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:05,938 INFO L93 Difference]: Finished difference Result 621 states and 1838 transitions. [2020-02-10 19:52:05,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:05,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:05,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:05,940 INFO L225 Difference]: With dead ends: 621 [2020-02-10 19:52:05,940 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 19:52:05,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 19:52:05,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 19:52:05,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 385. [2020-02-10 19:52:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:52:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1316 transitions. [2020-02-10 19:52:05,950 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1316 transitions. Word has length 22 [2020-02-10 19:52:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:05,950 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1316 transitions. [2020-02-10 19:52:05,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1316 transitions. [2020-02-10 19:52:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:05,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:05,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 19:52:05,950 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 19:52:05,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:05,951 INFO L82 PathProgramCache]: Analyzing trace with hash -815366080, now seen corresponding path program 1191 times [2020-02-10 19:52:05,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:05,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235983522] [2020-02-10 19:52:05,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:06,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 19:52:06,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235983522] [2020-02-10 19:52:06,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:06,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:06,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701204202] [2020-02-10 19:52:06,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:06,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:06,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:06,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:06,222 INFO L87 Difference]: Start difference. First operand 385 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:52:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:06,383 INFO L93 Difference]: Finished difference Result 613 states and 1823 transitions. [2020-02-10 19:52:06,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:06,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:06,385 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:52:06,385 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:52:06,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 19:52:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:52:06,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 388. [2020-02-10 19:52:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:52:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1321 transitions. [2020-02-10 19:52:06,396 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1321 transitions. Word has length 22 [2020-02-10 19:52:06,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:06,396 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1321 transitions. [2020-02-10 19:52:06,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1321 transitions. [2020-02-10 19:52:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:06,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:06,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 19:52:06,397 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 19:52:06,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:06,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1651203056, now seen corresponding path program 1192 times [2020-02-10 19:52:06,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:06,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492639445] [2020-02-10 19:52:06,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:06,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 19:52:06,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492639445] [2020-02-10 19:52:06,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:06,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:06,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039591342] [2020-02-10 19:52:06,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:06,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:06,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:06,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:06,677 INFO L87 Difference]: Start difference. First operand 388 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:52:06,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:06,786 INFO L93 Difference]: Finished difference Result 605 states and 1814 transitions. [2020-02-10 19:52:06,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:06,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:06,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:06,788 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:52:06,788 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:52:06,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:06,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:52:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 385. [2020-02-10 19:52:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:52:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1313 transitions. [2020-02-10 19:52:06,798 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1313 transitions. Word has length 22 [2020-02-10 19:52:06,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:06,798 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1313 transitions. [2020-02-10 19:52:06,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:06,799 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1313 transitions. [2020-02-10 19:52:06,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:06,799 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:06,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 19:52:06,799 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 19:52:06,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:06,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1889452130, now seen corresponding path program 1193 times [2020-02-10 19:52:06,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:06,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947611020] [2020-02-10 19:52:06,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:07,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947611020] [2020-02-10 19:52:07,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:07,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:07,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503733594] [2020-02-10 19:52:07,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:07,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:07,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:07,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:07,067 INFO L87 Difference]: Start difference. First operand 385 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:52:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:07,195 INFO L93 Difference]: Finished difference Result 617 states and 1829 transitions. [2020-02-10 19:52:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:07,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:07,197 INFO L225 Difference]: With dead ends: 617 [2020-02-10 19:52:07,197 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 19:52:07,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 19:52:07,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 19:52:07,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 389. [2020-02-10 19:52:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:52:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1320 transitions. [2020-02-10 19:52:07,208 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1320 transitions. Word has length 22 [2020-02-10 19:52:07,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:07,208 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1320 transitions. [2020-02-10 19:52:07,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1320 transitions. [2020-02-10 19:52:07,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:07,209 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:07,209 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:07,209 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 19:52:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:07,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1550208512, now seen corresponding path program 1194 times [2020-02-10 19:52:07,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:07,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153052898] [2020-02-10 19:52:07,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:07,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153052898] [2020-02-10 19:52:07,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:07,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:07,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882450626] [2020-02-10 19:52:07,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:07,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:07,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:07,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:07,475 INFO L87 Difference]: Start difference. First operand 389 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:52:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:07,614 INFO L93 Difference]: Finished difference Result 606 states and 1813 transitions. [2020-02-10 19:52:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:07,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:07,616 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:52:07,616 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:52:07,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 19:52:07,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:52:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 382. [2020-02-10 19:52:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:07,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-02-10 19:52:07,625 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-02-10 19:52:07,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:07,625 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-02-10 19:52:07,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-02-10 19:52:07,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:07,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:07,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 19:52:07,626 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 19:52:07,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:07,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1063368042, now seen corresponding path program 1195 times [2020-02-10 19:52:07,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:07,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837471665] [2020-02-10 19:52:07,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:07,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 19:52:07,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837471665] [2020-02-10 19:52:07,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:07,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:07,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674700507] [2020-02-10 19:52:07,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:07,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:07,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:07,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:07,879 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:52:07,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:07,988 INFO L93 Difference]: Finished difference Result 612 states and 1817 transitions. [2020-02-10 19:52:07,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:07,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:07,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:07,990 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:52:07,990 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:52:07,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 19:52:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:52:08,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-02-10 19:52:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:08,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1316 transitions. [2020-02-10 19:52:08,001 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1316 transitions. Word has length 22 [2020-02-10 19:52:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:08,001 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1316 transitions. [2020-02-10 19:52:08,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1316 transitions. [2020-02-10 19:52:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:08,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:08,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 19:52:08,002 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 19:52:08,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:08,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1981318232, now seen corresponding path program 1196 times [2020-02-10 19:52:08,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:08,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369758421] [2020-02-10 19:52:08,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:08,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 19:52:08,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369758421] [2020-02-10 19:52:08,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:08,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:08,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918365753] [2020-02-10 19:52:08,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:08,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:08,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:08,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:08,253 INFO L87 Difference]: Start difference. First operand 386 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:52:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:08,362 INFO L93 Difference]: Finished difference Result 616 states and 1823 transitions. [2020-02-10 19:52:08,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:08,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:08,364 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:52:08,365 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:52:08,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:52:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 384. [2020-02-10 19:52:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1311 transitions. [2020-02-10 19:52:08,374 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1311 transitions. Word has length 22 [2020-02-10 19:52:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:08,374 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1311 transitions. [2020-02-10 19:52:08,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1311 transitions. [2020-02-10 19:52:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:08,375 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:08,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 19:52:08,375 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 19:52:08,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:08,375 INFO L82 PathProgramCache]: Analyzing trace with hash 547572916, now seen corresponding path program 1197 times [2020-02-10 19:52:08,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:08,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590279093] [2020-02-10 19:52:08,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:08,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590279093] [2020-02-10 19:52:08,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:08,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:08,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204177278] [2020-02-10 19:52:08,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:08,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:08,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:08,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:08,626 INFO L87 Difference]: Start difference. First operand 384 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:52:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:08,746 INFO L93 Difference]: Finished difference Result 608 states and 1808 transitions. [2020-02-10 19:52:08,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:08,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:08,748 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:52:08,749 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:52:08,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 19:52:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:52:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 386. [2020-02-10 19:52:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1314 transitions. [2020-02-10 19:52:08,758 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1314 transitions. Word has length 22 [2020-02-10 19:52:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:08,759 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1314 transitions. [2020-02-10 19:52:08,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1314 transitions. [2020-02-10 19:52:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:08,759 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:08,759 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:08,759 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 19:52:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:08,760 INFO L82 PathProgramCache]: Analyzing trace with hash 374325224, now seen corresponding path program 1198 times [2020-02-10 19:52:08,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:08,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854918970] [2020-02-10 19:52:08,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:09,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 19:52:09,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854918970] [2020-02-10 19:52:09,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:09,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:09,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498462453] [2020-02-10 19:52:09,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:09,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:09,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:09,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:09,008 INFO L87 Difference]: Start difference. First operand 386 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:52:09,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:09,118 INFO L93 Difference]: Finished difference Result 601 states and 1802 transitions. [2020-02-10 19:52:09,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:09,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:09,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:09,120 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:52:09,120 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:52:09,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:52:09,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 384. [2020-02-10 19:52:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1309 transitions. [2020-02-10 19:52:09,130 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1309 transitions. Word has length 22 [2020-02-10 19:52:09,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:09,130 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1309 transitions. [2020-02-10 19:52:09,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1309 transitions. [2020-02-10 19:52:09,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:09,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:09,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 19:52:09,131 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 19:52:09,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:09,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1237937908, now seen corresponding path program 1199 times [2020-02-10 19:52:09,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:09,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562589133] [2020-02-10 19:52:09,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:09,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 19:52:09,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562589133] [2020-02-10 19:52:09,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:09,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:09,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416529934] [2020-02-10 19:52:09,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:09,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:09,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:09,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:09,381 INFO L87 Difference]: Start difference. First operand 384 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:52:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:09,492 INFO L93 Difference]: Finished difference Result 614 states and 1820 transitions. [2020-02-10 19:52:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:09,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:09,504 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:52:09,504 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:52:09,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:52:09,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 388. [2020-02-10 19:52:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:52:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1316 transitions. [2020-02-10 19:52:09,513 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1316 transitions. Word has length 22 [2020-02-10 19:52:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:09,513 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1316 transitions. [2020-02-10 19:52:09,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1316 transitions. [2020-02-10 19:52:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:09,513 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:09,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 19:52:09,514 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 19:52:09,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1982640406, now seen corresponding path program 1200 times [2020-02-10 19:52:09,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:09,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866360062] [2020-02-10 19:52:09,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:09,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 19:52:09,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866360062] [2020-02-10 19:52:09,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:09,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:09,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258394518] [2020-02-10 19:52:09,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:09,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:09,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:09,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:09,763 INFO L87 Difference]: Start difference. First operand 388 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:52:09,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:09,877 INFO L93 Difference]: Finished difference Result 603 states and 1804 transitions. [2020-02-10 19:52:09,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:09,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:09,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:09,879 INFO L225 Difference]: With dead ends: 603 [2020-02-10 19:52:09,879 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:52:09,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 19:52:09,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:52:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 376. [2020-02-10 19:52:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:52:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1295 transitions. [2020-02-10 19:52:09,889 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1295 transitions. Word has length 22 [2020-02-10 19:52:09,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:09,889 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1295 transitions. [2020-02-10 19:52:09,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:09,889 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1295 transitions. [2020-02-10 19:52:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:09,890 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:09,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 19:52:09,890 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 19:52:09,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:09,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1290117892, now seen corresponding path program 1201 times [2020-02-10 19:52:09,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:09,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036546983] [2020-02-10 19:52:09,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:10,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 19:52:10,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036546983] [2020-02-10 19:52:10,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:10,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:10,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542007304] [2020-02-10 19:52:10,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:10,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:10,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:10,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:10,169 INFO L87 Difference]: Start difference. First operand 376 states and 1295 transitions. Second operand 9 states. [2020-02-10 19:52:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:10,250 INFO L93 Difference]: Finished difference Result 602 states and 1759 transitions. [2020-02-10 19:52:10,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:10,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:10,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:10,252 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:52:10,252 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:52:10,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:52:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 386. [2020-02-10 19:52:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-02-10 19:52:10,261 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-02-10 19:52:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:10,261 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-02-10 19:52:10,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-02-10 19:52:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:10,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:10,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 19:52:10,262 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 19:52:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:10,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1851186384, now seen corresponding path program 1202 times [2020-02-10 19:52:10,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:10,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033504439] [2020-02-10 19:52:10,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:10,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 19:52:10,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033504439] [2020-02-10 19:52:10,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:10,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:10,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740065476] [2020-02-10 19:52:10,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:10,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:10,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:10,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:10,547 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:52:10,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:10,628 INFO L93 Difference]: Finished difference Result 595 states and 1744 transitions. [2020-02-10 19:52:10,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:10,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:10,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:10,630 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:52:10,630 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:52:10,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 19:52:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:52:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-02-10 19:52:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1324 transitions. [2020-02-10 19:52:10,639 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1324 transitions. Word has length 22 [2020-02-10 19:52:10,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:10,639 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1324 transitions. [2020-02-10 19:52:10,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1324 transitions. [2020-02-10 19:52:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:10,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:10,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 19:52:10,640 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 19:52:10,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:10,640 INFO L82 PathProgramCache]: Analyzing trace with hash -310319962, now seen corresponding path program 1203 times [2020-02-10 19:52:10,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:10,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412774284] [2020-02-10 19:52:10,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:10,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412774284] [2020-02-10 19:52:10,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:10,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:10,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428907386] [2020-02-10 19:52:10,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:10,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:10,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:10,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:10,920 INFO L87 Difference]: Start difference. First operand 384 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:52:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:11,000 INFO L93 Difference]: Finished difference Result 604 states and 1762 transitions. [2020-02-10 19:52:11,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:11,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:11,002 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:52:11,003 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:52:11,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 19:52:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:52:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 387. [2020-02-10 19:52:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:52:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-02-10 19:52:11,012 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-02-10 19:52:11,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:11,013 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-02-10 19:52:11,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:11,013 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-02-10 19:52:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:11,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:11,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 19:52:11,014 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 19:52:11,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:11,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1272523624, now seen corresponding path program 1204 times [2020-02-10 19:52:11,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:11,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570952037] [2020-02-10 19:52:11,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52: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 19:52:11,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570952037] [2020-02-10 19:52:11,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:11,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:11,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160971794] [2020-02-10 19:52:11,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:11,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:11,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:11,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:11,301 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:52:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:11,424 INFO L93 Difference]: Finished difference Result 598 states and 1748 transitions. [2020-02-10 19:52:11,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:11,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:11,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:11,426 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:52:11,426 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:52:11,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 19:52:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:52:11,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 384. [2020-02-10 19:52:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1322 transitions. [2020-02-10 19:52:11,435 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1322 transitions. Word has length 22 [2020-02-10 19:52:11,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:11,436 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1322 transitions. [2020-02-10 19:52:11,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:11,436 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1322 transitions. [2020-02-10 19:52:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:11,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:11,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 19:52:11,436 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 19:52:11,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:11,437 INFO L82 PathProgramCache]: Analyzing trace with hash -255597736, now seen corresponding path program 1205 times [2020-02-10 19:52:11,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:11,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629954060] [2020-02-10 19:52:11,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:11,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:11,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629954060] [2020-02-10 19:52:11,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:11,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:11,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789144416] [2020-02-10 19:52:11,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:11,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:11,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:11,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:11,733 INFO L87 Difference]: Start difference. First operand 384 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:52:11,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:11,827 INFO L93 Difference]: Finished difference Result 588 states and 1729 transitions. [2020-02-10 19:52:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:11,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:11,829 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:52:11,829 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:52:11,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 19:52:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:52:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 385. [2020-02-10 19:52:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:52:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-02-10 19:52:11,839 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-02-10 19:52:11,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:11,840 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-02-10 19:52:11,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-02-10 19:52:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:11,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:11,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 19:52:11,840 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 19:52:11,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:11,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1355343222, now seen corresponding path program 1206 times [2020-02-10 19:52:11,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:11,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121524456] [2020-02-10 19:52:11,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:12,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 19:52:12,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121524456] [2020-02-10 19:52:12,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:12,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:12,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812889397] [2020-02-10 19:52:12,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:12,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:12,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:12,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:12,146 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:52:12,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:12,259 INFO L93 Difference]: Finished difference Result 589 states and 1730 transitions. [2020-02-10 19:52:12,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:12,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:12,261 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:52:12,262 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:52:12,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 19:52:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:52:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 382. [2020-02-10 19:52:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1318 transitions. [2020-02-10 19:52:12,272 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1318 transitions. Word has length 22 [2020-02-10 19:52:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:12,272 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1318 transitions. [2020-02-10 19:52:12,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1318 transitions. [2020-02-10 19:52:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:12,273 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:12,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 19:52:12,273 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 19:52:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:12,273 INFO L82 PathProgramCache]: Analyzing trace with hash 692781234, now seen corresponding path program 1207 times [2020-02-10 19:52:12,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:12,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908124856] [2020-02-10 19:52:12,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:12,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 19:52:12,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908124856] [2020-02-10 19:52:12,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:12,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:12,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206727967] [2020-02-10 19:52:12,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:12,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:12,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:12,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:12,554 INFO L87 Difference]: Start difference. First operand 382 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:52:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:12,646 INFO L93 Difference]: Finished difference Result 612 states and 1780 transitions. [2020-02-10 19:52:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:12,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:12,647 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:52:12,648 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:52:12,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:52:12,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 387. [2020-02-10 19:52:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:52:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-02-10 19:52:12,658 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-02-10 19:52:12,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:12,658 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-02-10 19:52:12,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-02-10 19:52:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:12,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:12,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 19:52:12,658 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 19:52:12,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:12,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1253849726, now seen corresponding path program 1208 times [2020-02-10 19:52:12,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:12,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246597966] [2020-02-10 19:52:12,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:12,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 19:52:12,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246597966] [2020-02-10 19:52:12,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:12,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:12,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944476760] [2020-02-10 19:52:12,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:12,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:12,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:12,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:12,943 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:52:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:13,024 INFO L93 Difference]: Finished difference Result 605 states and 1765 transitions. [2020-02-10 19:52:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:13,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:13,026 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:52:13,026 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:52:13,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:52:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 385. [2020-02-10 19:52:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:52:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-02-10 19:52:13,047 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-02-10 19:52:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:13,047 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-02-10 19:52:13,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-02-10 19:52:13,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:13,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:13,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 19:52:13,048 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 19:52:13,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:13,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1705473766, now seen corresponding path program 1209 times [2020-02-10 19:52:13,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:13,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936668366] [2020-02-10 19:52:13,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:13,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936668366] [2020-02-10 19:52:13,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:13,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:13,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342359319] [2020-02-10 19:52:13,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:13,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:13,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:13,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:13,346 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:52:13,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:13,428 INFO L93 Difference]: Finished difference Result 623 states and 1804 transitions. [2020-02-10 19:52:13,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:13,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:13,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:13,430 INFO L225 Difference]: With dead ends: 623 [2020-02-10 19:52:13,431 INFO L226 Difference]: Without dead ends: 607 [2020-02-10 19:52:13,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 19:52:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-02-10 19:52:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 393. [2020-02-10 19:52:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:52:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1337 transitions. [2020-02-10 19:52:13,440 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1337 transitions. Word has length 22 [2020-02-10 19:52:13,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:13,440 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1337 transitions. [2020-02-10 19:52:13,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1337 transitions. [2020-02-10 19:52:13,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:13,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:13,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 19:52:13,441 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 19:52:13,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:13,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1575503320, now seen corresponding path program 1210 times [2020-02-10 19:52:13,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:13,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600128197] [2020-02-10 19:52:13,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:13,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 19:52:13,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600128197] [2020-02-10 19:52:13,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:13,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:13,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413110398] [2020-02-10 19:52:13,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:13,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:13,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:13,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:13,735 INFO L87 Difference]: Start difference. First operand 393 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:52:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:13,846 INFO L93 Difference]: Finished difference Result 621 states and 1794 transitions. [2020-02-10 19:52:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:13,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:13,848 INFO L225 Difference]: With dead ends: 621 [2020-02-10 19:52:13,848 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:52:13,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 19:52:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:52:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 385. [2020-02-10 19:52:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:52:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-02-10 19:52:13,857 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-02-10 19:52:13,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:13,858 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-02-10 19:52:13,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:13,858 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-02-10 19:52:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:13,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:13,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 19:52:13,858 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 19:52:13,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:13,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1760195992, now seen corresponding path program 1211 times [2020-02-10 19:52:13,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:13,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084200298] [2020-02-10 19:52:13,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:14,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 19:52:14,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084200298] [2020-02-10 19:52:14,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:14,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:14,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053481825] [2020-02-10 19:52:14,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:14,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:14,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:14,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:14,164 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:52:14,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:14,245 INFO L93 Difference]: Finished difference Result 602 states and 1757 transitions. [2020-02-10 19:52:14,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:14,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:14,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:14,247 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:52:14,247 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:52:14,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 19:52:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:52:14,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 386. [2020-02-10 19:52:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-02-10 19:52:14,258 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-02-10 19:52:14,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:14,258 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-02-10 19:52:14,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-02-10 19:52:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:14,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:14,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 19:52:14,259 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 19:52:14,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:14,259 INFO L82 PathProgramCache]: Analyzing trace with hash 684484836, now seen corresponding path program 1212 times [2020-02-10 19:52:14,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:14,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916825565] [2020-02-10 19:52:14,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:14,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916825565] [2020-02-10 19:52:14,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:14,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:14,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657695384] [2020-02-10 19:52:14,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:14,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:14,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:14,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:14,535 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:52:14,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:14,642 INFO L93 Difference]: Finished difference Result 607 states and 1766 transitions. [2020-02-10 19:52:14,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:14,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:14,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:14,644 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:52:14,644 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 19:52:14,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 19:52:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 19:52:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 382. [2020-02-10 19:52:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-02-10 19:52:14,653 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-02-10 19:52:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:14,653 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-02-10 19:52:14,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-02-10 19:52:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:14,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:14,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 19:52:14,654 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 19:52:14,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:14,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1018377458, now seen corresponding path program 1213 times [2020-02-10 19:52:14,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:14,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703835108] [2020-02-10 19:52:14,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:14,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 19:52:14,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703835108] [2020-02-10 19:52:14,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:14,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:14,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734633022] [2020-02-10 19:52:14,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:14,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:14,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:14,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:14,930 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:52:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:15,023 INFO L93 Difference]: Finished difference Result 618 states and 1794 transitions. [2020-02-10 19:52:15,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:15,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:15,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:15,025 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:52:15,025 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:52: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 19:52:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:52:15,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 389. [2020-02-10 19:52:15,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:52:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1331 transitions. [2020-02-10 19:52:15,035 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1331 transitions. Word has length 22 [2020-02-10 19:52:15,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:15,035 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1331 transitions. [2020-02-10 19:52:15,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1331 transitions. [2020-02-10 19:52:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:15,036 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:15,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 19:52:15,037 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 19:52:15,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash 56173796, now seen corresponding path program 1214 times [2020-02-10 19:52:15,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:15,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084389517] [2020-02-10 19:52:15,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:15,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 19:52:15,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084389517] [2020-02-10 19:52:15,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:15,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:15,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109811809] [2020-02-10 19:52:15,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:15,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:15,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:15,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:15,303 INFO L87 Difference]: Start difference. First operand 389 states and 1331 transitions. Second operand 9 states. [2020-02-10 19:52:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:15,416 INFO L93 Difference]: Finished difference Result 612 states and 1780 transitions. [2020-02-10 19:52:15,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:15,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:15,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:15,418 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:52:15,418 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:52:15,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 19:52:15,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:52:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 386. [2020-02-10 19:52:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1324 transitions. [2020-02-10 19:52:15,428 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1324 transitions. Word has length 22 [2020-02-10 19:52:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:15,428 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1324 transitions. [2020-02-10 19:52:15,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1324 transitions. [2020-02-10 19:52:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:15,429 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:15,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 19:52:15,429 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 19:52:15,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:15,429 INFO L82 PathProgramCache]: Analyzing trace with hash -663459452, now seen corresponding path program 1215 times [2020-02-10 19:52:15,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:15,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901048234] [2020-02-10 19:52:15,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:15,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 19:52:15,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901048234] [2020-02-10 19:52:15,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:15,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:15,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928119185] [2020-02-10 19:52:15,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:15,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:15,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:15,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:15,730 INFO L87 Difference]: Start difference. First operand 386 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:52:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:15,808 INFO L93 Difference]: Finished difference Result 627 states and 1812 transitions. [2020-02-10 19:52:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:15,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:15,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:15,810 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:52:15,811 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 19:52:15,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 19:52:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 394. [2020-02-10 19:52:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:52:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1337 transitions. [2020-02-10 19:52:15,820 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1337 transitions. Word has length 22 [2020-02-10 19:52:15,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:15,821 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1337 transitions. [2020-02-10 19:52:15,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1337 transitions. [2020-02-10 19:52:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:15,821 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:15,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 19:52:15,821 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 19:52:15,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:15,822 INFO L82 PathProgramCache]: Analyzing trace with hash -793429898, now seen corresponding path program 1216 times [2020-02-10 19:52:15,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:15,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829289846] [2020-02-10 19:52:15,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:16,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 19:52:16,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829289846] [2020-02-10 19:52:16,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:16,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:16,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411884104] [2020-02-10 19:52:16,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:16,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:16,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:16,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:16,123 INFO L87 Difference]: Start difference. First operand 394 states and 1337 transitions. Second operand 9 states. [2020-02-10 19:52:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:16,231 INFO L93 Difference]: Finished difference Result 625 states and 1802 transitions. [2020-02-10 19:52:16,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:16,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:16,233 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:52:16,233 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 19:52:16,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 19:52:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 19:52:16,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 386. [2020-02-10 19:52:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1320 transitions. [2020-02-10 19:52:16,243 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1320 transitions. Word has length 22 [2020-02-10 19:52:16,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:16,243 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1320 transitions. [2020-02-10 19:52:16,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:16,243 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1320 transitions. [2020-02-10 19:52:16,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:16,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:16,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 19:52:16,244 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 19:52:16,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:16,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1557821440, now seen corresponding path program 1217 times [2020-02-10 19:52:16,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:16,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077805561] [2020-02-10 19:52:16,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:16,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 19:52:16,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077805561] [2020-02-10 19:52:16,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:16,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:16,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357864176] [2020-02-10 19:52:16,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:16,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:16,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:16,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:16,521 INFO L87 Difference]: Start difference. First operand 386 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:52:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:16,631 INFO L93 Difference]: Finished difference Result 609 states and 1771 transitions. [2020-02-10 19:52:16,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:16,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:16,633 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:52:16,633 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:52:16,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:52:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 388. [2020-02-10 19:52:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:52:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1323 transitions. [2020-02-10 19:52:16,642 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1323 transitions. Word has length 22 [2020-02-10 19:52:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:16,642 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1323 transitions. [2020-02-10 19:52:16,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1323 transitions. [2020-02-10 19:52:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:16,643 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:16,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 19:52:16,643 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 19:52:16,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:16,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1819195666, now seen corresponding path program 1218 times [2020-02-10 19:52:16,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:16,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261909230] [2020-02-10 19:52:16,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:16,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 19:52:16,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261909230] [2020-02-10 19:52:16,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:16,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:16,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119931428] [2020-02-10 19:52:16,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:16,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:16,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:16,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:16,917 INFO L87 Difference]: Start difference. First operand 388 states and 1323 transitions. Second operand 9 states. [2020-02-10 19:52:17,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:17,044 INFO L93 Difference]: Finished difference Result 613 states and 1777 transitions. [2020-02-10 19:52:17,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:17,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:17,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:17,046 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:52:17,046 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:52:17,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 19:52:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:52:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 382. [2020-02-10 19:52:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1312 transitions. [2020-02-10 19:52:17,054 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1312 transitions. Word has length 22 [2020-02-10 19:52:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:17,054 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1312 transitions. [2020-02-10 19:52:17,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1312 transitions. [2020-02-10 19:52:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:17,055 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:17,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 19:52:17,055 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 19:52:17,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:17,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1738732674, now seen corresponding path program 1219 times [2020-02-10 19:52:17,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:17,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739591410] [2020-02-10 19:52:17,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:17,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 19:52:17,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739591410] [2020-02-10 19:52:17,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:17,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:17,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041151022] [2020-02-10 19:52:17,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:17,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:17,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:17,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:17,351 INFO L87 Difference]: Start difference. First operand 382 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:52:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:17,430 INFO L93 Difference]: Finished difference Result 583 states and 1715 transitions. [2020-02-10 19:52:17,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:17,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:17,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:17,432 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:52:17,432 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:52:17,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:17,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:52:17,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 384. [2020-02-10 19:52:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1316 transitions. [2020-02-10 19:52:17,442 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1316 transitions. Word has length 22 [2020-02-10 19:52:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:17,442 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1316 transitions. [2020-02-10 19:52:17,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1316 transitions. [2020-02-10 19:52:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:17,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:17,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:17,443 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 19:52:17,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:17,443 INFO L82 PathProgramCache]: Analyzing trace with hash -127791716, now seen corresponding path program 1220 times [2020-02-10 19:52:17,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:17,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893932862] [2020-02-10 19:52:17,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:17,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 19:52:17,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893932862] [2020-02-10 19:52:17,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:17,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:17,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040288891] [2020-02-10 19:52:17,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:17,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:17,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:17,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:17,734 INFO L87 Difference]: Start difference. First operand 384 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:52:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:17,843 INFO L93 Difference]: Finished difference Result 584 states and 1716 transitions. [2020-02-10 19:52:17,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:17,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:17,845 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:52:17,845 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 19:52:17,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 19:52:17,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 383. [2020-02-10 19:52:17,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1314 transitions. [2020-02-10 19:52:17,855 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1314 transitions. Word has length 22 [2020-02-10 19:52:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:17,855 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1314 transitions. [2020-02-10 19:52:17,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1314 transitions. [2020-02-10 19:52:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:17,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:17,855 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:17,856 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 19:52:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash 874397712, now seen corresponding path program 1221 times [2020-02-10 19:52:17,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:17,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782060721] [2020-02-10 19:52:17,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:18,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 19:52:18,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782060721] [2020-02-10 19:52:18,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:18,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:18,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391730011] [2020-02-10 19:52:18,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:18,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:18,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:18,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:18,147 INFO L87 Difference]: Start difference. First operand 383 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:52:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:18,229 INFO L93 Difference]: Finished difference Result 587 states and 1722 transitions. [2020-02-10 19:52:18,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:18,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:18,231 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:52:18,231 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:52:18,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:52:18,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 384. [2020-02-10 19:52:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-02-10 19:52:18,241 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-02-10 19:52:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:18,241 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-02-10 19:52:18,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-02-10 19:52:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:18,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:18,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 19:52:18,242 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 19:52:18,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:18,242 INFO L82 PathProgramCache]: Analyzing trace with hash -201313444, now seen corresponding path program 1222 times [2020-02-10 19:52:18,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:18,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575353890] [2020-02-10 19:52:18,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:18,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 19:52:18,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575353890] [2020-02-10 19:52:18,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:18,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:18,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716446802] [2020-02-10 19:52:18,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:18,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:18,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:18,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:18,516 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:52:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:18,633 INFO L93 Difference]: Finished difference Result 592 states and 1731 transitions. [2020-02-10 19:52:18,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:18,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:18,635 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:52:18,635 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:52:18,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 19:52:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:52:18,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 383. [2020-02-10 19:52:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-02-10 19:52:18,645 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-02-10 19:52:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:18,645 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-02-10 19:52:18,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-02-10 19:52:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:18,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:18,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 19:52:18,646 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 19:52:18,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:18,646 INFO L82 PathProgramCache]: Analyzing trace with hash 884900816, now seen corresponding path program 1223 times [2020-02-10 19:52:18,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:18,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732203956] [2020-02-10 19:52:18,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:18,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 19:52:18,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732203956] [2020-02-10 19:52:18,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:18,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:18,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198134210] [2020-02-10 19:52:18,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:18,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:18,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:18,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:18,923 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:52:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:19,033 INFO L93 Difference]: Finished difference Result 590 states and 1728 transitions. [2020-02-10 19:52:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:19,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:19,035 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:52:19,035 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:52:19,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 19:52:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:52:19,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 385. [2020-02-10 19:52:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:52:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1316 transitions. [2020-02-10 19:52:19,045 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1316 transitions. Word has length 22 [2020-02-10 19:52:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:19,046 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1316 transitions. [2020-02-10 19:52:19,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1316 transitions. [2020-02-10 19:52:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:19,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:19,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 19:52:19,046 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 19:52:19,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:19,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1801751298, now seen corresponding path program 1224 times [2020-02-10 19:52:19,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:19,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140839089] [2020-02-10 19:52:19,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:19,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 19:52:19,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140839089] [2020-02-10 19:52:19,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:19,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:19,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145574250] [2020-02-10 19:52:19,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:19,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:19,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:19,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:19,330 INFO L87 Difference]: Start difference. First operand 385 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:52:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:19,440 INFO L93 Difference]: Finished difference Result 594 states and 1734 transitions. [2020-02-10 19:52:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:19,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:19,442 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:52:19,442 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:52:19,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 19:52:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:52:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 379. [2020-02-10 19:52:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:52:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1306 transitions. [2020-02-10 19:52:19,450 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1306 transitions. Word has length 22 [2020-02-10 19:52:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:19,451 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1306 transitions. [2020-02-10 19:52:19,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1306 transitions. [2020-02-10 19:52:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:19,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52: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 19:52:19,451 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 19:52:19,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:19,452 INFO L82 PathProgramCache]: Analyzing trace with hash 867632166, now seen corresponding path program 1225 times [2020-02-10 19:52:19,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:19,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646692184] [2020-02-10 19:52:19,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:19,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 19:52:19,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646692184] [2020-02-10 19:52:19,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:19,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:19,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567536251] [2020-02-10 19:52:19,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:19,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:19,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:19,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:19,725 INFO L87 Difference]: Start difference. First operand 379 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:52:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:19,807 INFO L93 Difference]: Finished difference Result 592 states and 1732 transitions. [2020-02-10 19:52:19,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:19,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:19,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:19,809 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:52:19,809 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:52:19,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 19:52:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:52:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 385. [2020-02-10 19:52:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:52:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1322 transitions. [2020-02-10 19:52:19,819 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1322 transitions. Word has length 22 [2020-02-10 19:52:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:19,819 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1322 transitions. [2020-02-10 19:52:19,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1322 transitions. [2020-02-10 19:52:19,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:19,820 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:19,820 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:19,820 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 19:52:19,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:19,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1428700658, now seen corresponding path program 1226 times [2020-02-10 19:52:19,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:19,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852671366] [2020-02-10 19:52:19,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:20,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 19:52:20,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852671366] [2020-02-10 19:52:20,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:20,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:20,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819630089] [2020-02-10 19:52:20,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:20,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:20,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:20,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:20,100 INFO L87 Difference]: Start difference. First operand 385 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:52:20,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:20,184 INFO L93 Difference]: Finished difference Result 585 states and 1717 transitions. [2020-02-10 19:52:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:20,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:20,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:20,186 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:52:20,186 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:52:20,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 19:52:20,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:52:20,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 383. [2020-02-10 19:52:20,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-02-10 19:52:20,197 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-02-10 19:52:20,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:20,197 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-02-10 19:52:20,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-02-10 19:52:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:20,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:20,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:20,198 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 19:52:20,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:20,198 INFO L82 PathProgramCache]: Analyzing trace with hash -732805688, now seen corresponding path program 1227 times [2020-02-10 19:52:20,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:20,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951851381] [2020-02-10 19:52:20,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:20,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951851381] [2020-02-10 19:52:20,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:20,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:20,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523836176] [2020-02-10 19:52:20,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:20,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:20,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:20,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:20,487 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:52:20,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:20,569 INFO L93 Difference]: Finished difference Result 594 states and 1735 transitions. [2020-02-10 19:52:20,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:20,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:20,571 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:52:20,571 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:52:20,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 19:52:20,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:52:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 386. [2020-02-10 19:52:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-02-10 19:52:20,582 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-02-10 19:52:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:20,582 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-02-10 19:52:20,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:20,582 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-02-10 19:52:20,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:20,583 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:20,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 19:52:20,583 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 19:52:20,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:20,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1695009350, now seen corresponding path program 1228 times [2020-02-10 19:52:20,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:20,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986932089] [2020-02-10 19:52:20,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:20,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 19:52:20,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986932089] [2020-02-10 19:52:20,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:20,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:20,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127280537] [2020-02-10 19:52:20,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:20,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:20,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:20,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:20,853 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:52:20,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:20,958 INFO L93 Difference]: Finished difference Result 588 states and 1721 transitions. [2020-02-10 19:52:20,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:20,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:20,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:20,959 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:52:20,959 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:52:20,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 19:52:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:52:20,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 383. [2020-02-10 19:52:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-02-10 19:52:20,968 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-02-10 19:52:20,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:20,969 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-02-10 19:52:20,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:20,969 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-02-10 19:52:20,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:20,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:20,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:20,969 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 19:52:20,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:20,970 INFO L82 PathProgramCache]: Analyzing trace with hash -678083462, now seen corresponding path program 1229 times [2020-02-10 19:52:20,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:20,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183631543] [2020-02-10 19:52:20,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:21,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 19:52:21,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183631543] [2020-02-10 19:52:21,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:21,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:21,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022127129] [2020-02-10 19:52:21,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:21,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:21,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:21,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:21,267 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:52:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:21,352 INFO L93 Difference]: Finished difference Result 578 states and 1702 transitions. [2020-02-10 19:52:21,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:21,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:21,354 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:52:21,354 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 19:52:21,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 19:52:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 19:52:21,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 384. [2020-02-10 19:52:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-02-10 19:52:21,365 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-02-10 19:52:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:21,365 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-02-10 19:52:21,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-02-10 19:52:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:21,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:21,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 19:52:21,366 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 19:52:21,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:21,366 INFO L82 PathProgramCache]: Analyzing trace with hash 932857496, now seen corresponding path program 1230 times [2020-02-10 19:52:21,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:21,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843811227] [2020-02-10 19:52:21,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:21,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 19:52:21,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843811227] [2020-02-10 19:52:21,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:21,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:21,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893459877] [2020-02-10 19:52:21,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:21,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:21,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:21,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:21,674 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:52:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:21,785 INFO L93 Difference]: Finished difference Result 579 states and 1703 transitions. [2020-02-10 19:52:21,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:21,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:21,787 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:52:21,787 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:52:21,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 19:52:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:52:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 381. [2020-02-10 19:52:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:52:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1312 transitions. [2020-02-10 19:52:21,797 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1312 transitions. Word has length 22 [2020-02-10 19:52:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:21,797 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1312 transitions. [2020-02-10 19:52:21,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1312 transitions. [2020-02-10 19:52:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:21,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:21,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 19:52:21,797 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 19:52:21,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:21,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2098637710, now seen corresponding path program 1231 times [2020-02-10 19:52:21,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:21,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804175639] [2020-02-10 19:52:21,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:22,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 19:52:22,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804175639] [2020-02-10 19:52:22,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:22,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:22,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505434560] [2020-02-10 19:52:22,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:22,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:22,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:22,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:22,084 INFO L87 Difference]: Start difference. First operand 381 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:52:22,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:22,184 INFO L93 Difference]: Finished difference Result 594 states and 1736 transitions. [2020-02-10 19:52:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:22,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:22,186 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:52:22,186 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:52:22,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:52:22,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 385. [2020-02-10 19:52:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:52:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1320 transitions. [2020-02-10 19:52:22,197 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1320 transitions. Word has length 22 [2020-02-10 19:52:22,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:22,197 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1320 transitions. [2020-02-10 19:52:22,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:22,197 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1320 transitions. [2020-02-10 19:52:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:22,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:22,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:22,198 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 19:52:22,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:22,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1537569218, now seen corresponding path program 1232 times [2020-02-10 19:52:22,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:22,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052406867] [2020-02-10 19:52:22,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:22,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 19:52:22,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052406867] [2020-02-10 19:52:22,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:22,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:22,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117816148] [2020-02-10 19:52:22,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:22,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:22,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:22,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:22,482 INFO L87 Difference]: Start difference. First operand 385 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:52:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:22,573 INFO L93 Difference]: Finished difference Result 587 states and 1721 transitions. [2020-02-10 19:52:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:22,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:22,575 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:52:22,575 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:52:22,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 19:52:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:52:22,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 383. [2020-02-10 19:52:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-02-10 19:52:22,596 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-02-10 19:52:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:22,596 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-02-10 19:52:22,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-02-10 19:52:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:22,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:22,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 19:52:22,597 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 19:52:22,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:22,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1608584264, now seen corresponding path program 1233 times [2020-02-10 19:52:22,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:22,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207150429] [2020-02-10 19:52:22,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52: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 19:52:22,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207150429] [2020-02-10 19:52:22,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:22,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:22,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74518331] [2020-02-10 19:52:22,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:22,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:22,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:22,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:22,887 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:52:22,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:22,966 INFO L93 Difference]: Finished difference Result 592 states and 1735 transitions. [2020-02-10 19:52:22,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:22,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:22,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:22,968 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:52:22,968 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:52:22,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 19:52:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:52:22,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 388. [2020-02-10 19:52:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:52:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1324 transitions. [2020-02-10 19:52:22,978 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1324 transitions. Word has length 22 [2020-02-10 19:52:22,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:22,978 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1324 transitions. [2020-02-10 19:52:22,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1324 transitions. [2020-02-10 19:52:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:22,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:22,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 19:52:22,979 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 19:52:22,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:22,979 INFO L82 PathProgramCache]: Analyzing trace with hash -664466374, now seen corresponding path program 1234 times [2020-02-10 19:52:22,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:22,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370558618] [2020-02-10 19:52:22,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52: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 19:52:23,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370558618] [2020-02-10 19:52:23,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:23,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:23,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441689392] [2020-02-10 19:52:23,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:23,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:23,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:23,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:23,266 INFO L87 Difference]: Start difference. First operand 388 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:52:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:23,369 INFO L93 Difference]: Finished difference Result 579 states and 1715 transitions. [2020-02-10 19:52:23,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:23,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:23,371 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:52:23,371 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:52:23,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:52:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 383. [2020-02-10 19:52:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1314 transitions. [2020-02-10 19:52:23,380 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1314 transitions. Word has length 22 [2020-02-10 19:52:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:23,380 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1314 transitions. [2020-02-10 19:52:23,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1314 transitions. [2020-02-10 19:52:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:23,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:23,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:23,381 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 19:52:23,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:23,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1663306490, now seen corresponding path program 1235 times [2020-02-10 19:52:23,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:23,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761956465] [2020-02-10 19:52:23,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:23,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 19:52:23,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761956465] [2020-02-10 19:52:23,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:23,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:23,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614873928] [2020-02-10 19:52:23,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:23,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:23,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:23,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:23,674 INFO L87 Difference]: Start difference. First operand 383 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:52:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:23,757 INFO L93 Difference]: Finished difference Result 581 states and 1709 transitions. [2020-02-10 19:52:23,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:23,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:23,759 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:52:23,760 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:52:23,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 19:52:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:52:23,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 384. [2020-02-10 19:52:23,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-02-10 19:52:23,769 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-02-10 19:52:23,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:23,769 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-02-10 19:52:23,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-02-10 19:52:23,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:23,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:23,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 19:52:23,770 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 19:52:23,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:23,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2096431004, now seen corresponding path program 1236 times [2020-02-10 19:52:23,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:23,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103962332] [2020-02-10 19:52:23,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:24,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 19:52:24,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103962332] [2020-02-10 19:52:24,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:24,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:24,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419070158] [2020-02-10 19:52:24,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:24,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:24,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:24,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:24,064 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:52:24,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:24,170 INFO L93 Difference]: Finished difference Result 575 states and 1706 transitions. [2020-02-10 19:52:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:24,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:24,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:24,172 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:52:24,172 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:52:24,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 19:52:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:52:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 381. [2020-02-10 19:52:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:52:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-02-10 19:52:24,182 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-02-10 19:52:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:24,182 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-02-10 19:52:24,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-02-10 19:52:24,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:24,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:24,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 19:52:24,183 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 19:52:24,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:24,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1773041486, now seen corresponding path program 1237 times [2020-02-10 19:52:24,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:24,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736137002] [2020-02-10 19:52:24,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:24,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 19:52:24,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736137002] [2020-02-10 19:52:24,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:24,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:24,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747321392] [2020-02-10 19:52:24,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:24,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:24,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:24,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:24,468 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:52:24,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:24,547 INFO L93 Difference]: Finished difference Result 599 states and 1748 transitions. [2020-02-10 19:52:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:24,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:24,549 INFO L225 Difference]: With dead ends: 599 [2020-02-10 19:52:24,549 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:52:24,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 19:52:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:52:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 387. [2020-02-10 19:52:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:52:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1324 transitions. [2020-02-10 19:52:24,559 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1324 transitions. Word has length 22 [2020-02-10 19:52:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:24,559 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1324 transitions. [2020-02-10 19:52:24,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1324 transitions. [2020-02-10 19:52:24,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:24,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:24,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 19:52:24,560 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 19:52:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:24,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1559722148, now seen corresponding path program 1238 times [2020-02-10 19:52:24,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:24,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551236654] [2020-02-10 19:52:24,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:24,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 19:52:24,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551236654] [2020-02-10 19:52:24,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:24,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:24,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922564633] [2020-02-10 19:52:24,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:24,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:24,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:24,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:24,841 INFO L87 Difference]: Start difference. First operand 387 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:52:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:24,961 INFO L93 Difference]: Finished difference Result 593 states and 1734 transitions. [2020-02-10 19:52:24,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:24,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:24,963 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:52:24,963 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:52:24,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:52:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 384. [2020-02-10 19:52:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-02-10 19:52:24,973 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-02-10 19:52:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:24,973 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-02-10 19:52:24,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-02-10 19:52:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:24,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:24,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 19:52:24,974 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 19:52:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash -760348954, now seen corresponding path program 1239 times [2020-02-10 19:52:24,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:24,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979727090] [2020-02-10 19:52:24,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:25,161 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2020-02-10 19:52:25,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 19:52:25,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979727090] [2020-02-10 19:52:25,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:25,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:25,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886246113] [2020-02-10 19:52:25,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:25,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:25,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:25,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:25,375 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:52:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:25,453 INFO L93 Difference]: Finished difference Result 595 states and 1741 transitions. [2020-02-10 19:52:25,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:25,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:25,455 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:52:25,455 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:52:25,455 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 19:52:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:52:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 389. [2020-02-10 19:52:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:52:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1325 transitions. [2020-02-10 19:52:25,466 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1325 transitions. Word has length 22 [2020-02-10 19:52:25,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:25,466 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1325 transitions. [2020-02-10 19:52:25,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:25,466 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1325 transitions. [2020-02-10 19:52:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:25,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:25,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 19:52:25,467 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 19:52:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:25,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1261567704, now seen corresponding path program 1240 times [2020-02-10 19:52:25,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:25,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759785496] [2020-02-10 19:52:25,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:25,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 19:52:25,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759785496] [2020-02-10 19:52:25,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:25,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:25,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841452220] [2020-02-10 19:52:25,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:25,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:25,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:25,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:25,755 INFO L87 Difference]: Start difference. First operand 389 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:52:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:25,859 INFO L93 Difference]: Finished difference Result 582 states and 1721 transitions. [2020-02-10 19:52:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:25,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:25,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:25,861 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:52:25,861 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:52:25,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 19:52:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:52:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 384. [2020-02-10 19:52:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1314 transitions. [2020-02-10 19:52:25,871 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1314 transitions. Word has length 22 [2020-02-10 19:52:25,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:25,871 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1314 transitions. [2020-02-10 19:52:25,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1314 transitions. [2020-02-10 19:52:25,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:25,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:25,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 19:52:25,872 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 19:52:25,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:25,872 INFO L82 PathProgramCache]: Analyzing trace with hash -43769984, now seen corresponding path program 1241 times [2020-02-10 19:52:25,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:25,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889655735] [2020-02-10 19:52:25,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:26,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 19:52:26,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889655735] [2020-02-10 19:52:26,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:26,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:26,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643170931] [2020-02-10 19:52:26,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:26,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:26,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:26,148 INFO L87 Difference]: Start difference. First operand 384 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:52:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:26,253 INFO L93 Difference]: Finished difference Result 586 states and 1719 transitions. [2020-02-10 19:52:26,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:26,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:26,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:26,255 INFO L225 Difference]: With dead ends: 586 [2020-02-10 19:52:26,255 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:52:26,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 19:52:26,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:52:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 386. [2020-02-10 19:52:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1317 transitions. [2020-02-10 19:52:26,264 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1317 transitions. Word has length 22 [2020-02-10 19:52:26,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:26,264 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1317 transitions. [2020-02-10 19:52:26,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:26,264 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1317 transitions. [2020-02-10 19:52:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:26,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52: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 19:52:26,265 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 19:52:26,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:26,265 INFO L82 PathProgramCache]: Analyzing trace with hash -217017676, now seen corresponding path program 1242 times [2020-02-10 19:52:26,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:26,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438775015] [2020-02-10 19:52:26,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:26,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 19:52:26,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438775015] [2020-02-10 19:52:26,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:26,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:26,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135583729] [2020-02-10 19:52:26,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:26,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:26,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:26,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:26,551 INFO L87 Difference]: Start difference. First operand 386 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:52:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:26,662 INFO L93 Difference]: Finished difference Result 579 states and 1713 transitions. [2020-02-10 19:52:26,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:26,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:26,664 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:52:26,664 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:52:26,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:26,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:52:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 381. [2020-02-10 19:52:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:52:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1308 transitions. [2020-02-10 19:52:26,673 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1308 transitions. Word has length 22 [2020-02-10 19:52:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:26,673 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1308 transitions. [2020-02-10 19:52:26,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1308 transitions. [2020-02-10 19:52:26,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:26,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:26,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 19:52:26,674 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 19:52:26,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:26,675 INFO L82 PathProgramCache]: Analyzing trace with hash -235184322, now seen corresponding path program 1243 times [2020-02-10 19:52:26,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:26,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884940245] [2020-02-10 19:52:26,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:26,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 19:52:26,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884940245] [2020-02-10 19:52:26,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:26,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:26,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066098415] [2020-02-10 19:52:26,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:26,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:26,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:26,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:26,975 INFO L87 Difference]: Start difference. First operand 381 states and 1308 transitions. Second operand 9 states. [2020-02-10 19:52:27,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:27,065 INFO L93 Difference]: Finished difference Result 570 states and 1684 transitions. [2020-02-10 19:52:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:27,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:27,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:27,067 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:52:27,068 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:52:27,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 19:52:27,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:52:27,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 383. [2020-02-10 19:52:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1312 transitions. [2020-02-10 19:52:27,077 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1312 transitions. Word has length 22 [2020-02-10 19:52:27,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:27,078 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1312 transitions. [2020-02-10 19:52:27,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1312 transitions. [2020-02-10 19:52:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:27,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:27,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 19:52:27,078 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 19:52:27,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:27,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1375756636, now seen corresponding path program 1244 times [2020-02-10 19:52:27,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:27,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783124896] [2020-02-10 19:52:27,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:27,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 19:52:27,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783124896] [2020-02-10 19:52:27,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:27,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:27,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643070084] [2020-02-10 19:52:27,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:27,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:27,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:27,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:27,378 INFO L87 Difference]: Start difference. First operand 383 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:52:27,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:27,490 INFO L93 Difference]: Finished difference Result 571 states and 1685 transitions. [2020-02-10 19:52:27,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:27,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:27,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:27,492 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:52:27,492 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:52:27,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:27,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:52:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-02-10 19:52:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-02-10 19:52:27,503 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-02-10 19:52:27,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:27,503 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-02-10 19:52:27,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-02-10 19:52:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:27,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:27,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 19:52:27,504 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 19:52:27,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:27,504 INFO L82 PathProgramCache]: Analyzing trace with hash 777508210, now seen corresponding path program 1245 times [2020-02-10 19:52:27,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:27,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989452272] [2020-02-10 19:52:27,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:27,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 19:52:27,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989452272] [2020-02-10 19:52:27,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:27,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:27,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109464237] [2020-02-10 19:52:27,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:27,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:27,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:27,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:27,806 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:52:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:27,888 INFO L93 Difference]: Finished difference Result 571 states and 1686 transitions. [2020-02-10 19:52:27,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:27,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:27,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:27,889 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:52:27,890 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:52:27,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 19:52:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:52:27,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 383. [2020-02-10 19:52:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-02-10 19:52:27,900 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-02-10 19:52:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:27,900 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-02-10 19:52:27,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-02-10 19:52:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:27,901 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:27,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 19:52:27,901 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 19:52:27,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:27,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1312738012, now seen corresponding path program 1246 times [2020-02-10 19:52:27,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:27,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116816475] [2020-02-10 19:52:27,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:28,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 19:52:28,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116816475] [2020-02-10 19:52:28,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:28,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:28,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462560269] [2020-02-10 19:52:28,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:28,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:28,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:28,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:28,187 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:52:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:28,293 INFO L93 Difference]: Finished difference Result 565 states and 1683 transitions. [2020-02-10 19:52:28,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:28,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:28,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:28,294 INFO L225 Difference]: With dead ends: 565 [2020-02-10 19:52:28,295 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:52:28,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:28,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:52:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 382. [2020-02-10 19:52:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:28,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1309 transitions. [2020-02-10 19:52:28,304 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1309 transitions. Word has length 22 [2020-02-10 19:52:28,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:28,305 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1309 transitions. [2020-02-10 19:52:28,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1309 transitions. [2020-02-10 19:52:28,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:28,305 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:28,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 19:52:28,305 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 19:52:28,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:28,306 INFO L82 PathProgramCache]: Analyzing trace with hash 788011314, now seen corresponding path program 1247 times [2020-02-10 19:52:28,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:28,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036300912] [2020-02-10 19:52:28,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:28,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 19:52:28,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036300912] [2020-02-10 19:52:28,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:28,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:28,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89156043] [2020-02-10 19:52:28,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:28,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:28,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:28,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:28,591 INFO L87 Difference]: Start difference. First operand 382 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:52:28,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:28,695 INFO L93 Difference]: Finished difference Result 573 states and 1690 transitions. [2020-02-10 19:52:28,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:28,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:28,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:28,697 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:52:28,697 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:52:28,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 19:52:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:52:28,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-02-10 19:52:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1312 transitions. [2020-02-10 19:52:28,706 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1312 transitions. Word has length 22 [2020-02-10 19:52:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:28,707 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1312 transitions. [2020-02-10 19:52:28,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1312 transitions. [2020-02-10 19:52:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:28,707 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:28,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 19:52:28,707 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 19:52:28,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:28,708 INFO L82 PathProgramCache]: Analyzing trace with hash -287699842, now seen corresponding path program 1248 times [2020-02-10 19:52:28,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:28,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469779418] [2020-02-10 19:52:28,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:28,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 19:52:28,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469779418] [2020-02-10 19:52:28,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:28,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:28,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585874482] [2020-02-10 19:52:28,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:28,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:28,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:28,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:28,995 INFO L87 Difference]: Start difference. First operand 384 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:52:29,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:29,115 INFO L93 Difference]: Finished difference Result 566 states and 1684 transitions. [2020-02-10 19:52:29,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:29,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:29,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:29,118 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:52:29,118 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 19:52:29,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 19:52:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 19:52:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 379. [2020-02-10 19:52:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:52:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1304 transitions. [2020-02-10 19:52:29,129 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1304 transitions. Word has length 22 [2020-02-10 19:52:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:29,129 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1304 transitions. [2020-02-10 19:52:29,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1304 transitions. [2020-02-10 19:52:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:29,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:29,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 19:52:29,130 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 19:52:29,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:29,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1067271706, now seen corresponding path program 1249 times [2020-02-10 19:52:29,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:29,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882095400] [2020-02-10 19:52:29,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:29,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 19:52:29,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882095400] [2020-02-10 19:52:29,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:29,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:29,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918183896] [2020-02-10 19:52:29,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:29,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:29,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:29,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:29,411 INFO L87 Difference]: Start difference. First operand 379 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:52:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:29,491 INFO L93 Difference]: Finished difference Result 617 states and 1793 transitions. [2020-02-10 19:52:29,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:29,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:29,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:29,493 INFO L225 Difference]: With dead ends: 617 [2020-02-10 19:52:29,493 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 19:52:29,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 19:52:29,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 387. [2020-02-10 19:52:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:52:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1325 transitions. [2020-02-10 19:52:29,504 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1325 transitions. Word has length 22 [2020-02-10 19:52:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:29,504 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1325 transitions. [2020-02-10 19:52:29,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1325 transitions. [2020-02-10 19:52:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:29,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:29,505 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:29,505 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 19:52:29,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:29,505 INFO L82 PathProgramCache]: Analyzing trace with hash -506203214, now seen corresponding path program 1250 times [2020-02-10 19:52:29,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:29,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427818462] [2020-02-10 19:52:29,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:29,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 19:52:29,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427818462] [2020-02-10 19:52:29,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:29,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:29,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071691290] [2020-02-10 19:52:29,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:29,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:29,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:29,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:29,778 INFO L87 Difference]: Start difference. First operand 387 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:52:29,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:29,875 INFO L93 Difference]: Finished difference Result 610 states and 1778 transitions. [2020-02-10 19:52:29,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:29,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:29,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:29,877 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:52:29,878 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:52:29,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 19:52:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:52:29,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 385. [2020-02-10 19:52:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:52:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-02-10 19:52:29,888 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-02-10 19:52:29,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:29,888 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-02-10 19:52:29,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:29,888 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-02-10 19:52:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:29,888 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:29,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 19:52:29,889 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 19:52:29,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:29,889 INFO L82 PathProgramCache]: Analyzing trace with hash -54579174, now seen corresponding path program 1251 times [2020-02-10 19:52:29,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:29,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304107934] [2020-02-10 19:52:29,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:30,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 19:52:30,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304107934] [2020-02-10 19:52:30,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:30,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:30,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995540756] [2020-02-10 19:52:30,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:30,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:30,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:30,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:30,187 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-02-10 19:52:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:30,296 INFO L93 Difference]: Finished difference Result 628 states and 1817 transitions. [2020-02-10 19:52:30,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:30,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:30,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:30,298 INFO L225 Difference]: With dead ends: 628 [2020-02-10 19:52:30,298 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 19:52:30,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 19:52:30,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 19:52:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 393. [2020-02-10 19:52:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:52:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1334 transitions. [2020-02-10 19:52:30,308 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1334 transitions. Word has length 22 [2020-02-10 19:52:30,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:30,308 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1334 transitions. [2020-02-10 19:52:30,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1334 transitions. [2020-02-10 19:52:30,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:30,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:30,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 19:52:30,308 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 19:52:30,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:30,309 INFO L82 PathProgramCache]: Analyzing trace with hash -184549620, now seen corresponding path program 1252 times [2020-02-10 19:52:30,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:30,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026043768] [2020-02-10 19:52:30,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:30,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 19:52:30,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026043768] [2020-02-10 19:52:30,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:30,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:30,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407706724] [2020-02-10 19:52:30,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:30,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:30,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:30,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:30,600 INFO L87 Difference]: Start difference. First operand 393 states and 1334 transitions. Second operand 9 states. [2020-02-10 19:52:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:30,721 INFO L93 Difference]: Finished difference Result 626 states and 1807 transitions. [2020-02-10 19:52:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:30,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:30,723 INFO L225 Difference]: With dead ends: 626 [2020-02-10 19:52:30,723 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 19:52:30,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 19:52:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 385. [2020-02-10 19:52:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:52:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1318 transitions. [2020-02-10 19:52:30,733 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1318 transitions. Word has length 22 [2020-02-10 19:52:30,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:30,733 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1318 transitions. [2020-02-10 19:52:30,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1318 transitions. [2020-02-10 19:52:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:30,734 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:30,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:30,734 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 19:52:30,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:30,734 INFO L82 PathProgramCache]: Analyzing trace with hash 143052, now seen corresponding path program 1253 times [2020-02-10 19:52:30,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:30,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739943356] [2020-02-10 19:52:30,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:31,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 19:52:31,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739943356] [2020-02-10 19:52:31,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:31,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:31,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086774631] [2020-02-10 19:52:31,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:31,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:31,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:31,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:31,017 INFO L87 Difference]: Start difference. First operand 385 states and 1318 transitions. Second operand 9 states. [2020-02-10 19:52:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:31,130 INFO L93 Difference]: Finished difference Result 607 states and 1770 transitions. [2020-02-10 19:52:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:31,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:31,131 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:52:31,132 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:52:31,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 19:52:31,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:52:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 386. [2020-02-10 19:52:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1319 transitions. [2020-02-10 19:52:31,142 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1319 transitions. Word has length 22 [2020-02-10 19:52:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:31,142 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1319 transitions. [2020-02-10 19:52:31,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1319 transitions. [2020-02-10 19:52:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:31,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:31,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:31,143 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 19:52:31,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:31,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1075568104, now seen corresponding path program 1254 times [2020-02-10 19:52:31,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:31,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298933171] [2020-02-10 19:52:31,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:31,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 19:52:31,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298933171] [2020-02-10 19:52:31,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:31,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:31,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426349489] [2020-02-10 19:52:31,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:31,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:31,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:31,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:31,413 INFO L87 Difference]: Start difference. First operand 386 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:52:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:31,546 INFO L93 Difference]: Finished difference Result 612 states and 1779 transitions. [2020-02-10 19:52:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:31,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:31,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:31,548 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:52:31,548 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:52: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 19:52:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:52:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 382. [2020-02-10 19:52:31,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1312 transitions. [2020-02-10 19:52:31,558 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1312 transitions. Word has length 22 [2020-02-10 19:52:31,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:31,558 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1312 transitions. [2020-02-10 19:52:31,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:31,558 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1312 transitions. [2020-02-10 19:52:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:31,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:31,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 19:52:31,559 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 19:52:31,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:31,559 INFO L82 PathProgramCache]: Analyzing trace with hash 858762372, now seen corresponding path program 1255 times [2020-02-10 19:52:31,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:31,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748311476] [2020-02-10 19:52:31,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:31,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 19:52:31,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748311476] [2020-02-10 19:52:31,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:31,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:31,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475020463] [2020-02-10 19:52:31,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:31,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:31,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:31,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:31,838 INFO L87 Difference]: Start difference. First operand 382 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:52:31,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:31,936 INFO L93 Difference]: Finished difference Result 609 states and 1773 transitions. [2020-02-10 19:52:31,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:31,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:31,938 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:52:31,938 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:52:31,938 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:52:31,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 386. [2020-02-10 19:52:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1320 transitions. [2020-02-10 19:52:31,948 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1320 transitions. Word has length 22 [2020-02-10 19:52:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:31,948 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1320 transitions. [2020-02-10 19:52:31,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1320 transitions. [2020-02-10 19:52:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:31,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:31,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 19:52:31,949 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 19:52:31,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:31,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1419830864, now seen corresponding path program 1256 times [2020-02-10 19:52:31,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:31,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373344639] [2020-02-10 19:52:31,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:32,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 19:52:32,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373344639] [2020-02-10 19:52:32,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:32,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:32,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986197102] [2020-02-10 19:52:32,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:32,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:32,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:32,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:32,239 INFO L87 Difference]: Start difference. First operand 386 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:52:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:32,329 INFO L93 Difference]: Finished difference Result 602 states and 1758 transitions. [2020-02-10 19:52:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:32,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:32,331 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:52:32,331 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:52:32,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:52:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 384. [2020-02-10 19:52:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1316 transitions. [2020-02-10 19:52:32,341 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1316 transitions. Word has length 22 [2020-02-10 19:52:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:32,341 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1316 transitions. [2020-02-10 19:52:32,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1316 transitions. [2020-02-10 19:52:32,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:32,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:32,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 19:52:32,342 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 19:52:32,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:32,342 INFO L82 PathProgramCache]: Analyzing trace with hash 271017050, now seen corresponding path program 1257 times [2020-02-10 19:52:32,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:32,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616456881] [2020-02-10 19:52:32,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:32,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 19:52:32,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616456881] [2020-02-10 19:52:32,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:32,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:32,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049418337] [2020-02-10 19:52:32,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:32,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:32,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:32,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:32,637 INFO L87 Difference]: Start difference. First operand 384 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:52:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:32,748 INFO L93 Difference]: Finished difference Result 607 states and 1772 transitions. [2020-02-10 19:52:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:32,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:32,750 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:52:32,750 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:52:32,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 19:52:32,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:52:32,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 389. [2020-02-10 19:52:32,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:52:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1324 transitions. [2020-02-10 19:52:32,760 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1324 transitions. Word has length 22 [2020-02-10 19:52:32,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:32,761 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1324 transitions. [2020-02-10 19:52:32,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1324 transitions. [2020-02-10 19:52:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:32,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:32,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 19:52:32,761 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 19:52:32,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:32,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2002033588, now seen corresponding path program 1258 times [2020-02-10 19:52:32,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:32,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202128811] [2020-02-10 19:52:32,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:33,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 19:52:33,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202128811] [2020-02-10 19:52:33,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:33,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:33,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654464646] [2020-02-10 19:52:33,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:33,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:33,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:33,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:33,042 INFO L87 Difference]: Start difference. First operand 389 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:52:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:33,156 INFO L93 Difference]: Finished difference Result 594 states and 1752 transitions. [2020-02-10 19:52:33,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:33,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:33,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:33,158 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:52:33,158 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:52:33,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 19:52:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:52:33,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 384. [2020-02-10 19:52:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1314 transitions. [2020-02-10 19:52:33,168 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1314 transitions. Word has length 22 [2020-02-10 19:52:33,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:33,168 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1314 transitions. [2020-02-10 19:52:33,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1314 transitions. [2020-02-10 19:52:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:33,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:33,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 19:52:33,169 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 19:52:33,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:33,169 INFO L82 PathProgramCache]: Analyzing trace with hash 325739276, now seen corresponding path program 1259 times [2020-02-10 19:52:33,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:33,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084177653] [2020-02-10 19:52:33,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:33,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 19:52:33,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084177653] [2020-02-10 19:52:33,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:33,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:33,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305030668] [2020-02-10 19:52:33,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:33,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:33,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:33,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:33,467 INFO L87 Difference]: Start difference. First operand 384 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:52:33,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:33,579 INFO L93 Difference]: Finished difference Result 596 states and 1746 transitions. [2020-02-10 19:52:33,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:33,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:33,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:33,581 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:52:33,581 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:52:33,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 19:52:33,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:52:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 385. [2020-02-10 19:52:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:52:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1315 transitions. [2020-02-10 19:52:33,592 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1315 transitions. Word has length 22 [2020-02-10 19:52:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:33,592 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1315 transitions. [2020-02-10 19:52:33,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1315 transitions. [2020-02-10 19:52:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:33,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:33,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 19:52:33,593 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 19:52:33,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:33,593 INFO L82 PathProgramCache]: Analyzing trace with hash 860969078, now seen corresponding path program 1260 times [2020-02-10 19:52:33,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:33,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17475018] [2020-02-10 19:52:33,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:33,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 19:52:33,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17475018] [2020-02-10 19:52:33,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:33,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:33,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086674129] [2020-02-10 19:52:33,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:33,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:33,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:33,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:33,870 INFO L87 Difference]: Start difference. First operand 385 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:52:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:34,004 INFO L93 Difference]: Finished difference Result 590 states and 1743 transitions. [2020-02-10 19:52:34,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:34,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:34,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:34,006 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:52:34,006 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:52:34,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 19:52:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:52:34,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 382. [2020-02-10 19:52:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-02-10 19:52:34,015 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-02-10 19:52:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:34,015 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-02-10 19:52:34,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-02-10 19:52:34,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:34,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:34,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 19:52:34,016 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 19:52:34,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:34,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1094814972, now seen corresponding path program 1261 times [2020-02-10 19:52:34,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:34,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226236123] [2020-02-10 19:52:34,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:34,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 19:52:34,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226236123] [2020-02-10 19:52:34,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:34,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:34,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418586898] [2020-02-10 19:52:34,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:34,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:34,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:34,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:34,308 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:52:34,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:34,399 INFO L93 Difference]: Finished difference Result 632 states and 1830 transitions. [2020-02-10 19:52:34,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:34,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:34,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:34,401 INFO L225 Difference]: With dead ends: 632 [2020-02-10 19:52:34,401 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:52:34,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:52:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 396. [2020-02-10 19:52:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-02-10 19:52:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1343 transitions. [2020-02-10 19:52:34,411 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1343 transitions. Word has length 22 [2020-02-10 19:52:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:34,411 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 1343 transitions. [2020-02-10 19:52:34,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1343 transitions. [2020-02-10 19:52:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:34,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:34,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 19:52:34,412 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 19:52:34,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:34,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1224785418, now seen corresponding path program 1262 times [2020-02-10 19:52:34,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:34,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636017639] [2020-02-10 19:52:34,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:34,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 19:52:34,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636017639] [2020-02-10 19:52:34,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:34,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:34,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016032029] [2020-02-10 19:52:34,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:34,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:34,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:34,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:34,705 INFO L87 Difference]: Start difference. First operand 396 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:52:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:34,842 INFO L93 Difference]: Finished difference Result 630 states and 1820 transitions. [2020-02-10 19:52:34,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:34,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:34,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:34,844 INFO L225 Difference]: With dead ends: 630 [2020-02-10 19:52:34,845 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 19:52:34,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 19:52:34,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 388. [2020-02-10 19:52:34,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:52:34,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1324 transitions. [2020-02-10 19:52:34,855 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1324 transitions. Word has length 22 [2020-02-10 19:52:34,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:34,855 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1324 transitions. [2020-02-10 19:52:34,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:34,856 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1324 transitions. [2020-02-10 19:52:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:34,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:34,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 19:52:34,856 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 19:52:34,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1599714470, now seen corresponding path program 1263 times [2020-02-10 19:52:34,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:34,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037386212] [2020-02-10 19:52:34,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:35,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037386212] [2020-02-10 19:52:35,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:35,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:35,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538957859] [2020-02-10 19:52:35,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:35,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:35,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:35,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:35,160 INFO L87 Difference]: Start difference. First operand 388 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:52:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:35,247 INFO L93 Difference]: Finished difference Result 619 states and 1799 transitions. [2020-02-10 19:52:35,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:35,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:35,249 INFO L225 Difference]: With dead ends: 619 [2020-02-10 19:52:35,249 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 19:52:35,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 19:52:35,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 393. [2020-02-10 19:52:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:52:35,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1332 transitions. [2020-02-10 19:52:35,258 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1332 transitions. Word has length 22 [2020-02-10 19:52:35,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:35,258 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1332 transitions. [2020-02-10 19:52:35,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1332 transitions. [2020-02-10 19:52:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:35,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:35,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 19:52:35,259 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 19:52:35,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:35,259 INFO L82 PathProgramCache]: Analyzing trace with hash -673336168, now seen corresponding path program 1264 times [2020-02-10 19:52:35,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:35,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018987008] [2020-02-10 19:52:35,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:35,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018987008] [2020-02-10 19:52:35,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:35,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:35,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531725135] [2020-02-10 19:52:35,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:35,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:35,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:35,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:35,550 INFO L87 Difference]: Start difference. First operand 393 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:52:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:35,683 INFO L93 Difference]: Finished difference Result 606 states and 1779 transitions. [2020-02-10 19:52:35,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:35,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:35,684 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:52:35,684 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 19:52:35,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 19:52:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 388. [2020-02-10 19:52:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:52:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1319 transitions. [2020-02-10 19:52:35,697 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1319 transitions. Word has length 22 [2020-02-10 19:52:35,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:35,697 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1319 transitions. [2020-02-10 19:52:35,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:35,697 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1319 transitions. [2020-02-10 19:52:35,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:35,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:35,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 19:52:35,698 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 19:52:35,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2141390750, now seen corresponding path program 1265 times [2020-02-10 19:52:35,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:35,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5849810] [2020-02-10 19:52:35,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:35,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 19:52:35,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5849810] [2020-02-10 19:52:35,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:35,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:35,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909516607] [2020-02-10 19:52:35,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:35,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:35,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:35,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:35,974 INFO L87 Difference]: Start difference. First operand 388 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:52:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:36,088 INFO L93 Difference]: Finished difference Result 616 states and 1789 transitions. [2020-02-10 19:52:36,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:36,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:36,090 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:52:36,090 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:52:36,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 19:52:36,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:52:36,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 392. [2020-02-10 19:52:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-02-10 19:52:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1326 transitions. [2020-02-10 19:52:36,100 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1326 transitions. Word has length 22 [2020-02-10 19:52:36,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:36,100 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1326 transitions. [2020-02-10 19:52:36,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1326 transitions. [2020-02-10 19:52:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:36,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:36,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 19:52:36,100 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 19:52:36,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:36,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1282516220, now seen corresponding path program 1266 times [2020-02-10 19:52:36,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:36,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223679063] [2020-02-10 19:52:36,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:36,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 19:52:36,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223679063] [2020-02-10 19:52:36,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:36,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:36,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955403118] [2020-02-10 19:52:36,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:36,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:36,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:36,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:36,376 INFO L87 Difference]: Start difference. First operand 392 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:52:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:36,490 INFO L93 Difference]: Finished difference Result 605 states and 1773 transitions. [2020-02-10 19:52:36,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:36,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:36,492 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:52:36,492 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:52:36,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:52:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 382. [2020-02-10 19:52:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1307 transitions. [2020-02-10 19:52:36,502 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1307 transitions. Word has length 22 [2020-02-10 19:52:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:36,502 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1307 transitions. [2020-02-10 19:52:36,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1307 transitions. [2020-02-10 19:52:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:36,502 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:36,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 19:52:36,503 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 19:52:36,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:36,503 INFO L82 PathProgramCache]: Analyzing trace with hash 443042192, now seen corresponding path program 1267 times [2020-02-10 19:52:36,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:36,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477928664] [2020-02-10 19:52:36,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:36,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 19:52:36,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477928664] [2020-02-10 19:52:36,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:36,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:36,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126373839] [2020-02-10 19:52:36,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:36,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:36,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:36,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:36,787 INFO L87 Difference]: Start difference. First operand 382 states and 1307 transitions. Second operand 9 states. [2020-02-10 19:52:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:36,877 INFO L93 Difference]: Finished difference Result 595 states and 1742 transitions. [2020-02-10 19:52:36,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:36,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:36,879 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:52:36,879 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:52:36,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 19:52:36,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:52:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 384. [2020-02-10 19:52:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1311 transitions. [2020-02-10 19:52:36,889 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1311 transitions. Word has length 22 [2020-02-10 19:52:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:36,889 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1311 transitions. [2020-02-10 19:52:36,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1311 transitions. [2020-02-10 19:52:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:36,890 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:36,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 19:52:36,890 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 19:52:36,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:36,890 INFO L82 PathProgramCache]: Analyzing trace with hash -632668964, now seen corresponding path program 1268 times [2020-02-10 19:52:36,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:36,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988782326] [2020-02-10 19:52:36,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:37,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988782326] [2020-02-10 19:52:37,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:37,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:37,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56388636] [2020-02-10 19:52:37,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:37,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:37,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:37,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:37,159 INFO L87 Difference]: Start difference. First operand 384 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:52:37,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:37,274 INFO L93 Difference]: Finished difference Result 600 states and 1751 transitions. [2020-02-10 19:52:37,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:37,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:37,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:37,275 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:52:37,276 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:52:37,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 19:52:37,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:52:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 383. [2020-02-10 19:52:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1309 transitions. [2020-02-10 19:52:37,284 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1309 transitions. Word has length 22 [2020-02-10 19:52:37,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:37,285 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1309 transitions. [2020-02-10 19:52:37,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:37,285 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1309 transitions. [2020-02-10 19:52:37,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:37,285 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:37,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 19:52:37,285 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 19:52:37,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:37,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1157395662, now seen corresponding path program 1269 times [2020-02-10 19:52:37,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:37,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499522306] [2020-02-10 19:52:37,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:37,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 19:52:37,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499522306] [2020-02-10 19:52:37,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:37,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:37,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883630406] [2020-02-10 19:52:37,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:37,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:37,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:37,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:37,560 INFO L87 Difference]: Start difference. First operand 383 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:52:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:37,654 INFO L93 Difference]: Finished difference Result 592 states and 1736 transitions. [2020-02-10 19:52:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:37,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:37,656 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:52:37,656 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:52:37,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 19:52:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:52:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 384. [2020-02-10 19:52:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1310 transitions. [2020-02-10 19:52:37,666 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1310 transitions. Word has length 22 [2020-02-10 19:52:37,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:37,666 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1310 transitions. [2020-02-10 19:52:37,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1310 transitions. [2020-02-10 19:52:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:37,666 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:37,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 19:52:37,667 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 19:52:37,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:37,667 INFO L82 PathProgramCache]: Analyzing trace with hash -622165860, now seen corresponding path program 1270 times [2020-02-10 19:52:37,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:37,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076496200] [2020-02-10 19:52:37,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:37,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076496200] [2020-02-10 19:52:37,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:37,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:37,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813200321] [2020-02-10 19:52:37,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:37,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:37,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:37,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:37,941 INFO L87 Difference]: Start difference. First operand 384 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:52:38,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:38,057 INFO L93 Difference]: Finished difference Result 586 states and 1733 transitions. [2020-02-10 19:52:38,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:38,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:38,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:38,059 INFO L225 Difference]: With dead ends: 586 [2020-02-10 19:52:38,059 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 19:52:38,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 19:52:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 19:52:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 383. [2020-02-10 19:52:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1308 transitions. [2020-02-10 19:52:38,071 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1308 transitions. Word has length 22 [2020-02-10 19:52:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:38,071 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1308 transitions. [2020-02-10 19:52:38,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:38,071 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1308 transitions. [2020-02-10 19:52:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:38,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52: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 19:52:38,072 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 19:52:38,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:38,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1220414286, now seen corresponding path program 1271 times [2020-02-10 19:52:38,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:38,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381199714] [2020-02-10 19:52:38,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:38,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 19:52:38,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381199714] [2020-02-10 19:52:38,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:38,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:38,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31775886] [2020-02-10 19:52:38,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:38,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:38,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:38,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:38,356 INFO L87 Difference]: Start difference. First operand 383 states and 1308 transitions. Second operand 9 states. [2020-02-10 19:52:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:38,469 INFO L93 Difference]: Finished difference Result 600 states and 1754 transitions. [2020-02-10 19:52:38,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:38,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:38,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:38,471 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:52:38,472 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:52: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 19:52:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:52:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 387. [2020-02-10 19:52:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:52:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1315 transitions. [2020-02-10 19:52:38,482 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1315 transitions. Word has length 22 [2020-02-10 19:52:38,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:38,482 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1315 transitions. [2020-02-10 19:52:38,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1315 transitions. [2020-02-10 19:52:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:38,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:38,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 19:52:38,483 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 19:52:38,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:38,483 INFO L82 PathProgramCache]: Analyzing trace with hash 390526672, now seen corresponding path program 1272 times [2020-02-10 19:52:38,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:38,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793560187] [2020-02-10 19:52:38,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:38,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 19:52:38,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793560187] [2020-02-10 19:52:38,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:38,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:38,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369946172] [2020-02-10 19:52:38,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:38,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:38,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:38,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:38,753 INFO L87 Difference]: Start difference. First operand 387 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:52:38,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:38,894 INFO L93 Difference]: Finished difference Result 589 states and 1738 transitions. [2020-02-10 19:52:38,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:38,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:38,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:38,896 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:52:38,896 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 19:52:38,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 19:52:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 19:52:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 379. [2020-02-10 19:52:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:52:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-02-10 19:52:38,904 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-02-10 19:52:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:38,905 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-02-10 19:52:38,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:38,905 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-02-10 19:52:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:38,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:38,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:38,905 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 19:52:38,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:38,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1164161208, now seen corresponding path program 1273 times [2020-02-10 19:52:38,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:38,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277543741] [2020-02-10 19:52:38,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:39,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 19:52:39,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277543741] [2020-02-10 19:52:39,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:39,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:39,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733136152] [2020-02-10 19:52:39,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:39,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:39,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:39,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:39,164 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:52:39,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:39,270 INFO L93 Difference]: Finished difference Result 630 states and 1831 transitions. [2020-02-10 19:52:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:39,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:39,272 INFO L225 Difference]: With dead ends: 630 [2020-02-10 19:52:39,272 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 19:52:39,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:39,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 19:52:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 390. [2020-02-10 19:52:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-02-10 19:52:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1333 transitions. [2020-02-10 19:52:39,282 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1333 transitions. Word has length 22 [2020-02-10 19:52:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:39,282 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1333 transitions. [2020-02-10 19:52:39,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1333 transitions. [2020-02-10 19:52:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:39,282 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:39,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:39,283 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 19:52:39,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:39,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2126364870, now seen corresponding path program 1274 times [2020-02-10 19:52:39,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:39,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122135811] [2020-02-10 19:52:39,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:39,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 19:52:39,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122135811] [2020-02-10 19:52:39,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:39,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:39,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446033271] [2020-02-10 19:52:39,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:39,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:39,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:39,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:39,546 INFO L87 Difference]: Start difference. First operand 390 states and 1333 transitions. Second operand 9 states. [2020-02-10 19:52:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:39,659 INFO L93 Difference]: Finished difference Result 624 states and 1817 transitions. [2020-02-10 19:52:39,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:39,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:39,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:39,661 INFO L225 Difference]: With dead ends: 624 [2020-02-10 19:52:39,662 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 19:52:39,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 19:52:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 19:52:39,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 387. [2020-02-10 19:52:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:52:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1326 transitions. [2020-02-10 19:52:39,671 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1326 transitions. Word has length 22 [2020-02-10 19:52:39,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:39,671 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1326 transitions. [2020-02-10 19:52:39,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1326 transitions. [2020-02-10 19:52:39,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:39,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:39,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 19:52:39,672 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 19:52:39,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:39,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1448969178, now seen corresponding path program 1275 times [2020-02-10 19:52:39,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:39,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407025997] [2020-02-10 19:52:39,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:39,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 19:52:39,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407025997] [2020-02-10 19:52:39,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:39,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:39,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49728032] [2020-02-10 19:52:39,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:39,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:39,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:39,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:39,965 INFO L87 Difference]: Start difference. First operand 387 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:52:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:40,058 INFO L93 Difference]: Finished difference Result 639 states and 1849 transitions. [2020-02-10 19:52:40,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:40,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:40,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:40,060 INFO L225 Difference]: With dead ends: 639 [2020-02-10 19:52:40,060 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 19:52:40,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 19:52:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 395. [2020-02-10 19:52:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-02-10 19:52:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1339 transitions. [2020-02-10 19:52:40,069 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1339 transitions. Word has length 22 [2020-02-10 19:52:40,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:40,069 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1339 transitions. [2020-02-10 19:52:40,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1339 transitions. [2020-02-10 19:52:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:40,070 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:40,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 19:52:40,070 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 19:52:40,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:40,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1318998732, now seen corresponding path program 1276 times [2020-02-10 19:52:40,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:40,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691518867] [2020-02-10 19:52:40,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:40,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691518867] [2020-02-10 19:52:40,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:40,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:40,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356191262] [2020-02-10 19:52:40,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:40,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:40,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:40,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:40,346 INFO L87 Difference]: Start difference. First operand 395 states and 1339 transitions. Second operand 9 states. [2020-02-10 19:52:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:40,461 INFO L93 Difference]: Finished difference Result 637 states and 1839 transitions. [2020-02-10 19:52:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:40,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:40,463 INFO L225 Difference]: With dead ends: 637 [2020-02-10 19:52:40,463 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 19:52:40,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:40,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 19:52:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 387. [2020-02-10 19:52:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:52:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1322 transitions. [2020-02-10 19:52:40,473 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1322 transitions. Word has length 22 [2020-02-10 19:52:40,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:40,473 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1322 transitions. [2020-02-10 19:52:40,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1322 transitions. [2020-02-10 19:52:40,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:40,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:40,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:40,474 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 19:52:40,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:40,474 INFO L82 PathProgramCache]: Analyzing trace with hash 554607190, now seen corresponding path program 1277 times [2020-02-10 19:52:40,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:40,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841563879] [2020-02-10 19:52:40,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:40,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 19:52:40,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841563879] [2020-02-10 19:52:40,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:40,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:40,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461930123] [2020-02-10 19:52:40,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:40,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:40,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:40,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:40,737 INFO L87 Difference]: Start difference. First operand 387 states and 1322 transitions. Second operand 9 states. [2020-02-10 19:52:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:40,852 INFO L93 Difference]: Finished difference Result 621 states and 1808 transitions. [2020-02-10 19:52:40,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:40,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:40,854 INFO L225 Difference]: With dead ends: 621 [2020-02-10 19:52:40,855 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 19:52:40,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 19:52:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 19:52:40,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 389. [2020-02-10 19:52:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:52:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1325 transitions. [2020-02-10 19:52:40,864 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1325 transitions. Word has length 22 [2020-02-10 19:52:40,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:40,864 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1325 transitions. [2020-02-10 19:52:40,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:40,865 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1325 transitions. [2020-02-10 19:52:40,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:40,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:40,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 19:52:40,865 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 19:52:40,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:40,865 INFO L82 PathProgramCache]: Analyzing trace with hash -363343000, now seen corresponding path program 1278 times [2020-02-10 19:52:40,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:40,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72831873] [2020-02-10 19:52:40,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:41,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 19:52:41,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72831873] [2020-02-10 19:52:41,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:41,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:41,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303630448] [2020-02-10 19:52:41,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:41,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:41,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:41,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:41,125 INFO L87 Difference]: Start difference. First operand 389 states and 1325 transitions. Second operand 9 states. [2020-02-10 19:52:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:41,241 INFO L93 Difference]: Finished difference Result 625 states and 1814 transitions. [2020-02-10 19:52:41,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:41,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:41,243 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:52:41,243 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 19:52:41,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 19:52:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 383. [2020-02-10 19:52:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-02-10 19:52:41,253 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-02-10 19:52:41,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:41,253 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-02-10 19:52:41,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:41,253 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-02-10 19:52:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:41,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:41,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 19:52:41,254 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 19:52:41,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:41,254 INFO L82 PathProgramCache]: Analyzing trace with hash 761872870, now seen corresponding path program 1279 times [2020-02-10 19:52:41,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:41,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115721925] [2020-02-10 19:52:41,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:41,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 19:52:41,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115721925] [2020-02-10 19:52:41,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:41,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:41,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266213680] [2020-02-10 19:52:41,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:41,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:41,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:41,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:41,533 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:52:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:41,625 INFO L93 Difference]: Finished difference Result 621 states and 1807 transitions. [2020-02-10 19:52:41,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:41,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:41,627 INFO L225 Difference]: With dead ends: 621 [2020-02-10 19:52:41,627 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 19:52:41,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 19:52:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 19:52:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 389. [2020-02-10 19:52:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:52:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1327 transitions. [2020-02-10 19:52:41,638 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1327 transitions. Word has length 22 [2020-02-10 19:52:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:41,638 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1327 transitions. [2020-02-10 19:52:41,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1327 transitions. [2020-02-10 19:52:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:41,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:41,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 19:52:41,639 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 19:52:41,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:41,639 INFO L82 PathProgramCache]: Analyzing trace with hash -200330792, now seen corresponding path program 1280 times [2020-02-10 19:52:41,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:41,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952406307] [2020-02-10 19:52:41,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:41,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 19:52:41,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952406307] [2020-02-10 19:52:41,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:41,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:41,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761612604] [2020-02-10 19:52:41,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:41,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:41,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:41,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:41,901 INFO L87 Difference]: Start difference. First operand 389 states and 1327 transitions. Second operand 9 states. [2020-02-10 19:52:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:42,021 INFO L93 Difference]: Finished difference Result 615 states and 1793 transitions. [2020-02-10 19:52:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:42,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:42,022 INFO L225 Difference]: With dead ends: 615 [2020-02-10 19:52:42,023 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:52:42,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 19:52:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:52:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-02-10 19:52:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1320 transitions. [2020-02-10 19:52:42,033 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1320 transitions. Word has length 22 [2020-02-10 19:52:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:42,033 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1320 transitions. [2020-02-10 19:52:42,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1320 transitions. [2020-02-10 19:52:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:42,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:42,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 19:52:42,034 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 19:52:42,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:42,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1774565402, now seen corresponding path program 1281 times [2020-02-10 19:52:42,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:42,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730992709] [2020-02-10 19:52:42,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:42,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 19:52:42,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730992709] [2020-02-10 19:52:42,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:42,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:42,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411922457] [2020-02-10 19:52:42,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:42,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:42,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:42,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:42,308 INFO L87 Difference]: Start difference. First operand 386 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:52:42,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:42,415 INFO L93 Difference]: Finished difference Result 617 states and 1800 transitions. [2020-02-10 19:52:42,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:42,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:42,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:42,417 INFO L225 Difference]: With dead ends: 617 [2020-02-10 19:52:42,417 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 19:52:42,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 19:52:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 391. [2020-02-10 19:52:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-02-10 19:52:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1328 transitions. [2020-02-10 19:52:42,427 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1328 transitions. Word has length 22 [2020-02-10 19:52:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:42,427 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 1328 transitions. [2020-02-10 19:52:42,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1328 transitions. [2020-02-10 19:52:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:42,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:42,428 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:42,428 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 19:52:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash -498485236, now seen corresponding path program 1282 times [2020-02-10 19:52:42,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:42,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830022571] [2020-02-10 19:52:42,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:42,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 19:52:42,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830022571] [2020-02-10 19:52:42,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:42,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:42,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036854449] [2020-02-10 19:52:42,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:42,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:42,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:42,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:42,707 INFO L87 Difference]: Start difference. First operand 391 states and 1328 transitions. Second operand 9 states. [2020-02-10 19:52:42,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:42,842 INFO L93 Difference]: Finished difference Result 604 states and 1780 transitions. [2020-02-10 19:52:42,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:42,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:42,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:42,844 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:52:42,844 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:52:42,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 19:52:42,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:52:42,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 386. [2020-02-10 19:52:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1317 transitions. [2020-02-10 19:52:42,854 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1317 transitions. Word has length 22 [2020-02-10 19:52:42,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:42,854 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1317 transitions. [2020-02-10 19:52:42,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1317 transitions. [2020-02-10 19:52:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:42,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:42,855 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:42,855 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 19:52:42,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:42,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1803822924, now seen corresponding path program 1283 times [2020-02-10 19:52:42,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:42,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664430989] [2020-02-10 19:52:42,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:43,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664430989] [2020-02-10 19:52:43,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:43,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:43,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891383910] [2020-02-10 19:52:43,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:43,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:43,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:43,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:43,127 INFO L87 Difference]: Start difference. First operand 386 states and 1317 transitions. Second operand 9 states. [2020-02-10 19:52:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:43,239 INFO L93 Difference]: Finished difference Result 608 states and 1778 transitions. [2020-02-10 19:52:43,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:43,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:43,241 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:52:43,241 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:52:43,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 19:52:43,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:52:43,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 388. [2020-02-10 19:52:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-02-10 19:52:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1320 transitions. [2020-02-10 19:52:43,252 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1320 transitions. Word has length 22 [2020-02-10 19:52:43,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:43,252 INFO L479 AbstractCegarLoop]: Abstraction has 388 states and 1320 transitions. [2020-02-10 19:52:43,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1320 transitions. [2020-02-10 19:52:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:43,252 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:43,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 19:52:43,253 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 19:52:43,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:43,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1977070616, now seen corresponding path program 1284 times [2020-02-10 19:52:43,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:43,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097644839] [2020-02-10 19:52:43,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:43,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 19:52:43,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097644839] [2020-02-10 19:52:43,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:43,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:43,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824372291] [2020-02-10 19:52:43,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:43,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:43,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:43,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:43,515 INFO L87 Difference]: Start difference. First operand 388 states and 1320 transitions. Second operand 9 states. [2020-02-10 19:52:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:43,644 INFO L93 Difference]: Finished difference Result 601 states and 1772 transitions. [2020-02-10 19:52:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:43,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:43,646 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:52:43,646 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:52:43,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:52:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 383. [2020-02-10 19:52:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1310 transitions. [2020-02-10 19:52:43,656 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1310 transitions. Word has length 22 [2020-02-10 19:52:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:43,657 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1310 transitions. [2020-02-10 19:52:43,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1310 transitions. [2020-02-10 19:52:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:43,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:43,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 19:52:43,657 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 19:52:43,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1517300698, now seen corresponding path program 1285 times [2020-02-10 19:52:43,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:43,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771993623] [2020-02-10 19:52:43,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:43,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 19:52:43,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771993623] [2020-02-10 19:52:43,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:43,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:43,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837235032] [2020-02-10 19:52:43,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:43,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:43,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:43,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:43,944 INFO L87 Difference]: Start difference. First operand 383 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:52:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:44,059 INFO L93 Difference]: Finished difference Result 639 states and 1849 transitions. [2020-02-10 19:52:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:44,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:44,061 INFO L225 Difference]: With dead ends: 639 [2020-02-10 19:52:44,062 INFO L226 Difference]: Without dead ends: 623 [2020-02-10 19:52:44,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-02-10 19:52:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 397. [2020-02-10 19:52:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-02-10 19:52:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1343 transitions. [2020-02-10 19:52:44,072 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1343 transitions. Word has length 22 [2020-02-10 19:52:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:44,072 INFO L479 AbstractCegarLoop]: Abstraction has 397 states and 1343 transitions. [2020-02-10 19:52:44,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1343 transitions. [2020-02-10 19:52:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:44,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:44,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 19:52:44,073 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 19:52:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1647271144, now seen corresponding path program 1286 times [2020-02-10 19:52:44,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:44,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509852206] [2020-02-10 19:52:44,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:44,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 19:52:44,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509852206] [2020-02-10 19:52:44,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:44,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:44,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365281263] [2020-02-10 19:52:44,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:44,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:44,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:44,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:44,355 INFO L87 Difference]: Start difference. First operand 397 states and 1343 transitions. Second operand 9 states. [2020-02-10 19:52:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:44,466 INFO L93 Difference]: Finished difference Result 637 states and 1839 transitions. [2020-02-10 19:52:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:44,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:44,468 INFO L225 Difference]: With dead ends: 637 [2020-02-10 19:52:44,468 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 19:52:44,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 19:52:44,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 389. [2020-02-10 19:52:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:52:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1324 transitions. [2020-02-10 19:52:44,478 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1324 transitions. Word has length 22 [2020-02-10 19:52:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:44,478 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1324 transitions. [2020-02-10 19:52:44,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1324 transitions. [2020-02-10 19:52:44,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:44,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:44,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 19:52:44,479 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 19:52:44,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:44,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1177228744, now seen corresponding path program 1287 times [2020-02-10 19:52:44,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:44,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691071582] [2020-02-10 19:52:44,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:44,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 19:52:44,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691071582] [2020-02-10 19:52:44,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:44,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:44,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120234616] [2020-02-10 19:52:44,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:44,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:44,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:44,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:44,769 INFO L87 Difference]: Start difference. First operand 389 states and 1324 transitions. Second operand 9 states. [2020-02-10 19:52:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:44,868 INFO L93 Difference]: Finished difference Result 626 states and 1818 transitions. [2020-02-10 19:52:44,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:44,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:44,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:44,870 INFO L225 Difference]: With dead ends: 626 [2020-02-10 19:52:44,870 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:52:44,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 19:52:44,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:52:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 394. [2020-02-10 19:52:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-02-10 19:52:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1332 transitions. [2020-02-10 19:52:44,881 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1332 transitions. Word has length 22 [2020-02-10 19:52:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:44,881 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1332 transitions. [2020-02-10 19:52:44,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1332 transitions. [2020-02-10 19:52:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:44,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:44,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 19:52:44,882 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 19:52:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1095821894, now seen corresponding path program 1288 times [2020-02-10 19:52:44,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:44,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323738384] [2020-02-10 19:52:44,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:45,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 19:52:45,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323738384] [2020-02-10 19:52:45,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:45,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:45,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250127468] [2020-02-10 19:52:45,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:45,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:45,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:45,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:45,160 INFO L87 Difference]: Start difference. First operand 394 states and 1332 transitions. Second operand 9 states. [2020-02-10 19:52:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:45,276 INFO L93 Difference]: Finished difference Result 613 states and 1798 transitions. [2020-02-10 19:52:45,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:45,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:45,278 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:52:45,278 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:52:45,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 19:52:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:52:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 389. [2020-02-10 19:52:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:52:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1319 transitions. [2020-02-10 19:52:45,287 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1319 transitions. Word has length 22 [2020-02-10 19:52:45,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:45,288 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1319 transitions. [2020-02-10 19:52:45,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:45,288 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1319 transitions. [2020-02-10 19:52:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:45,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:45,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 19:52:45,288 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 19:52:45,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:45,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1731090820, now seen corresponding path program 1289 times [2020-02-10 19:52:45,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:45,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233763346] [2020-02-10 19:52:45,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:45,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 19:52:45,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233763346] [2020-02-10 19:52:45,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:45,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:45,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414697256] [2020-02-10 19:52:45,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:45,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:45,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:45,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:45,556 INFO L87 Difference]: Start difference. First operand 389 states and 1319 transitions. Second operand 9 states. [2020-02-10 19:52:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:45,696 INFO L93 Difference]: Finished difference Result 623 states and 1808 transitions. [2020-02-10 19:52:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:45,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:45,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:45,698 INFO L225 Difference]: With dead ends: 623 [2020-02-10 19:52:45,698 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 19:52:45,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:45,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 19:52:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 393. [2020-02-10 19:52:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-02-10 19:52:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1326 transitions. [2020-02-10 19:52:45,708 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1326 transitions. Word has length 22 [2020-02-10 19:52:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:45,708 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 1326 transitions. [2020-02-10 19:52:45,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1326 transitions. [2020-02-10 19:52:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:45,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:45,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 19:52:45,709 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 19:52:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:45,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1705001946, now seen corresponding path program 1290 times [2020-02-10 19:52:45,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:45,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623308081] [2020-02-10 19:52:45,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:45,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 19:52:45,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623308081] [2020-02-10 19:52:45,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:45,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:45,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136900687] [2020-02-10 19:52:45,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:45,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:45,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:45,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:45,982 INFO L87 Difference]: Start difference. First operand 393 states and 1326 transitions. Second operand 9 states. [2020-02-10 19:52:46,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:46,102 INFO L93 Difference]: Finished difference Result 612 states and 1792 transitions. [2020-02-10 19:52:46,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:46,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:46,104 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:52:46,105 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:52:46,105 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:46,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:52:46,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 383. [2020-02-10 19:52:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1306 transitions. [2020-02-10 19:52:46,115 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1306 transitions. Word has length 22 [2020-02-10 19:52:46,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:46,115 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1306 transitions. [2020-02-10 19:52:46,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1306 transitions. [2020-02-10 19:52:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:46,116 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:46,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 19:52:46,116 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 19:52:46,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:46,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1909008646, now seen corresponding path program 1291 times [2020-02-10 19:52:46,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:46,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889327055] [2020-02-10 19:52:46,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:46,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 19:52:46,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889327055] [2020-02-10 19:52:46,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:46,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:46,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744470370] [2020-02-10 19:52:46,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:46,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:46,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:46,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:46,359 INFO L87 Difference]: Start difference. First operand 383 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:52:46,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:46,477 INFO L93 Difference]: Finished difference Result 608 states and 1776 transitions. [2020-02-10 19:52:46,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:46,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:46,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:46,479 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:52:46,479 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:52:46,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 19:52:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:52:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 387. [2020-02-10 19:52:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:52:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1316 transitions. [2020-02-10 19:52:46,489 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1316 transitions. Word has length 22 [2020-02-10 19:52:46,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:46,489 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1316 transitions. [2020-02-10 19:52:46,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1316 transitions. [2020-02-10 19:52:46,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:46,490 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:46,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 19:52:46,490 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 19:52:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:46,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1468008460, now seen corresponding path program 1292 times [2020-02-10 19:52:46,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:46,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25234527] [2020-02-10 19:52:46,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:46,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25234527] [2020-02-10 19:52:46,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:46,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:46,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481800055] [2020-02-10 19:52:46,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:46,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:46,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:46,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:46,741 INFO L87 Difference]: Start difference. First operand 387 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:52:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:46,862 INFO L93 Difference]: Finished difference Result 612 states and 1782 transitions. [2020-02-10 19:52:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:46,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:46,864 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:52:46,864 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:52:46,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 19:52:46,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:52:46,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 385. [2020-02-10 19:52:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:52:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1311 transitions. [2020-02-10 19:52:46,875 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1311 transitions. Word has length 22 [2020-02-10 19:52:46,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:46,875 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1311 transitions. [2020-02-10 19:52:46,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1311 transitions. [2020-02-10 19:52:46,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:46,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:46,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 19:52:46,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 19:52:46,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:46,876 INFO L82 PathProgramCache]: Analyzing trace with hash -298067688, now seen corresponding path program 1293 times [2020-02-10 19:52:46,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:46,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133125368] [2020-02-10 19:52:46,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:47,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:47,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133125368] [2020-02-10 19:52:47,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:47,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:47,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457208248] [2020-02-10 19:52:47,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:47,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:47,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:47,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:47,127 INFO L87 Difference]: Start difference. First operand 385 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:52:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:47,241 INFO L93 Difference]: Finished difference Result 604 states and 1767 transitions. [2020-02-10 19:52:47,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:47,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:47,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:47,243 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:52:47,243 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:52:47,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 19:52:47,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:52:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 387. [2020-02-10 19:52:47,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-02-10 19:52:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1314 transitions. [2020-02-10 19:52:47,253 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1314 transitions. Word has length 22 [2020-02-10 19:52:47,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:47,254 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 1314 transitions. [2020-02-10 19:52:47,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1314 transitions. [2020-02-10 19:52:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:47,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:47,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 19:52:47,255 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 19:52:47,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:47,255 INFO L82 PathProgramCache]: Analyzing trace with hash -471315380, now seen corresponding path program 1294 times [2020-02-10 19:52:47,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:47,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121701988] [2020-02-10 19:52:47,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:47,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121701988] [2020-02-10 19:52:47,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:47,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:47,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731900402] [2020-02-10 19:52:47,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:47,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:47,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:47,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:47,507 INFO L87 Difference]: Start difference. First operand 387 states and 1314 transitions. Second operand 9 states. [2020-02-10 19:52:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:47,629 INFO L93 Difference]: Finished difference Result 597 states and 1761 transitions. [2020-02-10 19:52:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:47,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:47,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:47,630 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:52:47,631 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:52:47,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 19:52:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:52:47,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 385. [2020-02-10 19:52:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:52:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1309 transitions. [2020-02-10 19:52:47,641 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1309 transitions. Word has length 22 [2020-02-10 19:52:47,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:47,641 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1309 transitions. [2020-02-10 19:52:47,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:47,641 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1309 transitions. [2020-02-10 19:52:47,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:47,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:47,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 19:52:47,642 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 19:52:47,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:47,642 INFO L82 PathProgramCache]: Analyzing trace with hash 392297304, now seen corresponding path program 1295 times [2020-02-10 19:52:47,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:47,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702222786] [2020-02-10 19:52:47,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:47,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 19:52:47,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702222786] [2020-02-10 19:52:47,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:47,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:47,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183648972] [2020-02-10 19:52:47,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:47,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:47,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:47,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:47,885 INFO L87 Difference]: Start difference. First operand 385 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:52:48,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:48,002 INFO L93 Difference]: Finished difference Result 610 states and 1779 transitions. [2020-02-10 19:52:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:48,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:48,003 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:52:48,003 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:52:48,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 19:52:48,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:52:48,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 389. [2020-02-10 19:52:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-02-10 19:52:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1316 transitions. [2020-02-10 19:52:48,013 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1316 transitions. Word has length 22 [2020-02-10 19:52:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:48,013 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1316 transitions. [2020-02-10 19:52:48,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1316 transitions. [2020-02-10 19:52:48,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:48,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:48,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 19:52:48,014 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 19:52:48,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:48,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1136999802, now seen corresponding path program 1296 times [2020-02-10 19:52:48,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:48,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291997582] [2020-02-10 19:52:48,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:48,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 19:52:48,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291997582] [2020-02-10 19:52:48,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:48,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:48,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971933021] [2020-02-10 19:52:48,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:48,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:48,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:48,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:48,266 INFO L87 Difference]: Start difference. First operand 389 states and 1316 transitions. Second operand 9 states. [2020-02-10 19:52:48,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:48,401 INFO L93 Difference]: Finished difference Result 599 states and 1763 transitions. [2020-02-10 19:52:48,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:48,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:48,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:48,403 INFO L225 Difference]: With dead ends: 599 [2020-02-10 19:52:48,403 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:52:48,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 19:52:48,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:52:48,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-02-10 19:52:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:52:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-02-10 19:52:48,413 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-02-10 19:52:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:48,413 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-02-10 19:52:48,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-02-10 19:52:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:48,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:48,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 19:52:48,414 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 19:52:48,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:48,414 INFO L82 PathProgramCache]: Analyzing trace with hash -893761222, now seen corresponding path program 1297 times [2020-02-10 19:52:48,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:48,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973913369] [2020-02-10 19:52:48,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:48,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 19:52:48,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973913369] [2020-02-10 19:52:48,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:48,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:48,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589655469] [2020-02-10 19:52:48,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:48,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:48,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:48,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:48,700 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:52:48,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:48,795 INFO L93 Difference]: Finished difference Result 565 states and 1669 transitions. [2020-02-10 19:52:48,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:48,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:48,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:48,797 INFO L225 Difference]: With dead ends: 565 [2020-02-10 19:52:48,797 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:52:48,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 19:52:48,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:52:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 382. [2020-02-10 19:52:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-02-10 19:52:48,807 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-02-10 19:52:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:48,807 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-02-10 19:52:48,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-02-10 19:52:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:48,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:48,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 19:52:48,808 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 19:52:48,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:48,808 INFO L82 PathProgramCache]: Analyzing trace with hash 717179736, now seen corresponding path program 1298 times [2020-02-10 19:52:48,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:48,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27713788] [2020-02-10 19:52:48,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:49,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 19:52:49,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27713788] [2020-02-10 19:52:49,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:49,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:49,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968936704] [2020-02-10 19:52:49,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:49,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:49,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:49,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:49,085 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:52:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:49,200 INFO L93 Difference]: Finished difference Result 566 states and 1670 transitions. [2020-02-10 19:52:49,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:49,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:49,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:49,202 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:52:49,202 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 19:52:49,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 19:52:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 19:52:49,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 381. [2020-02-10 19:52:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:52:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1304 transitions. [2020-02-10 19:52:49,211 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1304 transitions. Word has length 22 [2020-02-10 19:52:49,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:49,211 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1304 transitions. [2020-02-10 19:52:49,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1304 transitions. [2020-02-10 19:52:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:49,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:49,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 19:52:49,212 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 19:52:49,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1719369164, now seen corresponding path program 1299 times [2020-02-10 19:52:49,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:49,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521375130] [2020-02-10 19:52:49,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:49,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 19:52:49,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521375130] [2020-02-10 19:52:49,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:49,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:49,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059462199] [2020-02-10 19:52:49,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:49,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:49,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:49,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:49,486 INFO L87 Difference]: Start difference. First operand 381 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:52:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:49,566 INFO L93 Difference]: Finished difference Result 569 states and 1676 transitions. [2020-02-10 19:52:49,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:49,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:49,568 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:52:49,568 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:52:49,568 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:49,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:52:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-02-10 19:52:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1305 transitions. [2020-02-10 19:52:49,577 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1305 transitions. Word has length 22 [2020-02-10 19:52:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:49,577 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1305 transitions. [2020-02-10 19:52:49,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1305 transitions. [2020-02-10 19:52:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:49,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:49,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 19:52:49,578 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 19:52:49,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:49,578 INFO L82 PathProgramCache]: Analyzing trace with hash 643658008, now seen corresponding path program 1300 times [2020-02-10 19:52:49,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:49,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727504652] [2020-02-10 19:52:49,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:49,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 19:52:49,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727504652] [2020-02-10 19:52:49,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:49,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:49,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529727763] [2020-02-10 19:52:49,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:49,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:49,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:49,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:49,837 INFO L87 Difference]: Start difference. First operand 382 states and 1305 transitions. Second operand 9 states. [2020-02-10 19:52:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:49,949 INFO L93 Difference]: Finished difference Result 574 states and 1685 transitions. [2020-02-10 19:52:49,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:49,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:49,951 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:52:49,951 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:52:49,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 19:52:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:52:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 381. [2020-02-10 19:52:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:52:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1303 transitions. [2020-02-10 19:52:49,961 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1303 transitions. Word has length 22 [2020-02-10 19:52:49,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:49,961 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1303 transitions. [2020-02-10 19:52:49,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1303 transitions. [2020-02-10 19:52:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:49,962 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:49,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 19:52:49,962 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 19:52:49,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:49,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1729872268, now seen corresponding path program 1301 times [2020-02-10 19:52:49,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:49,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005915589] [2020-02-10 19:52:49,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:50,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 19:52:50,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005915589] [2020-02-10 19:52:50,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:50,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:50,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403371037] [2020-02-10 19:52:50,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:50,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:50,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:50,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:50,240 INFO L87 Difference]: Start difference. First operand 381 states and 1303 transitions. Second operand 9 states. [2020-02-10 19:52:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:50,352 INFO L93 Difference]: Finished difference Result 572 states and 1682 transitions. [2020-02-10 19:52:50,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:50,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:50,354 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:52:50,355 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:52:50,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 19:52:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:52:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 383. [2020-02-10 19:52:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1306 transitions. [2020-02-10 19:52:50,364 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1306 transitions. Word has length 22 [2020-02-10 19:52:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:50,364 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1306 transitions. [2020-02-10 19:52:50,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1306 transitions. [2020-02-10 19:52:50,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:50,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:50,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 19:52:50,365 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 19:52:50,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:50,365 INFO L82 PathProgramCache]: Analyzing trace with hash -956779846, now seen corresponding path program 1302 times [2020-02-10 19:52:50,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:50,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441857474] [2020-02-10 19:52:50,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:50,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 19:52:50,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441857474] [2020-02-10 19:52:50,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:50,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:50,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552454627] [2020-02-10 19:52:50,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:50,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:50,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:50,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:50,624 INFO L87 Difference]: Start difference. First operand 383 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:52:50,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:50,736 INFO L93 Difference]: Finished difference Result 576 states and 1688 transitions. [2020-02-10 19:52:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:50,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:50,738 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:52:50,738 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:52:50,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 19:52:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:52:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 380. [2020-02-10 19:52:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:52:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-02-10 19:52:50,748 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-02-10 19:52:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:50,748 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-02-10 19:52:50,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-02-10 19:52:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:50,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:50,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 19:52:50,749 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 19:52:50,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:50,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1032272856, now seen corresponding path program 1303 times [2020-02-10 19:52:50,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:50,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821880156] [2020-02-10 19:52:50,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:51,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 19:52:51,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821880156] [2020-02-10 19:52:51,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:51,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:51,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76617475] [2020-02-10 19:52:51,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:51,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:51,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:51,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:51,040 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:52:51,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:51,129 INFO L93 Difference]: Finished difference Result 562 states and 1662 transitions. [2020-02-10 19:52:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:51,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:51,131 INFO L225 Difference]: With dead ends: 562 [2020-02-10 19:52:51,131 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:52:51,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:51,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:52:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 382. [2020-02-10 19:52:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1305 transitions. [2020-02-10 19:52:51,140 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1305 transitions. Word has length 22 [2020-02-10 19:52:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:51,140 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1305 transitions. [2020-02-10 19:52:51,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1305 transitions. [2020-02-10 19:52:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:51,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:51,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 19:52:51,141 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 19:52:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1651753482, now seen corresponding path program 1304 times [2020-02-10 19:52:51,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:51,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402911138] [2020-02-10 19:52:51,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:51,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 19:52:51,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402911138] [2020-02-10 19:52:51,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:51,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:51,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420099228] [2020-02-10 19:52:51,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:51,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:51,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:51,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:51,422 INFO L87 Difference]: Start difference. First operand 382 states and 1305 transitions. Second operand 9 states. [2020-02-10 19:52:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:51,533 INFO L93 Difference]: Finished difference Result 563 states and 1663 transitions. [2020-02-10 19:52:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:51,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:51,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:51,535 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:52:51,535 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:52:51,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:51,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:52:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 381. [2020-02-10 19:52:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:52:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1303 transitions. [2020-02-10 19:52:51,545 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1303 transitions. Word has length 22 [2020-02-10 19:52:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:51,545 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1303 transitions. [2020-02-10 19:52:51,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1303 transitions. [2020-02-10 19:52:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:51,546 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:51,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 19:52:51,546 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 19:52:51,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:51,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2044965388, now seen corresponding path program 1305 times [2020-02-10 19:52:51,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:51,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155019404] [2020-02-10 19:52:51,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:51,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 19:52:51,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155019404] [2020-02-10 19:52:51,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:51,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:51,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350859075] [2020-02-10 19:52:51,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:51,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:51,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:51,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:51,828 INFO L87 Difference]: Start difference. First operand 381 states and 1303 transitions. Second operand 9 states. [2020-02-10 19:52:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:51,907 INFO L93 Difference]: Finished difference Result 563 states and 1664 transitions. [2020-02-10 19:52:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:51,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:51,909 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:52:51,909 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:52:51,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:52:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 382. [2020-02-10 19:52:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-02-10 19:52:51,921 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-02-10 19:52:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:51,921 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-02-10 19:52:51,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-02-10 19:52:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:51,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:51,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 19:52:51,922 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 19:52:51,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:51,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1714772106, now seen corresponding path program 1306 times [2020-02-10 19:52:51,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:51,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804899576] [2020-02-10 19:52:51,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:52,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 19:52:52,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804899576] [2020-02-10 19:52:52,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:52,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:52,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041895460] [2020-02-10 19:52:52,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:52,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:52,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:52,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:52,204 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:52:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:52,312 INFO L93 Difference]: Finished difference Result 557 states and 1661 transitions. [2020-02-10 19:52:52,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:52,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:52,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:52,314 INFO L225 Difference]: With dead ends: 557 [2020-02-10 19:52:52,314 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:52:52,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 19:52:52,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:52:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 381. [2020-02-10 19:52:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:52:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-02-10 19:52:52,324 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-02-10 19:52:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:52,324 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-02-10 19:52:52,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-02-10 19:52:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:52,324 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:52,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 19:52:52,325 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 19:52:52,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:52,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2055468492, now seen corresponding path program 1307 times [2020-02-10 19:52:52,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:52,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999884596] [2020-02-10 19:52:52,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:52,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 19:52:52,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999884596] [2020-02-10 19:52:52,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:52,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:52,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224737857] [2020-02-10 19:52:52,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:52,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:52,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:52,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:52,600 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:52:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:52,707 INFO L93 Difference]: Finished difference Result 565 states and 1668 transitions. [2020-02-10 19:52:52,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:52,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:52,709 INFO L225 Difference]: With dead ends: 565 [2020-02-10 19:52:52,709 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 19:52:52,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 19:52:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 383. [2020-02-10 19:52:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:52:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1305 transitions. [2020-02-10 19:52:52,719 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1305 transitions. Word has length 22 [2020-02-10 19:52:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:52,719 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1305 transitions. [2020-02-10 19:52:52,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:52,719 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1305 transitions. [2020-02-10 19:52:52,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:52,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52: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 19:52:52,720 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 19:52:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:52,720 INFO L82 PathProgramCache]: Analyzing trace with hash 979757336, now seen corresponding path program 1308 times [2020-02-10 19:52:52,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:52,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496139358] [2020-02-10 19:52:52,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:52,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 19:52:52,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496139358] [2020-02-10 19:52:52,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:52,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:52,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060764806] [2020-02-10 19:52:52,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:52,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:52,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:52,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:52,997 INFO L87 Difference]: Start difference. First operand 383 states and 1305 transitions. Second operand 9 states. [2020-02-10 19:52:53,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:53,103 INFO L93 Difference]: Finished difference Result 558 states and 1662 transitions. [2020-02-10 19:52:53,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:53,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:53,105 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:52:53,105 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 19:52:53,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 19:52:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 380. [2020-02-10 19:52:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:52:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-02-10 19:52:53,116 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-02-10 19:52:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:53,116 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-02-10 19:52:53,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-02-10 19:52:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:53,117 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:53,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:53,117 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 19:52:53,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:53,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1246900712, now seen corresponding path program 1309 times [2020-02-10 19:52:53,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:53,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834237202] [2020-02-10 19:52:53,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:53,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 19:52:53,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834237202] [2020-02-10 19:52:53,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:53,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:53,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754369199] [2020-02-10 19:52:53,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:53,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:53,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:53,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:53,383 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:52:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:53,463 INFO L93 Difference]: Finished difference Result 572 states and 1683 transitions. [2020-02-10 19:52:53,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:53,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:53,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:53,465 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:52:53,465 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:52:53,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 19:52:53,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:52:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 382. [2020-02-10 19:52:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-02-10 19:52:53,474 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-02-10 19:52:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:53,474 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-02-10 19:52:53,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-02-10 19:52:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:53,475 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:53,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 19:52:53,475 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 19:52:53,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:53,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1972355428, now seen corresponding path program 1310 times [2020-02-10 19:52:53,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:53,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497906611] [2020-02-10 19:52:53,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:53,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 19:52:53,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497906611] [2020-02-10 19:52:53,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:53,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:53,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553288876] [2020-02-10 19:52:53,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:53,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:53,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:53,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:53,730 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:52:53,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:53,852 INFO L93 Difference]: Finished difference Result 577 states and 1692 transitions. [2020-02-10 19:52:53,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:53,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:53,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:53,854 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:52:53,855 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:52:53,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 19:52:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:52:53,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 381. [2020-02-10 19:52:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:52:53,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-02-10 19:52:53,865 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-02-10 19:52:53,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:53,865 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-02-10 19:52:53,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:53,865 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-02-10 19:52:53,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:53,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:53,866 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:53,866 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 19:52:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:53,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1447628730, now seen corresponding path program 1311 times [2020-02-10 19:52:53,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:53,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003859492] [2020-02-10 19:52:53,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:54,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 19:52:54,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003859492] [2020-02-10 19:52:54,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:54,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:54,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592705168] [2020-02-10 19:52:54,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:54,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:54,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:54,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:54,131 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:52:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:54,215 INFO L93 Difference]: Finished difference Result 569 states and 1677 transitions. [2020-02-10 19:52:54,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:54,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:54,217 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:52:54,217 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:52:54,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 19:52:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:52:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-02-10 19:52:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1303 transitions. [2020-02-10 19:52:54,227 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1303 transitions. Word has length 22 [2020-02-10 19:52:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:54,227 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1303 transitions. [2020-02-10 19:52:54,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1303 transitions. [2020-02-10 19:52:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:54,228 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:54,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 19:52:54,228 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 19:52:54,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:54,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1982858532, now seen corresponding path program 1312 times [2020-02-10 19:52:54,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:54,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276183547] [2020-02-10 19:52:54,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:54,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 19:52:54,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276183547] [2020-02-10 19:52:54,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:54,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:54,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118950370] [2020-02-10 19:52:54,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:54,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:54,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:54,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:54,485 INFO L87 Difference]: Start difference. First operand 382 states and 1303 transitions. Second operand 9 states. [2020-02-10 19:52:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:54,596 INFO L93 Difference]: Finished difference Result 563 states and 1674 transitions. [2020-02-10 19:52:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:54,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:54,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:54,598 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:52:54,598 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 19:52:54,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 19:52:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 19:52:54,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 381. [2020-02-10 19:52:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:52:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1301 transitions. [2020-02-10 19:52:54,608 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1301 transitions. Word has length 22 [2020-02-10 19:52:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:54,608 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1301 transitions. [2020-02-10 19:52:54,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1301 transitions. [2020-02-10 19:52:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:54,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:54,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:54,609 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 19:52:54,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:54,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1384610106, now seen corresponding path program 1313 times [2020-02-10 19:52:54,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:54,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481778710] [2020-02-10 19:52:54,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:54,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 19:52:54,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481778710] [2020-02-10 19:52:54,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:54,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:54,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720418750] [2020-02-10 19:52:54,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:54,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:54,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:54,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:54,870 INFO L87 Difference]: Start difference. First operand 381 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:52:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:54,978 INFO L93 Difference]: Finished difference Result 577 states and 1695 transitions. [2020-02-10 19:52:54,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:54,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:54,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:54,980 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:52:54,980 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:52:54,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 19:52:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:52:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-02-10 19:52:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:52:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1308 transitions. [2020-02-10 19:52:54,990 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1308 transitions. Word has length 22 [2020-02-10 19:52:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:54,990 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1308 transitions. [2020-02-10 19:52:54,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1308 transitions. [2020-02-10 19:52:54,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:54,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:54,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 19:52:54,991 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 19:52:54,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:54,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1299416232, now seen corresponding path program 1314 times [2020-02-10 19:52:54,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:54,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184541954] [2020-02-10 19:52:54,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:55,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 19:52:55,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184541954] [2020-02-10 19:52:55,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:55,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:55,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054753380] [2020-02-10 19:52:55,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:55,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:55,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:55,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:55,249 INFO L87 Difference]: Start difference. First operand 385 states and 1308 transitions. Second operand 9 states. [2020-02-10 19:52:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:55,359 INFO L93 Difference]: Finished difference Result 566 states and 1679 transitions. [2020-02-10 19:52:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:55,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:55,361 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:52:55,361 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 19:52:55,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 19:52:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 380. [2020-02-10 19:52:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:52:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-02-10 19:52:55,369 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-02-10 19:52:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:55,370 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-02-10 19:52:55,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-02-10 19:52:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:55,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:55,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 19:52:55,370 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 19:52:55,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:55,371 INFO L82 PathProgramCache]: Analyzing trace with hash 689636470, now seen corresponding path program 1315 times [2020-02-10 19:52:55,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:55,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824746326] [2020-02-10 19:52:55,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:55,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 19:52:55,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824746326] [2020-02-10 19:52:55,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:55,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:55,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424731018] [2020-02-10 19:52:55,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:55,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:55,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:55,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:55,615 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:52:55,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:55,737 INFO L93 Difference]: Finished difference Result 578 states and 1698 transitions. [2020-02-10 19:52:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:55,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:55,739 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:52:55,739 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:52:55,739 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:55,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:52:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 384. [2020-02-10 19:52:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1309 transitions. [2020-02-10 19:52:55,748 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1309 transitions. Word has length 22 [2020-02-10 19:52:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:55,748 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1309 transitions. [2020-02-10 19:52:55,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1309 transitions. [2020-02-10 19:52:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:55,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52: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 19:52:55,749 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 19:52:55,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:55,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1997015644, now seen corresponding path program 1316 times [2020-02-10 19:52:55,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:55,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422292962] [2020-02-10 19:52:55,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:55,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 19:52:55,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422292962] [2020-02-10 19:52:55,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:55,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:55,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504396183] [2020-02-10 19:52:55,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:55,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:55,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:55,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:55,989 INFO L87 Difference]: Start difference. First operand 384 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:52:56,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:56,096 INFO L93 Difference]: Finished difference Result 582 states and 1704 transitions. [2020-02-10 19:52:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:56,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:56,097 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:52:56,097 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:52:56,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:56,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:52:56,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 382. [2020-02-10 19:52:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-02-10 19:52:56,107 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-02-10 19:52:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:56,107 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-02-10 19:52:56,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:56,107 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-02-10 19:52:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:56,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:56,108 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:56,108 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 19:52:56,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash -910801384, now seen corresponding path program 1317 times [2020-02-10 19:52:56,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:56,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376192459] [2020-02-10 19:52:56,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:56,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 19:52:56,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376192459] [2020-02-10 19:52:56,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:56,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:56,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433328088] [2020-02-10 19:52:56,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:56,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:56,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:56,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:56,362 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:52:56,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:56,482 INFO L93 Difference]: Finished difference Result 574 states and 1689 transitions. [2020-02-10 19:52:56,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:56,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:56,484 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:52:56,484 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:52:56,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 19:52:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:52:56,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 384. [2020-02-10 19:52:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:52:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1307 transitions. [2020-02-10 19:52:56,494 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1307 transitions. Word has length 22 [2020-02-10 19:52:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:56,494 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1307 transitions. [2020-02-10 19:52:56,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1307 transitions. [2020-02-10 19:52:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:56,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:56,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 19:52:56,495 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 19:52:56,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:56,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1986512540, now seen corresponding path program 1318 times [2020-02-10 19:52:56,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:56,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568413613] [2020-02-10 19:52:56,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:56,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 19:52:56,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568413613] [2020-02-10 19:52:56,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:56,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:56,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880075778] [2020-02-10 19:52:56,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:56,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:56,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:56,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:56,743 INFO L87 Difference]: Start difference. First operand 384 states and 1307 transitions. Second operand 9 states. [2020-02-10 19:52:56,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:56,859 INFO L93 Difference]: Finished difference Result 567 states and 1683 transitions. [2020-02-10 19:52:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:56,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:56,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:56,861 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:52:56,862 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:52:56,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:56,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:52:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 382. [2020-02-10 19:52:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:52:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1302 transitions. [2020-02-10 19:52:56,871 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1302 transitions. Word has length 22 [2020-02-10 19:52:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:56,871 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1302 transitions. [2020-02-10 19:52:56,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1302 transitions. [2020-02-10 19:52:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:56,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:56,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 19:52:56,872 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 19:52:56,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash -984323112, now seen corresponding path program 1319 times [2020-02-10 19:52:56,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:56,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570207228] [2020-02-10 19:52:56,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:57,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 19:52:57,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570207228] [2020-02-10 19:52:57,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:57,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:57,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613631598] [2020-02-10 19:52:57,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:57,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:57,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:57,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:57,119 INFO L87 Difference]: Start difference. First operand 382 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:52:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:57,226 INFO L93 Difference]: Finished difference Result 580 states and 1701 transitions. [2020-02-10 19:52:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:57,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:57,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:57,228 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:52:57,228 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:52:57,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 19:52:57,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:52:57,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 386. [2020-02-10 19:52:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:52:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1309 transitions. [2020-02-10 19:52:57,237 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1309 transitions. Word has length 22 [2020-02-10 19:52:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:57,237 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1309 transitions. [2020-02-10 19:52:57,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1309 transitions. [2020-02-10 19:52:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:57,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:57,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 19:52:57,238 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 19:52:57,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:57,238 INFO L82 PathProgramCache]: Analyzing trace with hash 626617846, now seen corresponding path program 1320 times [2020-02-10 19:52:57,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:57,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511756803] [2020-02-10 19:52:57,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:57,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 19:52:57,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511756803] [2020-02-10 19:52:57,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:57,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:57,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915701002] [2020-02-10 19:52:57,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:57,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:57,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:57,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:57,484 INFO L87 Difference]: Start difference. First operand 386 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:52:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:57,605 INFO L93 Difference]: Finished difference Result 569 states and 1685 transitions. [2020-02-10 19:52:57,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:57,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:57,607 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:52:57,608 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:52:57,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:52:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 376. [2020-02-10 19:52:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:52:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1292 transitions. [2020-02-10 19:52:57,617 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1292 transitions. Word has length 22 [2020-02-10 19:52:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:57,617 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1292 transitions. [2020-02-10 19:52:57,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1292 transitions. [2020-02-10 19:52:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:57,618 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:57,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:57,618 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 19:52:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:57,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1616354142, now seen corresponding path program 1321 times [2020-02-10 19:52:57,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:57,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562891295] [2020-02-10 19:52:57,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:57,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 19:52:57,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562891295] [2020-02-10 19:52:57,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:57,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:57,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256151420] [2020-02-10 19:52:57,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:57,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:57,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:57,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:57,919 INFO L87 Difference]: Start difference. First operand 376 states and 1292 transitions. Second operand 9 states. [2020-02-10 19:52:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:58,026 INFO L93 Difference]: Finished difference Result 533 states and 1590 transitions. [2020-02-10 19:52:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:58,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:58,028 INFO L225 Difference]: With dead ends: 533 [2020-02-10 19:52:58,028 INFO L226 Difference]: Without dead ends: 522 [2020-02-10 19:52:58,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 19:52:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-02-10 19:52:58,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 380. [2020-02-10 19:52:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:52:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1305 transitions. [2020-02-10 19:52:58,038 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1305 transitions. Word has length 22 [2020-02-10 19:52:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:58,038 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1305 transitions. [2020-02-10 19:52:58,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1305 transitions. [2020-02-10 19:52:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:58,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:58,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 19:52:58,039 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 19:52:58,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1233096144, now seen corresponding path program 1322 times [2020-02-10 19:52:58,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:58,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861937433] [2020-02-10 19:52:58,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:58,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 19:52:58,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861937433] [2020-02-10 19:52:58,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:58,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:58,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570484134] [2020-02-10 19:52:58,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:58,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:58,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:58,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:58,347 INFO L87 Difference]: Start difference. First operand 380 states and 1305 transitions. Second operand 9 states. [2020-02-10 19:52:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:58,439 INFO L93 Difference]: Finished difference Result 531 states and 1585 transitions. [2020-02-10 19:52:58,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:58,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:58,441 INFO L225 Difference]: With dead ends: 531 [2020-02-10 19:52:58,441 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 19:52:58,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 19:52:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 19:52:58,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 379. [2020-02-10 19:52:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:52:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1303 transitions. [2020-02-10 19:52:58,450 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1303 transitions. Word has length 22 [2020-02-10 19:52:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:58,450 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1303 transitions. [2020-02-10 19:52:58,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1303 transitions. [2020-02-10 19:52:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:58,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:58,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 19:52:58,451 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 19:52:58,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:58,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1078175300, now seen corresponding path program 1323 times [2020-02-10 19:52:58,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:58,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292933129] [2020-02-10 19:52:58,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52: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 19:52:58,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292933129] [2020-02-10 19:52:58,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:58,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:58,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077856067] [2020-02-10 19:52:58,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:58,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:58,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:58,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:58,748 INFO L87 Difference]: Start difference. First operand 379 states and 1303 transitions. Second operand 9 states. [2020-02-10 19:52:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:58,864 INFO L93 Difference]: Finished difference Result 535 states and 1594 transitions. [2020-02-10 19:52:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:58,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:58,865 INFO L225 Difference]: With dead ends: 535 [2020-02-10 19:52:58,866 INFO L226 Difference]: Without dead ends: 524 [2020-02-10 19:52:58,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-02-10 19:52:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 381. [2020-02-10 19:52:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:52:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-02-10 19:52:58,875 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-02-10 19:52:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:58,875 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-02-10 19:52:58,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-02-10 19:52:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:58,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:58,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 19:52:58,876 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 19:52:58,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:58,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1331268052, now seen corresponding path program 1324 times [2020-02-10 19:52:58,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:58,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48483287] [2020-02-10 19:52:58,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:59,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 19:52:59,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48483287] [2020-02-10 19:52:59,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:59,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:59,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916379787] [2020-02-10 19:52:59,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:59,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:59,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:59,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:59,174 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:52:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:59,294 INFO L93 Difference]: Finished difference Result 534 states and 1590 transitions. [2020-02-10 19:52:59,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:59,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:59,296 INFO L225 Difference]: With dead ends: 534 [2020-02-10 19:52:59,296 INFO L226 Difference]: Without dead ends: 522 [2020-02-10 19:52:59,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 19:52:59,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-02-10 19:52:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 379. [2020-02-10 19:52:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:52:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1302 transitions. [2020-02-10 19:52:59,306 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1302 transitions. Word has length 22 [2020-02-10 19:52:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:59,306 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1302 transitions. [2020-02-10 19:52:59,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1302 transitions. [2020-02-10 19:52:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:59,307 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:59,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 19:52:59,307 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 19:52:59,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:59,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1967779564, now seen corresponding path program 1325 times [2020-02-10 19:52:59,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:59,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416545540] [2020-02-10 19:52:59,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:59,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416545540] [2020-02-10 19:52:59,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:59,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:52:59,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104341628] [2020-02-10 19:52:59,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:52:59,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:59,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:52:59,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:52:59,634 INFO L87 Difference]: Start difference. First operand 379 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:52:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:59,716 INFO L93 Difference]: Finished difference Result 530 states and 1582 transitions. [2020-02-10 19:52:59,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:52:59,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:52:59,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:59,717 INFO L225 Difference]: With dead ends: 530 [2020-02-10 19:52:59,718 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 19:52:59,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:59,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 19:52:59,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 380. [2020-02-10 19:52:59,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:52:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-02-10 19:52:59,728 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-02-10 19:52:59,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:59,728 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-02-10 19:52:59,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:52:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-02-10 19:52:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:52:59,728 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:59,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 19:52:59,729 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 19:52:59,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:59,729 INFO L82 PathProgramCache]: Analyzing trace with hash -356838606, now seen corresponding path program 1326 times [2020-02-10 19:52:59,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:59,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337309129] [2020-02-10 19:52:59,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:00,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 19:53:00,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337309129] [2020-02-10 19:53:00,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:00,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:00,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072787795] [2020-02-10 19:53:00,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:00,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:00,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:00,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:00,037 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-02-10 19:53:00,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:00,153 INFO L93 Difference]: Finished difference Result 531 states and 1583 transitions. [2020-02-10 19:53:00,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:00,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:00,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:00,155 INFO L225 Difference]: With dead ends: 531 [2020-02-10 19:53:00,155 INFO L226 Difference]: Without dead ends: 519 [2020-02-10 19:53:00,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 19:53:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-02-10 19:53:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 378. [2020-02-10 19:53:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1300 transitions. [2020-02-10 19:53:00,165 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1300 transitions. Word has length 22 [2020-02-10 19:53:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:00,165 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1300 transitions. [2020-02-10 19:53:00,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1300 transitions. [2020-02-10 19:53:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:00,166 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:00,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 19:53:00,166 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 19:53:00,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:00,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2081276496, now seen corresponding path program 1327 times [2020-02-10 19:53:00,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:00,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493800117] [2020-02-10 19:53:00,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:00,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493800117] [2020-02-10 19:53:00,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:00,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:00,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273991119] [2020-02-10 19:53:00,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:00,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:00,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:00,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:00,458 INFO L87 Difference]: Start difference. First operand 378 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:53:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:00,581 INFO L93 Difference]: Finished difference Result 538 states and 1600 transitions. [2020-02-10 19:53:00,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:00,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:00,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:00,583 INFO L225 Difference]: With dead ends: 538 [2020-02-10 19:53:00,583 INFO L226 Difference]: Without dead ends: 527 [2020-02-10 19:53:00,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-02-10 19:53:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 380. [2020-02-10 19:53:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1304 transitions. [2020-02-10 19:53:00,593 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1304 transitions. Word has length 22 [2020-02-10 19:53:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:00,593 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1304 transitions. [2020-02-10 19:53:00,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1304 transitions. [2020-02-10 19:53:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:00,594 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:00,594 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:00,594 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 19:53:00,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:00,594 INFO L82 PathProgramCache]: Analyzing trace with hash 635759486, now seen corresponding path program 1328 times [2020-02-10 19:53:00,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:00,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845656395] [2020-02-10 19:53:00,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:00,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 19:53:00,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845656395] [2020-02-10 19:53:00,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:00,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:00,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119192465] [2020-02-10 19:53:00,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:00,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:00,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:00,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:00,890 INFO L87 Difference]: Start difference. First operand 380 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:53:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:00,984 INFO L93 Difference]: Finished difference Result 536 states and 1595 transitions. [2020-02-10 19:53:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:00,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:00,986 INFO L225 Difference]: With dead ends: 536 [2020-02-10 19:53:00,986 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 19:53:00,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 19:53:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 379. [2020-02-10 19:53:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1302 transitions. [2020-02-10 19:53:00,995 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1302 transitions. Word has length 22 [2020-02-10 19:53:00,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:00,995 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1302 transitions. [2020-02-10 19:53:00,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:00,995 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1302 transitions. [2020-02-10 19:53:00,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:00,996 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:00,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 19:53:00,996 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 19:53:00,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:00,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1200998268, now seen corresponding path program 1329 times [2020-02-10 19:53:00,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:00,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052974356] [2020-02-10 19:53:00,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:01,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 19:53:01,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052974356] [2020-02-10 19:53:01,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:01,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:01,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421868394] [2020-02-10 19:53:01,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:01,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:01,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:01,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:01,281 INFO L87 Difference]: Start difference. First operand 379 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:53:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:01,393 INFO L93 Difference]: Finished difference Result 545 states and 1615 transitions. [2020-02-10 19:53:01,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:01,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:01,395 INFO L225 Difference]: With dead ends: 545 [2020-02-10 19:53:01,395 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 19:53:01,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 19:53:01,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 19:53:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 382. [2020-02-10 19:53:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:53:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1307 transitions. [2020-02-10 19:53:01,406 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1307 transitions. Word has length 22 [2020-02-10 19:53:01,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:01,406 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1307 transitions. [2020-02-10 19:53:01,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1307 transitions. [2020-02-10 19:53:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:01,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:01,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 19:53:01,407 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 19:53:01,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:01,407 INFO L82 PathProgramCache]: Analyzing trace with hash 185036862, now seen corresponding path program 1330 times [2020-02-10 19:53:01,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:01,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645551011] [2020-02-10 19:53:01,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:01,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 19:53:01,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645551011] [2020-02-10 19:53:01,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:01,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:01,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338841016] [2020-02-10 19:53:01,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:01,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:01,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:01,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:01,706 INFO L87 Difference]: Start difference. First operand 382 states and 1307 transitions. Second operand 9 states. [2020-02-10 19:53:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:01,823 INFO L93 Difference]: Finished difference Result 548 states and 1618 transitions. [2020-02-10 19:53:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:01,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:01,825 INFO L225 Difference]: With dead ends: 548 [2020-02-10 19:53:01,825 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:53:01,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 19:53:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:53:01,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 379. [2020-02-10 19:53:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-02-10 19:53:01,834 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-02-10 19:53:01,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:01,834 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-02-10 19:53:01,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-02-10 19:53:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:01,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:01,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 19:53:01,835 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 19:53:01,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:01,835 INFO L82 PathProgramCache]: Analyzing trace with hash 48014164, now seen corresponding path program 1331 times [2020-02-10 19:53:01,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:01,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630672472] [2020-02-10 19:53:01,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:02,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 19:53:02,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630672472] [2020-02-10 19:53:02,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:02,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:02,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855281854] [2020-02-10 19:53:02,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:02,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:02,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:02,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:02,122 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:53:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:02,206 INFO L93 Difference]: Finished difference Result 539 states and 1600 transitions. [2020-02-10 19:53:02,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:02,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:02,208 INFO L225 Difference]: With dead ends: 539 [2020-02-10 19:53:02,208 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 19:53:02,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:02,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 19:53:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 380. [2020-02-10 19:53:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-02-10 19:53:02,218 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-02-10 19:53:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:02,218 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-02-10 19:53:02,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-02-10 19:53:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:02,219 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:02,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 19:53:02,219 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 19:53:02,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:02,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1027696992, now seen corresponding path program 1332 times [2020-02-10 19:53:02,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:02,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324520583] [2020-02-10 19:53:02,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:02,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 19:53:02,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324520583] [2020-02-10 19:53:02,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:02,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:02,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981375872] [2020-02-10 19:53:02,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:02,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:02,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:02,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:02,504 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:53:02,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:02,624 INFO L93 Difference]: Finished difference Result 544 states and 1609 transitions. [2020-02-10 19:53:02,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:02,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:02,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:02,626 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:53:02,626 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 19:53:02,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 19:53:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 19:53:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 378. [2020-02-10 19:53:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1299 transitions. [2020-02-10 19:53:02,635 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1299 transitions. Word has length 22 [2020-02-10 19:53:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:02,635 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1299 transitions. [2020-02-10 19:53:02,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1299 transitions. [2020-02-10 19:53:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:02,636 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:02,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 19:53:02,636 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 19:53:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:02,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1888094576, now seen corresponding path program 1333 times [2020-02-10 19:53:02,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:02,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747791731] [2020-02-10 19:53:02,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:02,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 19:53:02,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747791731] [2020-02-10 19:53:02,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:02,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:02,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941598745] [2020-02-10 19:53:02,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:02,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:02,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:02,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:02,933 INFO L87 Difference]: Start difference. First operand 378 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:53:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:03,058 INFO L93 Difference]: Finished difference Result 544 states and 1616 transitions. [2020-02-10 19:53:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:03,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:03,060 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:53:03,060 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:53:03,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:53:03,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 382. [2020-02-10 19:53:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:53:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1309 transitions. [2020-02-10 19:53:03,070 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1309 transitions. Word has length 22 [2020-02-10 19:53:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:03,070 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1309 transitions. [2020-02-10 19:53:03,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1309 transitions. [2020-02-10 19:53:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:03,070 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:03,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 19:53:03,070 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 19:53:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1635001824, now seen corresponding path program 1334 times [2020-02-10 19:53:03,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:03,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577123899] [2020-02-10 19:53:03,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:03,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 19:53:03,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577123899] [2020-02-10 19:53:03,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:03,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:03,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089124620] [2020-02-10 19:53:03,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:03,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:03,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:03,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:03,370 INFO L87 Difference]: Start difference. First operand 382 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:53:03,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:03,479 INFO L93 Difference]: Finished difference Result 543 states and 1612 transitions. [2020-02-10 19:53:03,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:03,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:03,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:03,481 INFO L225 Difference]: With dead ends: 543 [2020-02-10 19:53:03,481 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:53:03,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 19:53:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:53:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 380. [2020-02-10 19:53:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1304 transitions. [2020-02-10 19:53:03,489 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1304 transitions. Word has length 22 [2020-02-10 19:53:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:03,489 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1304 transitions. [2020-02-10 19:53:03,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1304 transitions. [2020-02-10 19:53:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:03,490 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:03,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 19:53:03,490 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 19:53:03,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:03,490 INFO L82 PathProgramCache]: Analyzing trace with hash 725035810, now seen corresponding path program 1335 times [2020-02-10 19:53:03,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:03,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95134584] [2020-02-10 19:53:03,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:03,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 19:53:03,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95134584] [2020-02-10 19:53:03,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:03,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:03,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226438701] [2020-02-10 19:53:03,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:03,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:03,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:03,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:03,786 INFO L87 Difference]: Start difference. First operand 380 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:53:03,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:03,894 INFO L93 Difference]: Finished difference Result 549 states and 1625 transitions. [2020-02-10 19:53:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:03,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:03,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:03,896 INFO L225 Difference]: With dead ends: 549 [2020-02-10 19:53:03,896 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 19:53:03,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 19:53:03,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 19:53:03,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 383. [2020-02-10 19:53:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:53:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1309 transitions. [2020-02-10 19:53:03,906 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1309 transitions. Word has length 22 [2020-02-10 19:53:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:03,906 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1309 transitions. [2020-02-10 19:53:03,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1309 transitions. [2020-02-10 19:53:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:03,907 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:03,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 19:53:03,907 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 19:53:03,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2111070940, now seen corresponding path program 1336 times [2020-02-10 19:53:03,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:03,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119625625] [2020-02-10 19:53:03,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:04,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 19:53:04,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119625625] [2020-02-10 19:53:04,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:04,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:04,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865573445] [2020-02-10 19:53:04,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:04,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:04,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:04,199 INFO L87 Difference]: Start difference. First operand 383 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:53:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:04,308 INFO L93 Difference]: Finished difference Result 552 states and 1628 transitions. [2020-02-10 19:53:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:04,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:04,310 INFO L225 Difference]: With dead ends: 552 [2020-02-10 19:53:04,310 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:53:04,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:53:04,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 380. [2020-02-10 19:53:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:04,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-02-10 19:53:04,320 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-02-10 19:53:04,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:04,320 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-02-10 19:53:04,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:04,321 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-02-10 19:53:04,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:04,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:04,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 19:53:04,321 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 19:53:04,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:04,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2119055616, now seen corresponding path program 1337 times [2020-02-10 19:53:04,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:04,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48950143] [2020-02-10 19:53:04,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:04,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 19:53:04,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48950143] [2020-02-10 19:53:04,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:04,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:04,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105579081] [2020-02-10 19:53:04,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:04,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:04,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:04,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:04,606 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:53:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:04,729 INFO L93 Difference]: Finished difference Result 546 states and 1616 transitions. [2020-02-10 19:53:04,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:04,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:04,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:04,731 INFO L225 Difference]: With dead ends: 546 [2020-02-10 19:53:04,731 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 19:53:04,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 19:53:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 19:53:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 382. [2020-02-10 19:53:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:53:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1305 transitions. [2020-02-10 19:53:04,740 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1305 transitions. Word has length 22 [2020-02-10 19:53:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:04,741 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1305 transitions. [2020-02-10 19:53:04,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:04,741 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1305 transitions. [2020-02-10 19:53:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:04,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:04,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 19:53:04,741 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 19:53:04,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:04,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1201105426, now seen corresponding path program 1338 times [2020-02-10 19:53:04,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:04,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054414919] [2020-02-10 19:53:04,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:05,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 19:53:05,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054414919] [2020-02-10 19:53:05,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:05,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:05,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604455208] [2020-02-10 19:53:05,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:05,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:05,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:05,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:05,048 INFO L87 Difference]: Start difference. First operand 382 states and 1305 transitions. Second operand 9 states. [2020-02-10 19:53:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:05,157 INFO L93 Difference]: Finished difference Result 550 states and 1622 transitions. [2020-02-10 19:53:05,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:05,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:05,159 INFO L225 Difference]: With dead ends: 550 [2020-02-10 19:53:05,159 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 19:53:05,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 19:53:05,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 19:53:05,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 378. [2020-02-10 19:53:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1298 transitions. [2020-02-10 19:53:05,169 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1298 transitions. Word has length 22 [2020-02-10 19:53:05,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:05,169 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1298 transitions. [2020-02-10 19:53:05,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1298 transitions. [2020-02-10 19:53:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:05,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:05,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 19:53:05,170 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 19:53:05,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1286951934, now seen corresponding path program 1339 times [2020-02-10 19:53:05,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:05,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940561788] [2020-02-10 19:53:05,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:05,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 19:53:05,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940561788] [2020-02-10 19:53:05,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:05,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:05,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204899167] [2020-02-10 19:53:05,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:05,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:05,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:05,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:05,482 INFO L87 Difference]: Start difference. First operand 378 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:53:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:05,580 INFO L93 Difference]: Finished difference Result 533 states and 1587 transitions. [2020-02-10 19:53:05,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:05,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:05,581 INFO L225 Difference]: With dead ends: 533 [2020-02-10 19:53:05,582 INFO L226 Difference]: Without dead ends: 524 [2020-02-10 19:53:05,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 19:53:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-02-10 19:53:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 380. [2020-02-10 19:53:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-02-10 19:53:05,591 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-02-10 19:53:05,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:05,595 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-02-10 19:53:05,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-02-10 19:53:05,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:05,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:05,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 19:53:05,596 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 19:53:05,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:05,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1397074404, now seen corresponding path program 1340 times [2020-02-10 19:53:05,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:05,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016350911] [2020-02-10 19:53:05,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:05,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 19:53:05,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016350911] [2020-02-10 19:53:05,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:05,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:05,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348251957] [2020-02-10 19:53:05,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:05,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:05,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:05,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:05,900 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:53:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:06,006 INFO L93 Difference]: Finished difference Result 534 states and 1588 transitions. [2020-02-10 19:53:06,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:06,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:06,008 INFO L225 Difference]: With dead ends: 534 [2020-02-10 19:53:06,008 INFO L226 Difference]: Without dead ends: 523 [2020-02-10 19:53:06,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 19:53:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-02-10 19:53:06,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 379. [2020-02-10 19:53:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-02-10 19:53:06,018 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-02-10 19:53:06,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:06,018 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-02-10 19:53:06,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:06,018 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-02-10 19:53:06,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:06,018 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:06,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 19:53:06,019 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 19:53:06,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:06,019 INFO L82 PathProgramCache]: Analyzing trace with hash -394884976, now seen corresponding path program 1341 times [2020-02-10 19:53:06,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:06,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870676791] [2020-02-10 19:53:06,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:06,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 19:53:06,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870676791] [2020-02-10 19:53:06,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:06,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:06,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399502937] [2020-02-10 19:53:06,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:06,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:06,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:06,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:06,299 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:53:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:06,383 INFO L93 Difference]: Finished difference Result 537 states and 1594 transitions. [2020-02-10 19:53:06,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:06,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:06,385 INFO L225 Difference]: With dead ends: 537 [2020-02-10 19:53:06,385 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 19:53:06,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 19:53:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 19:53:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 380. [2020-02-10 19:53:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-02-10 19:53:06,394 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-02-10 19:53:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:06,394 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-02-10 19:53:06,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-02-10 19:53:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:06,395 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:06,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 19:53:06,395 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 19:53:06,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:06,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1470596132, now seen corresponding path program 1342 times [2020-02-10 19:53:06,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:06,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507163111] [2020-02-10 19:53:06,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:06,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 19:53:06,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507163111] [2020-02-10 19:53:06,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:06,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:06,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991053648] [2020-02-10 19:53:06,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:06,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:06,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:06,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:06,667 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:53:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:06,778 INFO L93 Difference]: Finished difference Result 542 states and 1603 transitions. [2020-02-10 19:53:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:06,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:06,779 INFO L225 Difference]: With dead ends: 542 [2020-02-10 19:53:06,780 INFO L226 Difference]: Without dead ends: 527 [2020-02-10 19:53:06,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-02-10 19:53:06,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 379. [2020-02-10 19:53:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-02-10 19:53:06,788 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-02-10 19:53:06,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:06,788 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-02-10 19:53:06,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-02-10 19:53:06,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:06,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:06,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 19:53:06,789 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 19:53:06,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:06,789 INFO L82 PathProgramCache]: Analyzing trace with hash -384381872, now seen corresponding path program 1343 times [2020-02-10 19:53:06,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:06,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852174199] [2020-02-10 19:53:06,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:07,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 19:53:07,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852174199] [2020-02-10 19:53:07,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:07,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:07,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103450171] [2020-02-10 19:53:07,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:07,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:07,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:07,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:07,072 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:53:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:07,176 INFO L93 Difference]: Finished difference Result 540 states and 1600 transitions. [2020-02-10 19:53:07,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:07,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:07,178 INFO L225 Difference]: With dead ends: 540 [2020-02-10 19:53:07,178 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 19:53:07,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 19:53:07,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 19:53:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 381. [2020-02-10 19:53:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-02-10 19:53:07,187 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-02-10 19:53:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:07,187 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-02-10 19:53:07,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-02-10 19:53:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:07,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:07,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:07,187 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 19:53:07,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:07,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1223933310, now seen corresponding path program 1344 times [2020-02-10 19:53:07,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:07,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168194157] [2020-02-10 19:53:07,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:07,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 19:53:07,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168194157] [2020-02-10 19:53:07,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:07,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:07,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883001358] [2020-02-10 19:53:07,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:07,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:07,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:07,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:07,469 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:53:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:07,577 INFO L93 Difference]: Finished difference Result 544 states and 1606 transitions. [2020-02-10 19:53:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:07,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:07,579 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:53:07,579 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 19:53: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 19:53:07,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 19:53:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 377. [2020-02-10 19:53:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:53:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1296 transitions. [2020-02-10 19:53:07,589 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1296 transitions. Word has length 22 [2020-02-10 19:53:07,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:07,589 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1296 transitions. [2020-02-10 19:53:07,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:07,589 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1296 transitions. [2020-02-10 19:53:07,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:07,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53: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 19:53:07,590 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 19:53:07,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:07,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2038839868, now seen corresponding path program 1345 times [2020-02-10 19:53:07,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:07,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681145406] [2020-02-10 19:53:07,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:07,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 19:53:07,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681145406] [2020-02-10 19:53:07,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:07,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:07,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495344921] [2020-02-10 19:53:07,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:07,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:07,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:07,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:07,917 INFO L87 Difference]: Start difference. First operand 377 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:53:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:08,022 INFO L93 Difference]: Finished difference Result 530 states and 1582 transitions. [2020-02-10 19:53:08,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:08,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:08,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:08,024 INFO L225 Difference]: With dead ends: 530 [2020-02-10 19:53:08,024 INFO L226 Difference]: Without dead ends: 519 [2020-02-10 19:53:08,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-02-10 19:53:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 380. [2020-02-10 19:53:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1304 transitions. [2020-02-10 19:53:08,033 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1304 transitions. Word has length 22 [2020-02-10 19:53:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:08,033 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1304 transitions. [2020-02-10 19:53:08,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1304 transitions. [2020-02-10 19:53:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:08,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:08,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 19:53:08,034 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 19:53:08,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:08,034 INFO L82 PathProgramCache]: Analyzing trace with hash 810610418, now seen corresponding path program 1346 times [2020-02-10 19:53:08,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:08,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829858871] [2020-02-10 19:53:08,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:08,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829858871] [2020-02-10 19:53:08,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:08,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:08,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114943538] [2020-02-10 19:53:08,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:08,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:08,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:08,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:08,346 INFO L87 Difference]: Start difference. First operand 380 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:53:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:08,459 INFO L93 Difference]: Finished difference Result 528 states and 1577 transitions. [2020-02-10 19:53:08,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:08,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:08,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:08,461 INFO L225 Difference]: With dead ends: 528 [2020-02-10 19:53:08,461 INFO L226 Difference]: Without dead ends: 518 [2020-02-10 19:53:08,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-02-10 19:53:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 379. [2020-02-10 19:53:08,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1302 transitions. [2020-02-10 19:53:08,470 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1302 transitions. Word has length 22 [2020-02-10 19:53:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:08,470 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1302 transitions. [2020-02-10 19:53:08,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:08,470 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1302 transitions. [2020-02-10 19:53:08,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:08,470 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:08,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 19:53:08,470 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 19:53:08,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:08,471 INFO L82 PathProgramCache]: Analyzing trace with hash 655689574, now seen corresponding path program 1347 times [2020-02-10 19:53:08,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:08,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879165969] [2020-02-10 19:53:08,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:08,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 19:53:08,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879165969] [2020-02-10 19:53:08,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:08,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:08,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379846162] [2020-02-10 19:53:08,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:08,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:08,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:08,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:08,769 INFO L87 Difference]: Start difference. First operand 379 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:53:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:08,896 INFO L93 Difference]: Finished difference Result 532 states and 1586 transitions. [2020-02-10 19:53:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:08,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:08,898 INFO L225 Difference]: With dead ends: 532 [2020-02-10 19:53:08,898 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 19:53:08,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 19:53:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 19:53:08,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 381. [2020-02-10 19:53:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:08,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1305 transitions. [2020-02-10 19:53:08,908 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1305 transitions. Word has length 22 [2020-02-10 19:53:08,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:08,908 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1305 transitions. [2020-02-10 19:53:08,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1305 transitions. [2020-02-10 19:53:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:08,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:08,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 19:53:08,909 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 19:53:08,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:08,909 INFO L82 PathProgramCache]: Analyzing trace with hash 908782326, now seen corresponding path program 1348 times [2020-02-10 19:53:08,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:08,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071578303] [2020-02-10 19:53:08,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:09,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 19:53:09,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071578303] [2020-02-10 19:53:09,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:09,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:09,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748791821] [2020-02-10 19:53:09,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:09,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:09,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:09,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:09,213 INFO L87 Difference]: Start difference. First operand 381 states and 1305 transitions. Second operand 9 states. [2020-02-10 19:53:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:09,336 INFO L93 Difference]: Finished difference Result 531 states and 1582 transitions. [2020-02-10 19:53:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:09,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:09,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:09,338 INFO L225 Difference]: With dead ends: 531 [2020-02-10 19:53:09,338 INFO L226 Difference]: Without dead ends: 519 [2020-02-10 19:53:09,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 19:53:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-02-10 19:53:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 379. [2020-02-10 19:53:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-02-10 19:53:09,347 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-02-10 19:53:09,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:09,347 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-02-10 19:53:09,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-02-10 19:53:09,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:09,348 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:09,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 19:53:09,348 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 19:53:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:09,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1904702006, now seen corresponding path program 1349 times [2020-02-10 19:53:09,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:09,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797410467] [2020-02-10 19:53:09,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:09,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 19:53:09,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797410467] [2020-02-10 19:53:09,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:09,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:09,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395960609] [2020-02-10 19:53:09,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:09,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:09,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:09,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:09,665 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:53:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:09,752 INFO L93 Difference]: Finished difference Result 527 states and 1574 transitions. [2020-02-10 19:53:09,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:09,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:09,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:09,754 INFO L225 Difference]: With dead ends: 527 [2020-02-10 19:53:09,754 INFO L226 Difference]: Without dead ends: 518 [2020-02-10 19:53:09,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:09,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-02-10 19:53:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 380. [2020-02-10 19:53:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:09,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-02-10 19:53:09,764 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-02-10 19:53:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:09,764 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-02-10 19:53:09,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-02-10 19:53:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:09,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:09,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 19:53:09,765 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 19:53:09,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:09,765 INFO L82 PathProgramCache]: Analyzing trace with hash -779324332, now seen corresponding path program 1350 times [2020-02-10 19:53:09,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:09,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128305754] [2020-02-10 19:53:09,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:10,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128305754] [2020-02-10 19:53:10,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:10,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:10,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126908348] [2020-02-10 19:53:10,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:10,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:10,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:10,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:10,079 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:53:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:10,215 INFO L93 Difference]: Finished difference Result 528 states and 1575 transitions. [2020-02-10 19:53:10,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:10,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:10,217 INFO L225 Difference]: With dead ends: 528 [2020-02-10 19:53:10,217 INFO L226 Difference]: Without dead ends: 516 [2020-02-10 19:53:10,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 19:53:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-02-10 19:53:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 378. [2020-02-10 19:53:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1299 transitions. [2020-02-10 19:53:10,227 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1299 transitions. Word has length 22 [2020-02-10 19:53:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:10,227 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1299 transitions. [2020-02-10 19:53:10,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:10,227 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1299 transitions. [2020-02-10 19:53:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:10,228 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:10,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 19:53:10,228 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 19:53:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:10,228 INFO L82 PathProgramCache]: Analyzing trace with hash -710142448, now seen corresponding path program 1351 times [2020-02-10 19:53:10,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:10,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752703799] [2020-02-10 19:53:10,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:10,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 19:53:10,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752703799] [2020-02-10 19:53:10,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:10,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:10,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222581182] [2020-02-10 19:53:10,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:10,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:10,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:10,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:10,518 INFO L87 Difference]: Start difference. First operand 378 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:53:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:10,644 INFO L93 Difference]: Finished difference Result 532 states and 1586 transitions. [2020-02-10 19:53:10,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:10,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:10,646 INFO L225 Difference]: With dead ends: 532 [2020-02-10 19:53:10,646 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 19:53:10,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:10,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 19:53:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 380. [2020-02-10 19:53:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-02-10 19:53:10,656 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-02-10 19:53:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:10,656 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-02-10 19:53:10,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-02-10 19:53:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:10,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:10,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 19:53:10,656 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 19:53:10,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:10,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2139307838, now seen corresponding path program 1352 times [2020-02-10 19:53:10,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:10,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979117863] [2020-02-10 19:53:10,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:10,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 19:53:10,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979117863] [2020-02-10 19:53:10,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:10,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:10,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416924847] [2020-02-10 19:53:10,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:10,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:10,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:10,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:10,952 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-02-10 19:53:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:11,046 INFO L93 Difference]: Finished difference Result 530 states and 1581 transitions. [2020-02-10 19:53:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:11,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:11,048 INFO L225 Difference]: With dead ends: 530 [2020-02-10 19:53:11,048 INFO L226 Difference]: Without dead ends: 520 [2020-02-10 19:53:11,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 19:53:11,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-02-10 19:53:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 379. [2020-02-10 19:53:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-02-10 19:53:11,058 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-02-10 19:53:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:11,058 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-02-10 19:53:11,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-02-10 19:53:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:11,059 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:11,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 19:53:11,059 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 19:53:11,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:11,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1297887770, now seen corresponding path program 1353 times [2020-02-10 19:53:11,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:11,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557020822] [2020-02-10 19:53:11,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:11,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 19:53:11,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557020822] [2020-02-10 19:53:11,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:11,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:11,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710167554] [2020-02-10 19:53:11,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:11,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:11,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:11,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:11,356 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:53:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:11,484 INFO L93 Difference]: Finished difference Result 534 states and 1592 transitions. [2020-02-10 19:53:11,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:11,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:11,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:11,485 INFO L225 Difference]: With dead ends: 534 [2020-02-10 19:53:11,486 INFO L226 Difference]: Without dead ends: 523 [2020-02-10 19:53:11,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 19:53:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-02-10 19:53:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 382. [2020-02-10 19:53:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:53:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-02-10 19:53:11,495 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-02-10 19:53:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:11,495 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-02-10 19:53:11,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-02-10 19:53:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:11,496 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:11,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 19:53:11,496 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 19:53:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:11,496 INFO L82 PathProgramCache]: Analyzing trace with hash -995869826, now seen corresponding path program 1354 times [2020-02-10 19:53:11,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:11,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079215859] [2020-02-10 19:53:11,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:11,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 19:53:11,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079215859] [2020-02-10 19:53:11,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:11,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:11,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876823282] [2020-02-10 19:53:11,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:11,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:11,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:11,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:11,793 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:53:11,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:11,913 INFO L93 Difference]: Finished difference Result 526 states and 1583 transitions. [2020-02-10 19:53:11,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:11,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:11,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:11,915 INFO L225 Difference]: With dead ends: 526 [2020-02-10 19:53:11,915 INFO L226 Difference]: Without dead ends: 511 [2020-02-10 19:53:11,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:11,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-02-10 19:53:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 379. [2020-02-10 19:53:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-02-10 19:53:11,924 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-02-10 19:53:11,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:11,925 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-02-10 19:53:11,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-02-10 19:53:11,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:11,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:11,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 19:53:11,925 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 19:53:11,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:11,926 INFO L82 PathProgramCache]: Analyzing trace with hash -48875338, now seen corresponding path program 1355 times [2020-02-10 19:53:11,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:11,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762824513] [2020-02-10 19:53:11,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:12,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 19:53:12,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762824513] [2020-02-10 19:53:12,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:12,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:12,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198994829] [2020-02-10 19:53:12,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:12,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:12,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:12,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:12,223 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:53:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:12,334 INFO L93 Difference]: Finished difference Result 530 states and 1581 transitions. [2020-02-10 19:53:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:12,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:12,336 INFO L225 Difference]: With dead ends: 530 [2020-02-10 19:53:12,336 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 19:53:12,337 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 19:53:12,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 380. [2020-02-10 19:53:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-02-10 19:53:12,346 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-02-10 19:53:12,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:12,347 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-02-10 19:53:12,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:12,347 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-02-10 19:53:12,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:12,347 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:12,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 19:53:12,347 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 19:53:12,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:12,348 INFO L82 PathProgramCache]: Analyzing trace with hash 486354464, now seen corresponding path program 1356 times [2020-02-10 19:53:12,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:12,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335810225] [2020-02-10 19:53:12,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:12,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335810225] [2020-02-10 19:53:12,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:12,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:12,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127523132] [2020-02-10 19:53:12,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:12,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:12,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:12,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:12,633 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:53:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:12,749 INFO L93 Difference]: Finished difference Result 524 states and 1578 transitions. [2020-02-10 19:53:12,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:12,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:12,751 INFO L225 Difference]: With dead ends: 524 [2020-02-10 19:53:12,751 INFO L226 Difference]: Without dead ends: 510 [2020-02-10 19:53:12,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 19:53:12,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-02-10 19:53:12,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 378. [2020-02-10 19:53:12,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1298 transitions. [2020-02-10 19:53:12,760 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1298 transitions. Word has length 22 [2020-02-10 19:53:12,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:12,760 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1298 transitions. [2020-02-10 19:53:12,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1298 transitions. [2020-02-10 19:53:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:12,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:12,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 19:53:12,761 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 19:53:12,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:12,762 INFO L82 PathProgramCache]: Analyzing trace with hash -384546224, now seen corresponding path program 1357 times [2020-02-10 19:53:12,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:12,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749035405] [2020-02-10 19:53:12,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:13,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 19:53:13,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749035405] [2020-02-10 19:53:13,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:13,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:13,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135142843] [2020-02-10 19:53:13,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:13,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:13,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:13,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:13,064 INFO L87 Difference]: Start difference. First operand 378 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:53:13,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:13,192 INFO L93 Difference]: Finished difference Result 537 states and 1599 transitions. [2020-02-10 19:53:13,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:13,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:13,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:13,194 INFO L225 Difference]: With dead ends: 537 [2020-02-10 19:53:13,194 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 19:53:13,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 19:53:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 382. [2020-02-10 19:53:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:53:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1308 transitions. [2020-02-10 19:53:13,205 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1308 transitions. Word has length 22 [2020-02-10 19:53:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:13,205 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1308 transitions. [2020-02-10 19:53:13,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1308 transitions. [2020-02-10 19:53:13,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:13,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:13,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 19:53:13,206 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 19:53:13,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:13,206 INFO L82 PathProgramCache]: Analyzing trace with hash -131453472, now seen corresponding path program 1358 times [2020-02-10 19:53:13,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:13,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349259401] [2020-02-10 19:53:13,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:13,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 19:53:13,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349259401] [2020-02-10 19:53:13,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:13,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:13,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685889710] [2020-02-10 19:53:13,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:13,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:13,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:13,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:13,512 INFO L87 Difference]: Start difference. First operand 382 states and 1308 transitions. Second operand 9 states. [2020-02-10 19:53:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:13,639 INFO L93 Difference]: Finished difference Result 536 states and 1595 transitions. [2020-02-10 19:53:13,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:13,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:13,640 INFO L225 Difference]: With dead ends: 536 [2020-02-10 19:53:13,640 INFO L226 Difference]: Without dead ends: 524 [2020-02-10 19:53:13,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 19:53:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-02-10 19:53:13,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 380. [2020-02-10 19:53:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-02-10 19:53:13,648 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-02-10 19:53:13,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:13,649 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-02-10 19:53:13,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-02-10 19:53:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:13,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:13,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 19:53:13,649 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 19:53:13,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:13,650 INFO L82 PathProgramCache]: Analyzing trace with hash 628146308, now seen corresponding path program 1359 times [2020-02-10 19:53:13,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:13,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527138939] [2020-02-10 19:53:13,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:13,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 19:53:13,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527138939] [2020-02-10 19:53:13,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:13,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:13,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680320821] [2020-02-10 19:53:13,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:13,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:13,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:13,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:13,951 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-02-10 19:53:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:14,088 INFO L93 Difference]: Finished difference Result 537 states and 1599 transitions. [2020-02-10 19:53:14,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:14,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:14,090 INFO L225 Difference]: With dead ends: 537 [2020-02-10 19:53:14,090 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 19:53:14,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 19:53:14,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 19:53:14,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 383. [2020-02-10 19:53:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:53:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1308 transitions. [2020-02-10 19:53:14,100 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1308 transitions. Word has length 22 [2020-02-10 19:53:14,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:14,100 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1308 transitions. [2020-02-10 19:53:14,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1308 transitions. [2020-02-10 19:53:14,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:14,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:14,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 19:53:14,101 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 19:53:14,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:14,101 INFO L82 PathProgramCache]: Analyzing trace with hash 930164252, now seen corresponding path program 1360 times [2020-02-10 19:53:14,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:14,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477701073] [2020-02-10 19:53:14,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:14,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 19:53:14,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477701073] [2020-02-10 19:53:14,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:14,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:14,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713019058] [2020-02-10 19:53:14,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:14,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:14,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:14,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:14,395 INFO L87 Difference]: Start difference. First operand 383 states and 1308 transitions. Second operand 9 states. [2020-02-10 19:53:14,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:14,516 INFO L93 Difference]: Finished difference Result 529 states and 1590 transitions. [2020-02-10 19:53:14,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:14,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:14,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:14,518 INFO L225 Difference]: With dead ends: 529 [2020-02-10 19:53:14,518 INFO L226 Difference]: Without dead ends: 514 [2020-02-10 19:53:14,519 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:14,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-02-10 19:53:14,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 380. [2020-02-10 19:53:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-02-10 19:53:14,529 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-02-10 19:53:14,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:14,529 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-02-10 19:53:14,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:14,529 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-02-10 19:53:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:14,529 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:14,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 19:53:14,530 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 19:53:14,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:14,530 INFO L82 PathProgramCache]: Analyzing trace with hash -661860224, now seen corresponding path program 1361 times [2020-02-10 19:53:14,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:14,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032745003] [2020-02-10 19:53:14,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:14,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 19:53:14,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032745003] [2020-02-10 19:53:14,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:14,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:14,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392960496] [2020-02-10 19:53:14,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:14,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:14,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:14,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:14,829 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:53:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:14,946 INFO L93 Difference]: Finished difference Result 535 states and 1592 transitions. [2020-02-10 19:53:14,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:14,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:14,948 INFO L225 Difference]: With dead ends: 535 [2020-02-10 19:53:14,948 INFO L226 Difference]: Without dead ends: 525 [2020-02-10 19:53:14,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 19:53:14,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-02-10 19:53:14,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 382. [2020-02-10 19:53:14,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:53:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-02-10 19:53:14,958 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-02-10 19:53:14,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:14,958 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-02-10 19:53:14,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-02-10 19:53:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:14,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:14,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 19:53:14,959 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 19:53:14,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:14,959 INFO L82 PathProgramCache]: Analyzing trace with hash -835107916, now seen corresponding path program 1362 times [2020-02-10 19:53:14,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:14,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356202579] [2020-02-10 19:53:14,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53: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 19:53:15,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356202579] [2020-02-10 19:53:15,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:15,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:15,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618812044] [2020-02-10 19:53:15,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:15,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:15,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:15,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:15,246 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:53:15,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:15,385 INFO L93 Difference]: Finished difference Result 528 states and 1586 transitions. [2020-02-10 19:53:15,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:15,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:15,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:15,387 INFO L225 Difference]: With dead ends: 528 [2020-02-10 19:53:15,387 INFO L226 Difference]: Without dead ends: 512 [2020-02-10 19:53:15,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 19:53:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2020-02-10 19:53:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 378. [2020-02-10 19:53:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1297 transitions. [2020-02-10 19:53:15,397 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1297 transitions. Word has length 22 [2020-02-10 19:53:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:15,397 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1297 transitions. [2020-02-10 19:53:15,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1297 transitions. [2020-02-10 19:53:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:15,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:15,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 19:53:15,398 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 19:53:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:15,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1504467010, now seen corresponding path program 1363 times [2020-02-10 19:53:15,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:15,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451278496] [2020-02-10 19:53:15,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:15,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 19:53:15,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451278496] [2020-02-10 19:53:15,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:15,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:15,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345617173] [2020-02-10 19:53:15,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:15,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:15,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:15,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:15,703 INFO L87 Difference]: Start difference. First operand 378 states and 1297 transitions. Second operand 9 states. [2020-02-10 19:53:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:15,806 INFO L93 Difference]: Finished difference Result 527 states and 1573 transitions. [2020-02-10 19:53:15,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:15,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:15,808 INFO L225 Difference]: With dead ends: 527 [2020-02-10 19:53:15,808 INFO L226 Difference]: Without dead ends: 518 [2020-02-10 19:53:15,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-02-10 19:53:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 380. [2020-02-10 19:53:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-02-10 19:53:15,818 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-02-10 19:53:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:15,818 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-02-10 19:53:15,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-02-10 19:53:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:15,819 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:15,819 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:15,819 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 19:53:15,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:15,819 INFO L82 PathProgramCache]: Analyzing trace with hash 106473948, now seen corresponding path program 1364 times [2020-02-10 19:53:15,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:15,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489234099] [2020-02-10 19:53:15,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:16,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 19:53:16,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489234099] [2020-02-10 19:53:16,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:16,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:16,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555195471] [2020-02-10 19:53:16,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:16,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:16,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:16,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:16,125 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:53:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:16,250 INFO L93 Difference]: Finished difference Result 528 states and 1574 transitions. [2020-02-10 19:53:16,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:16,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:16,252 INFO L225 Difference]: With dead ends: 528 [2020-02-10 19:53:16,252 INFO L226 Difference]: Without dead ends: 517 [2020-02-10 19:53:16,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 19:53:16,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-02-10 19:53:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 379. [2020-02-10 19:53:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:16,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-02-10 19:53:16,262 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-02-10 19:53:16,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:16,262 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-02-10 19:53:16,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:16,262 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-02-10 19:53:16,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:16,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:16,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 19:53:16,263 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 19:53:16,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash -491774478, now seen corresponding path program 1365 times [2020-02-10 19:53:16,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:16,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470103365] [2020-02-10 19:53:16,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:16,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470103365] [2020-02-10 19:53:16,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:16,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:16,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525025774] [2020-02-10 19:53:16,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:16,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:16,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:16,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:16,561 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:53:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:16,654 INFO L93 Difference]: Finished difference Result 528 states and 1575 transitions. [2020-02-10 19:53:16,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:16,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:16,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:16,656 INFO L225 Difference]: With dead ends: 528 [2020-02-10 19:53:16,656 INFO L226 Difference]: Without dead ends: 519 [2020-02-10 19:53:16,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 19:53:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-02-10 19:53:16,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 380. [2020-02-10 19:53:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-02-10 19:53:16,665 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-02-10 19:53:16,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:16,665 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-02-10 19:53:16,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-02-10 19:53:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:16,666 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:16,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 19:53:16,666 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 19:53:16,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:16,666 INFO L82 PathProgramCache]: Analyzing trace with hash 43455324, now seen corresponding path program 1366 times [2020-02-10 19:53:16,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:16,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766671447] [2020-02-10 19:53:16,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:16,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 19:53:16,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766671447] [2020-02-10 19:53:16,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:16,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:16,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417238003] [2020-02-10 19:53:16,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:16,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:16,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:16,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:16,966 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:53:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:17,092 INFO L93 Difference]: Finished difference Result 522 states and 1572 transitions. [2020-02-10 19:53:17,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:17,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:17,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:17,093 INFO L225 Difference]: With dead ends: 522 [2020-02-10 19:53:17,094 INFO L226 Difference]: Without dead ends: 509 [2020-02-10 19:53:17,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 19:53:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2020-02-10 19:53:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 379. [2020-02-10 19:53:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-02-10 19:53:17,103 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-02-10 19:53:17,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:17,103 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-02-10 19:53:17,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-02-10 19:53:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:17,104 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:17,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 19:53:17,104 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 19:53:17,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:17,104 INFO L82 PathProgramCache]: Analyzing trace with hash -481271374, now seen corresponding path program 1367 times [2020-02-10 19:53:17,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:17,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891693920] [2020-02-10 19:53:17,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:17,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891693920] [2020-02-10 19:53:17,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:17,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:17,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297419973] [2020-02-10 19:53:17,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:17,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:17,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:17,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:17,393 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:53:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:17,530 INFO L93 Difference]: Finished difference Result 530 states and 1579 transitions. [2020-02-10 19:53:17,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:17,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:17,532 INFO L225 Difference]: With dead ends: 530 [2020-02-10 19:53:17,532 INFO L226 Difference]: Without dead ends: 520 [2020-02-10 19:53:17,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-02-10 19:53:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 381. [2020-02-10 19:53:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1301 transitions. [2020-02-10 19:53:17,542 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1301 transitions. Word has length 22 [2020-02-10 19:53:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:17,542 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1301 transitions. [2020-02-10 19:53:17,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1301 transitions. [2020-02-10 19:53:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:17,543 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:17,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 19:53:17,543 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 19:53:17,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1556982530, now seen corresponding path program 1368 times [2020-02-10 19:53:17,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:17,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382820550] [2020-02-10 19:53:17,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:17,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382820550] [2020-02-10 19:53:17,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:17,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:17,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188909539] [2020-02-10 19:53:17,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:17,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:17,832 INFO L87 Difference]: Start difference. First operand 381 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:53:17,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:17,946 INFO L93 Difference]: Finished difference Result 523 states and 1573 transitions. [2020-02-10 19:53:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:17,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:17,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:17,948 INFO L225 Difference]: With dead ends: 523 [2020-02-10 19:53:17,948 INFO L226 Difference]: Without dead ends: 507 [2020-02-10 19:53:17,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 19:53:17,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2020-02-10 19:53:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 377. [2020-02-10 19:53:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:53:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1295 transitions. [2020-02-10 19:53:17,957 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1295 transitions. Word has length 22 [2020-02-10 19:53:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:17,957 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1295 transitions. [2020-02-10 19:53:17,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1295 transitions. [2020-02-10 19:53:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:17,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:17,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 19:53:17,958 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 19:53:17,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:17,958 INFO L82 PathProgramCache]: Analyzing trace with hash 321223556, now seen corresponding path program 1369 times [2020-02-10 19:53:17,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:17,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092744833] [2020-02-10 19:53:17,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:18,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 19:53:18,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092744833] [2020-02-10 19:53:18,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:18,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:18,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655780506] [2020-02-10 19:53:18,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:18,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:18,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:18,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:18,233 INFO L87 Difference]: Start difference. First operand 377 states and 1295 transitions. Second operand 9 states. [2020-02-10 19:53:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:18,360 INFO L93 Difference]: Finished difference Result 543 states and 1613 transitions. [2020-02-10 19:53:18,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:18,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:18,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:18,362 INFO L225 Difference]: With dead ends: 543 [2020-02-10 19:53:18,362 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 19:53:18,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 19:53:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 19:53:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 380. [2020-02-10 19:53:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-02-10 19:53:18,372 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-02-10 19:53:18,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:18,372 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-02-10 19:53:18,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-02-10 19:53:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:18,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:18,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:18,373 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 19:53:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1124293454, now seen corresponding path program 1370 times [2020-02-10 19:53:18,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:18,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009883069] [2020-02-10 19:53:18,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53: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 19:53:18,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009883069] [2020-02-10 19:53:18,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:18,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:18,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569311071] [2020-02-10 19:53:18,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:18,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:18,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:18,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:18,670 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-02-10 19:53:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:18,772 INFO L93 Difference]: Finished difference Result 541 states and 1608 transitions. [2020-02-10 19:53:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:18,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:18,774 INFO L225 Difference]: With dead ends: 541 [2020-02-10 19:53:18,775 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:53:18,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 19:53:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:53:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 379. [2020-02-10 19:53:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-02-10 19:53:18,783 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-02-10 19:53:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:18,784 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-02-10 19:53:18,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-02-10 19:53:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:18,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:18,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 19:53:18,784 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 19:53:18,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:18,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1333916088, now seen corresponding path program 1371 times [2020-02-10 19:53:18,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:18,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844295470] [2020-02-10 19:53:18,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:19,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 19:53:19,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844295470] [2020-02-10 19:53:19,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:19,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:19,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908364656] [2020-02-10 19:53:19,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:19,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:19,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:19,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:19,054 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:53:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:19,184 INFO L93 Difference]: Finished difference Result 550 states and 1628 transitions. [2020-02-10 19:53:19,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:19,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:19,186 INFO L225 Difference]: With dead ends: 550 [2020-02-10 19:53:19,186 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 19:53:19,187 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 19:53:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 382. [2020-02-10 19:53:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:53:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-02-10 19:53:19,196 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-02-10 19:53:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:19,196 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-02-10 19:53:19,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-02-10 19:53:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:19,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:19,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 19:53:19,197 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 19:53:19,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:19,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1575016078, now seen corresponding path program 1372 times [2020-02-10 19:53:19,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:19,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930837752] [2020-02-10 19:53:19,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:19,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 19:53:19,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930837752] [2020-02-10 19:53:19,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:19,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:19,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889203537] [2020-02-10 19:53:19,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:19,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:19,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:19,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:19,463 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:53:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:19,598 INFO L93 Difference]: Finished difference Result 553 states and 1631 transitions. [2020-02-10 19:53:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:19,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:19,600 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:53:19,600 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 19:53:19,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 19:53:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 19:53:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 379. [2020-02-10 19:53:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-02-10 19:53:19,610 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-02-10 19:53:19,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:19,610 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-02-10 19:53:19,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-02-10 19:53:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:19,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:19,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 19:53:19,611 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 19:53:19,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:19,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1712038776, now seen corresponding path program 1373 times [2020-02-10 19:53:19,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:19,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102244665] [2020-02-10 19:53:19,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:19,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 19:53:19,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102244665] [2020-02-10 19:53:19,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:19,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:19,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326512260] [2020-02-10 19:53:19,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:19,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:19,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:19,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:19,876 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:53:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:19,962 INFO L93 Difference]: Finished difference Result 544 states and 1613 transitions. [2020-02-10 19:53:19,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:19,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:19,963 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:53:19,964 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:53:19,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:19,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:53:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 380. [2020-02-10 19:53:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-02-10 19:53:19,973 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-02-10 19:53:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:19,973 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-02-10 19:53:19,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:19,973 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-02-10 19:53:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:19,973 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:19,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 19:53:19,974 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 19:53:19,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:19,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1507217364, now seen corresponding path program 1374 times [2020-02-10 19:53:19,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:19,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178303389] [2020-02-10 19:53:19,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:20,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 19:53:20,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178303389] [2020-02-10 19:53:20,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:20,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:20,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720916803] [2020-02-10 19:53:20,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:20,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:20,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:20,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:20,236 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:53:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:20,346 INFO L93 Difference]: Finished difference Result 549 states and 1622 transitions. [2020-02-10 19:53:20,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:20,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:20,348 INFO L225 Difference]: With dead ends: 549 [2020-02-10 19:53:20,348 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:53:20,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 19:53:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:53:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 378. [2020-02-10 19:53:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1298 transitions. [2020-02-10 19:53:20,358 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1298 transitions. Word has length 22 [2020-02-10 19:53:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:20,358 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1298 transitions. [2020-02-10 19:53:20,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1298 transitions. [2020-02-10 19:53:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:20,359 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53: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 19:53:20,359 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 19:53:20,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:20,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2047709662, now seen corresponding path program 1375 times [2020-02-10 19:53:20,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:20,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908170794] [2020-02-10 19:53:20,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53: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 19:53:20,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908170794] [2020-02-10 19:53:20,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:20,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:20,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888528333] [2020-02-10 19:53:20,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:20,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:20,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:20,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:20,638 INFO L87 Difference]: Start difference. First operand 378 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:53:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:20,765 INFO L93 Difference]: Finished difference Result 540 states and 1606 transitions. [2020-02-10 19:53:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:20,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:20,767 INFO L225 Difference]: With dead ends: 540 [2020-02-10 19:53:20,767 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 19:53:20,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 19:53:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 19:53:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 380. [2020-02-10 19:53:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-02-10 19:53:20,776 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-02-10 19:53:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:20,776 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-02-10 19:53:20,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:20,777 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-02-10 19:53:20,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:20,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53: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 19:53:20,777 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 19:53:20,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:20,777 INFO L82 PathProgramCache]: Analyzing trace with hash 801740624, now seen corresponding path program 1376 times [2020-02-10 19:53:20,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:20,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233968985] [2020-02-10 19:53:20,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:21,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 19:53:21,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233968985] [2020-02-10 19:53:21,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:21,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:21,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412464935] [2020-02-10 19:53:21,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:21,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:21,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:21,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:21,055 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:53:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:21,164 INFO L93 Difference]: Finished difference Result 538 states and 1601 transitions. [2020-02-10 19:53:21,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:21,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:21,166 INFO L225 Difference]: With dead ends: 538 [2020-02-10 19:53:21,166 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 19:53:21,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 19:53:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 19:53:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 379. [2020-02-10 19:53:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-02-10 19:53:21,175 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-02-10 19:53:21,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:21,175 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-02-10 19:53:21,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-02-10 19:53:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:21,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:21,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 19:53:21,176 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 19:53:21,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:21,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1659512312, now seen corresponding path program 1377 times [2020-02-10 19:53:21,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:21,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639393572] [2020-02-10 19:53:21,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53: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 19:53:21,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639393572] [2020-02-10 19:53:21,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:21,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:21,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296668025] [2020-02-10 19:53:21,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:21,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:21,460 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:53:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:21,579 INFO L93 Difference]: Finished difference Result 542 states and 1612 transitions. [2020-02-10 19:53:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:21,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:21,581 INFO L225 Difference]: With dead ends: 542 [2020-02-10 19:53:21,581 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:53:21,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:53:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 382. [2020-02-10 19:53:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:53:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1305 transitions. [2020-02-10 19:53:21,591 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1305 transitions. Word has length 22 [2020-02-10 19:53:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:21,591 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1305 transitions. [2020-02-10 19:53:21,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1305 transitions. [2020-02-10 19:53:21,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:21,591 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:21,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 19:53:21,592 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 19:53:21,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:21,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1961530256, now seen corresponding path program 1378 times [2020-02-10 19:53:21,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:21,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925360562] [2020-02-10 19:53:21,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:21,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 19:53:21,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925360562] [2020-02-10 19:53:21,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:21,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:21,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144172887] [2020-02-10 19:53:21,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:21,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:21,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:21,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:21,867 INFO L87 Difference]: Start difference. First operand 382 states and 1305 transitions. Second operand 9 states. [2020-02-10 19:53:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:22,003 INFO L93 Difference]: Finished difference Result 534 states and 1603 transitions. [2020-02-10 19:53:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:22,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:22,005 INFO L225 Difference]: With dead ends: 534 [2020-02-10 19:53:22,005 INFO L226 Difference]: Without dead ends: 519 [2020-02-10 19:53:22,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 19:53:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-02-10 19:53:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 379. [2020-02-10 19:53:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-02-10 19:53:22,015 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-02-10 19:53:22,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:22,015 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-02-10 19:53:22,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-02-10 19:53:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:22,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:22,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 19:53:22,016 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 19:53:22,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:22,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1386442552, now seen corresponding path program 1379 times [2020-02-10 19:53:22,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:22,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237981384] [2020-02-10 19:53:22,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:22,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 19:53:22,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237981384] [2020-02-10 19:53:22,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:22,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:22,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673372164] [2020-02-10 19:53:22,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:22,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:22,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:22,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:22,288 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:53:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:22,388 INFO L93 Difference]: Finished difference Result 538 states and 1601 transitions. [2020-02-10 19:53:22,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:22,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:22,389 INFO L225 Difference]: With dead ends: 538 [2020-02-10 19:53:22,390 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 19:53:22,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 19:53:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 19:53:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 380. [2020-02-10 19:53:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-02-10 19:53:22,399 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-02-10 19:53:22,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:22,400 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-02-10 19:53:22,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-02-10 19:53:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:22,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:22,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 19:53:22,400 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 19:53:22,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:22,401 INFO L82 PathProgramCache]: Analyzing trace with hash -851212750, now seen corresponding path program 1380 times [2020-02-10 19:53:22,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:22,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926763533] [2020-02-10 19:53:22,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:22,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 19:53:22,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926763533] [2020-02-10 19:53:22,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:22,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:22,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538572097] [2020-02-10 19:53:22,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:22,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:22,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:22,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:22,673 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:53:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:22,808 INFO L93 Difference]: Finished difference Result 532 states and 1598 transitions. [2020-02-10 19:53:22,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:22,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:22,810 INFO L225 Difference]: With dead ends: 532 [2020-02-10 19:53:22,810 INFO L226 Difference]: Without dead ends: 518 [2020-02-10 19:53:22,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-02-10 19:53:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 378. [2020-02-10 19:53:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:22,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1297 transitions. [2020-02-10 19:53:22,819 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1297 transitions. Word has length 22 [2020-02-10 19:53:22,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:22,820 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1297 transitions. [2020-02-10 19:53:22,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1297 transitions. [2020-02-10 19:53:22,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:22,820 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:22,820 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:22,820 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 19:53:22,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:22,821 INFO L82 PathProgramCache]: Analyzing trace with hash 293680290, now seen corresponding path program 1381 times [2020-02-10 19:53:22,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:22,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147466952] [2020-02-10 19:53:22,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53: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 19:53:23,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147466952] [2020-02-10 19:53:23,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:23,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:23,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106277177] [2020-02-10 19:53:23,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:23,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:23,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:23,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:23,092 INFO L87 Difference]: Start difference. First operand 378 states and 1297 transitions. Second operand 9 states. [2020-02-10 19:53:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:23,221 INFO L93 Difference]: Finished difference Result 557 states and 1648 transitions. [2020-02-10 19:53:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:23,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:23,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:23,222 INFO L225 Difference]: With dead ends: 557 [2020-02-10 19:53:23,223 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:53:23,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 19:53:23,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:53:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 384. [2020-02-10 19:53:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:53:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1313 transitions. [2020-02-10 19:53:23,232 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1313 transitions. Word has length 22 [2020-02-10 19:53:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:23,233 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1313 transitions. [2020-02-10 19:53:23,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1313 transitions. [2020-02-10 19:53:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:23,233 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:23,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 19:53:23,233 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 19:53:23,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:23,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1679715420, now seen corresponding path program 1382 times [2020-02-10 19:53:23,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:23,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257978801] [2020-02-10 19:53:23,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:23,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 19:53:23,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257978801] [2020-02-10 19:53:23,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:23,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:23,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683668547] [2020-02-10 19:53:23,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:23,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:23,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:23,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:23,504 INFO L87 Difference]: Start difference. First operand 384 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:53:23,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:23,620 INFO L93 Difference]: Finished difference Result 560 states and 1651 transitions. [2020-02-10 19:53:23,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:23,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:23,622 INFO L225 Difference]: With dead ends: 560 [2020-02-10 19:53:23,622 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 19:53:23,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 19:53:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 19:53:23,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 381. [2020-02-10 19:53:23,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1305 transitions. [2020-02-10 19:53:23,632 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1305 transitions. Word has length 22 [2020-02-10 19:53:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:23,632 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1305 transitions. [2020-02-10 19:53:23,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1305 transitions. [2020-02-10 19:53:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:23,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:23,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 19:53:23,633 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 19:53:23,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:23,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1306757564, now seen corresponding path program 1383 times [2020-02-10 19:53:23,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:23,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782435537] [2020-02-10 19:53:23,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:23,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 19:53:23,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782435537] [2020-02-10 19:53:23,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:23,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:23,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377340224] [2020-02-10 19:53:23,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:23,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:23,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:23,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:23,908 INFO L87 Difference]: Start difference. First operand 381 states and 1305 transitions. Second operand 9 states. [2020-02-10 19:53:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:24,046 INFO L93 Difference]: Finished difference Result 552 states and 1636 transitions. [2020-02-10 19:53:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:24,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:24,048 INFO L225 Difference]: With dead ends: 552 [2020-02-10 19:53:24,048 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:53:24,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 19:53:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:53:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 384. [2020-02-10 19:53:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:53:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1310 transitions. [2020-02-10 19:53:24,057 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1310 transitions. Word has length 22 [2020-02-10 19:53:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:24,057 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1310 transitions. [2020-02-10 19:53:24,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1310 transitions. [2020-02-10 19:53:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:24,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:24,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 19:53:24,058 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 19:53:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:24,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1004739620, now seen corresponding path program 1384 times [2020-02-10 19:53:24,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:24,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048012442] [2020-02-10 19:53:24,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:24,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 19:53:24,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048012442] [2020-02-10 19:53:24,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:24,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:24,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078002643] [2020-02-10 19:53:24,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:24,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:24,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:24,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:24,327 INFO L87 Difference]: Start difference. First operand 384 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:53:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:24,456 INFO L93 Difference]: Finished difference Result 544 states and 1627 transitions. [2020-02-10 19:53:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:24,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:24,458 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:53:24,458 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 19:53:24,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 19:53:24,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 381. [2020-02-10 19:53:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-02-10 19:53:24,467 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-02-10 19:53:24,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:24,468 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-02-10 19:53:24,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-02-10 19:53:24,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:24,468 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:24,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 19:53:24,468 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 19:53:24,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:24,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1842630204, now seen corresponding path program 1385 times [2020-02-10 19:53:24,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:24,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670507457] [2020-02-10 19:53:24,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:24,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 19:53:24,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670507457] [2020-02-10 19:53:24,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:24,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:24,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412288206] [2020-02-10 19:53:24,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:24,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:24,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:24,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:24,739 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:53:24,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:24,848 INFO L93 Difference]: Finished difference Result 556 states and 1642 transitions. [2020-02-10 19:53:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:24,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:24,850 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:53:24,850 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 19:53:24,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 19:53:24,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 19:53:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 385. [2020-02-10 19:53:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:53:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1309 transitions. [2020-02-10 19:53:24,861 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1309 transitions. Word has length 22 [2020-02-10 19:53:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:24,861 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1309 transitions. [2020-02-10 19:53:24,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1309 transitions. [2020-02-10 19:53:24,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:24,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:24,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 19:53:24,862 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 19:53:24,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:24,862 INFO L82 PathProgramCache]: Analyzing trace with hash -987323550, now seen corresponding path program 1386 times [2020-02-10 19:53:24,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:24,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663006671] [2020-02-10 19:53:24,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:25,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663006671] [2020-02-10 19:53:25,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:25,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:25,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140629097] [2020-02-10 19:53:25,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:25,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:25,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:25,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:25,128 INFO L87 Difference]: Start difference. First operand 385 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:53:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:25,252 INFO L93 Difference]: Finished difference Result 545 states and 1626 transitions. [2020-02-10 19:53:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:25,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:25,254 INFO L225 Difference]: With dead ends: 545 [2020-02-10 19:53:25,254 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 19:53:25,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 19:53:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 19:53:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 378. [2020-02-10 19:53:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1296 transitions. [2020-02-10 19:53:25,264 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1296 transitions. Word has length 22 [2020-02-10 19:53:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:25,264 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1296 transitions. [2020-02-10 19:53:25,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1296 transitions. [2020-02-10 19:53:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:25,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:25,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 19:53:25,265 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 19:53:25,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash -826240496, now seen corresponding path program 1387 times [2020-02-10 19:53:25,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:25,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032005042] [2020-02-10 19:53:25,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53: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 19:53:25,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032005042] [2020-02-10 19:53:25,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:25,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:25,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430173216] [2020-02-10 19:53:25,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:25,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:25,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:25,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:25,529 INFO L87 Difference]: Start difference. First operand 378 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:53:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:25,626 INFO L93 Difference]: Finished difference Result 545 states and 1615 transitions. [2020-02-10 19:53:25,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:25,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:25,628 INFO L225 Difference]: With dead ends: 545 [2020-02-10 19:53:25,628 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 19:53:25,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 19:53:25,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 380. [2020-02-10 19:53:25,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:25,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-02-10 19:53:25,638 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-02-10 19:53:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:25,638 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-02-10 19:53:25,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:25,639 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-02-10 19:53:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:25,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:25,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 19:53:25,639 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 19:53:25,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:25,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1901951652, now seen corresponding path program 1388 times [2020-02-10 19:53:25,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:25,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513721160] [2020-02-10 19:53:25,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:25,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513721160] [2020-02-10 19:53:25,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:25,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:25,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521687663] [2020-02-10 19:53:25,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:25,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:25,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:25,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:25,896 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:53:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:26,013 INFO L93 Difference]: Finished difference Result 550 states and 1624 transitions. [2020-02-10 19:53:26,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:26,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:26,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:26,015 INFO L225 Difference]: With dead ends: 550 [2020-02-10 19:53:26,015 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:53:26,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:53:26,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 379. [2020-02-10 19:53:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-02-10 19:53:26,025 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-02-10 19:53:26,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:26,025 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-02-10 19:53:26,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-02-10 19:53:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:26,026 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:26,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 19:53:26,026 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 19:53:26,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:26,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1868288946, now seen corresponding path program 1389 times [2020-02-10 19:53:26,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:26,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078431603] [2020-02-10 19:53:26,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:26,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 19:53:26,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078431603] [2020-02-10 19:53:26,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:26,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:26,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799114745] [2020-02-10 19:53:26,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:26,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:26,306 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:53:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:26,418 INFO L93 Difference]: Finished difference Result 542 states and 1609 transitions. [2020-02-10 19:53:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:26,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:26,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:26,419 INFO L225 Difference]: With dead ends: 542 [2020-02-10 19:53:26,420 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:53:26,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:53:26,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 380. [2020-02-10 19:53:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:26,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-02-10 19:53:26,428 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-02-10 19:53:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:26,429 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-02-10 19:53:26,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-02-10 19:53:26,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:26,429 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:26,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 19:53:26,429 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 19:53:26,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:26,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1891448548, now seen corresponding path program 1390 times [2020-02-10 19:53:26,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:26,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787930702] [2020-02-10 19:53:26,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:26,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 19:53:26,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787930702] [2020-02-10 19:53:26,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:26,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:26,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733568726] [2020-02-10 19:53:26,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:26,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:26,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:26,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:26,689 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:53:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:26,812 INFO L93 Difference]: Finished difference Result 536 states and 1606 transitions. [2020-02-10 19:53:26,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:26,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:26,814 INFO L225 Difference]: With dead ends: 536 [2020-02-10 19:53:26,814 INFO L226 Difference]: Without dead ends: 523 [2020-02-10 19:53:26,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 19:53:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-02-10 19:53:26,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 379. [2020-02-10 19:53:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1297 transitions. [2020-02-10 19:53:26,824 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1297 transitions. Word has length 22 [2020-02-10 19:53:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:26,824 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1297 transitions. [2020-02-10 19:53:26,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1297 transitions. [2020-02-10 19:53:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:26,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:26,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 19:53:26,825 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 19:53:26,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:26,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1805270322, now seen corresponding path program 1391 times [2020-02-10 19:53:26,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:26,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098385002] [2020-02-10 19:53:26,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:27,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 19:53:27,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098385002] [2020-02-10 19:53:27,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:27,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:27,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086553423] [2020-02-10 19:53:27,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:27,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:27,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:27,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:27,092 INFO L87 Difference]: Start difference. First operand 379 states and 1297 transitions. Second operand 9 states. [2020-02-10 19:53:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:27,209 INFO L93 Difference]: Finished difference Result 550 states and 1627 transitions. [2020-02-10 19:53:27,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:27,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:27,211 INFO L225 Difference]: With dead ends: 550 [2020-02-10 19:53:27,211 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 19:53:27,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 19:53:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 19:53:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 383. [2020-02-10 19:53:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:53:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1304 transitions. [2020-02-10 19:53:27,221 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1304 transitions. Word has length 22 [2020-02-10 19:53:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:27,221 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1304 transitions. [2020-02-10 19:53:27,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1304 transitions. [2020-02-10 19:53:27,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:27,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:27,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 19:53:27,222 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 19:53:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash -878756016, now seen corresponding path program 1392 times [2020-02-10 19:53:27,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:27,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063364679] [2020-02-10 19:53:27,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:27,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 19:53:27,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063364679] [2020-02-10 19:53:27,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:27,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:27,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080212821] [2020-02-10 19:53:27,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:27,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:27,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:27,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:27,483 INFO L87 Difference]: Start difference. First operand 383 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:53:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:27,609 INFO L93 Difference]: Finished difference Result 539 states and 1611 transitions. [2020-02-10 19:53:27,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:27,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:27,610 INFO L225 Difference]: With dead ends: 539 [2020-02-10 19:53:27,611 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 19:53:27,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 19:53:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 19:53:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 377. [2020-02-10 19:53:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:53:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1294 transitions. [2020-02-10 19:53:27,619 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1294 transitions. Word has length 22 [2020-02-10 19:53:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:27,620 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1294 transitions. [2020-02-10 19:53:27,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1294 transitions. [2020-02-10 19:53:27,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:27,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:27,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 19:53:27,620 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 19:53:27,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:27,621 INFO L82 PathProgramCache]: Analyzing trace with hash 224334054, now seen corresponding path program 1393 times [2020-02-10 19:53:27,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:27,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246542307] [2020-02-10 19:53:27,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:27,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246542307] [2020-02-10 19:53:27,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:27,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:27,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006849817] [2020-02-10 19:53:27,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:27,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:27,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:27,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:27,899 INFO L87 Difference]: Start difference. First operand 377 states and 1294 transitions. Second operand 9 states. [2020-02-10 19:53:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:28,021 INFO L93 Difference]: Finished difference Result 556 states and 1653 transitions. [2020-02-10 19:53:28,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:28,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:28,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:28,023 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:53:28,023 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:53:28,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 19:53:28,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:53:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 383. [2020-02-10 19:53:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:53:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-02-10 19:53:28,033 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-02-10 19:53:28,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:28,033 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-02-10 19:53:28,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-02-10 19:53:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:28,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:28,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 19:53:28,034 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 19:53:28,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:28,034 INFO L82 PathProgramCache]: Analyzing trace with hash 477426806, now seen corresponding path program 1394 times [2020-02-10 19:53:28,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:28,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160818037] [2020-02-10 19:53:28,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:28,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 19:53:28,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160818037] [2020-02-10 19:53:28,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:28,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:28,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284869293] [2020-02-10 19:53:28,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:28,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:28,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:28,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:28,312 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:53:28,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:28,428 INFO L93 Difference]: Finished difference Result 555 states and 1649 transitions. [2020-02-10 19:53:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:28,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:28,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:28,430 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:53:28,430 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 19:53:28,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 19:53:28,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 19:53:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 381. [2020-02-10 19:53:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1308 transitions. [2020-02-10 19:53:28,440 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1308 transitions. Word has length 22 [2020-02-10 19:53:28,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:28,441 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1308 transitions. [2020-02-10 19:53:28,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1308 transitions. [2020-02-10 19:53:28,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:28,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:28,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 19:53:28,441 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 19:53:28,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:28,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1457502856, now seen corresponding path program 1395 times [2020-02-10 19:53:28,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:28,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903385817] [2020-02-10 19:53:28,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:28,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 19:53:28,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903385817] [2020-02-10 19:53:28,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:28,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:28,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61500266] [2020-02-10 19:53:28,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:28,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:28,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:28,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:28,725 INFO L87 Difference]: Start difference. First operand 381 states and 1308 transitions. Second operand 9 states. [2020-02-10 19:53:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:28,842 INFO L93 Difference]: Finished difference Result 561 states and 1662 transitions. [2020-02-10 19:53:28,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:28,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:28,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:28,844 INFO L225 Difference]: With dead ends: 561 [2020-02-10 19:53:28,845 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 19:53:28,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:28,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 19:53:28,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 384. [2020-02-10 19:53:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:53:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1313 transitions. [2020-02-10 19:53:28,854 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1313 transitions. Word has length 22 [2020-02-10 19:53:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:28,854 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1313 transitions. [2020-02-10 19:53:28,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1313 transitions. [2020-02-10 19:53:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:28,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:28,855 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:28,855 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 19:53:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:28,855 INFO L82 PathProgramCache]: Analyzing trace with hash -71467726, now seen corresponding path program 1396 times [2020-02-10 19:53:28,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:28,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125649173] [2020-02-10 19:53:28,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:29,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125649173] [2020-02-10 19:53:29,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:29,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:29,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422575348] [2020-02-10 19:53:29,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:29,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:29,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:29,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:29,123 INFO L87 Difference]: Start difference. First operand 384 states and 1313 transitions. Second operand 9 states. [2020-02-10 19:53:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:29,242 INFO L93 Difference]: Finished difference Result 564 states and 1665 transitions. [2020-02-10 19:53:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:29,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:29,244 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:53:29,244 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:53: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 19:53:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:53:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 381. [2020-02-10 19:53:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-02-10 19:53:29,253 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-02-10 19:53:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:29,253 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-02-10 19:53:29,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-02-10 19:53:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:29,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:29,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 19:53:29,254 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 19:53:29,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:29,254 INFO L82 PathProgramCache]: Analyzing trace with hash -63483050, now seen corresponding path program 1397 times [2020-02-10 19:53:29,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:29,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347713106] [2020-02-10 19:53:29,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:29,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 19:53:29,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347713106] [2020-02-10 19:53:29,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:29,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:29,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103193755] [2020-02-10 19:53:29,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:29,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:29,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:29,521 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:53:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:29,627 INFO L93 Difference]: Finished difference Result 558 states and 1653 transitions. [2020-02-10 19:53:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:29,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:29,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:29,629 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:53:29,629 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:53:29,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 19:53:29,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:53:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 383. [2020-02-10 19:53:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:53:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1309 transitions. [2020-02-10 19:53:29,639 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1309 transitions. Word has length 22 [2020-02-10 19:53:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:29,639 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1309 transitions. [2020-02-10 19:53:29,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:29,639 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1309 transitions. [2020-02-10 19:53:29,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:29,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:29,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 19:53:29,639 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 19:53:29,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:29,640 INFO L82 PathProgramCache]: Analyzing trace with hash -981433240, now seen corresponding path program 1398 times [2020-02-10 19:53:29,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:29,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537452335] [2020-02-10 19:53:29,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:29,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 19:53:29,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537452335] [2020-02-10 19:53:29,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:29,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:29,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521319122] [2020-02-10 19:53:29,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:29,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:29,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:29,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:29,906 INFO L87 Difference]: Start difference. First operand 383 states and 1309 transitions. Second operand 9 states. [2020-02-10 19:53:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:30,023 INFO L93 Difference]: Finished difference Result 562 states and 1659 transitions. [2020-02-10 19:53:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:30,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:30,025 INFO L225 Difference]: With dead ends: 562 [2020-02-10 19:53:30,025 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:53:30,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 19:53:30,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:53:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 379. [2020-02-10 19:53:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-02-10 19:53:30,034 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-02-10 19:53:30,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:30,034 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-02-10 19:53:30,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-02-10 19:53:30,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:30,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:30,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 19:53:30,035 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 19:53:30,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:30,035 INFO L82 PathProgramCache]: Analyzing trace with hash -2144599164, now seen corresponding path program 1399 times [2020-02-10 19:53:30,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:30,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514286055] [2020-02-10 19:53:30,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:30,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 19:53:30,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514286055] [2020-02-10 19:53:30,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:30,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:30,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701798391] [2020-02-10 19:53:30,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:30,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:30,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:30,309 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:53:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:30,437 INFO L93 Difference]: Finished difference Result 552 states and 1642 transitions. [2020-02-10 19:53:30,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:30,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:30,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:30,439 INFO L225 Difference]: With dead ends: 552 [2020-02-10 19:53:30,439 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:53:30,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:30,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:53:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 383. [2020-02-10 19:53:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:53:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-02-10 19:53:30,449 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-02-10 19:53:30,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:30,450 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-02-10 19:53:30,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-02-10 19:53:30,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:30,450 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:30,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 19:53:30,450 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 19:53:30,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:30,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1891506412, now seen corresponding path program 1400 times [2020-02-10 19:53:30,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:30,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270916368] [2020-02-10 19:53:30,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:30,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 19:53:30,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270916368] [2020-02-10 19:53:30,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:30,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:30,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185045834] [2020-02-10 19:53:30,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:30,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:30,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:30,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:30,728 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:53:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:30,849 INFO L93 Difference]: Finished difference Result 551 states and 1638 transitions. [2020-02-10 19:53:30,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:30,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:30,851 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:53:30,851 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 19:53:30,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 19:53:30,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 19:53:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 381. [2020-02-10 19:53:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-02-10 19:53:30,861 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-02-10 19:53:30,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:30,861 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-02-10 19:53:30,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-02-10 19:53:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:30,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:30,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 19:53:30,862 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 19:53:30,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:30,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1131906632, now seen corresponding path program 1401 times [2020-02-10 19:53:30,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:30,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768523010] [2020-02-10 19:53:30,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:31,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 19:53:31,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768523010] [2020-02-10 19:53:31,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:31,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:31,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377305037] [2020-02-10 19:53:31,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:31,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:31,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:31,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:31,150 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:53:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:31,266 INFO L93 Difference]: Finished difference Result 552 states and 1642 transitions. [2020-02-10 19:53:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:31,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:31,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:31,268 INFO L225 Difference]: With dead ends: 552 [2020-02-10 19:53:31,268 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:53:31,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:53:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 384. [2020-02-10 19:53:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:53:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1311 transitions. [2020-02-10 19:53:31,277 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1311 transitions. Word has length 22 [2020-02-10 19:53:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:31,277 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1311 transitions. [2020-02-10 19:53:31,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1311 transitions. [2020-02-10 19:53:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:31,278 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:31,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 19:53:31,278 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 19:53:31,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:31,278 INFO L82 PathProgramCache]: Analyzing trace with hash -829888688, now seen corresponding path program 1402 times [2020-02-10 19:53:31,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:31,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450406696] [2020-02-10 19:53:31,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:31,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 19:53:31,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450406696] [2020-02-10 19:53:31,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:31,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:31,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467743803] [2020-02-10 19:53:31,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:31,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:31,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:31,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:31,554 INFO L87 Difference]: Start difference. First operand 384 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:53:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:31,684 INFO L93 Difference]: Finished difference Result 544 states and 1633 transitions. [2020-02-10 19:53:31,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:31,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:31,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:31,686 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:53:31,686 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 19:53:31,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 19:53:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 19:53:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 381. [2020-02-10 19:53:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1304 transitions. [2020-02-10 19:53:31,696 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1304 transitions. Word has length 22 [2020-02-10 19:53:31,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:31,696 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1304 transitions. [2020-02-10 19:53:31,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:31,696 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1304 transitions. [2020-02-10 19:53:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:31,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:31,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 19:53:31,697 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 19:53:31,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:31,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1873054132, now seen corresponding path program 1403 times [2020-02-10 19:53:31,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:31,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858090694] [2020-02-10 19:53:31,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:31,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 19:53:31,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858090694] [2020-02-10 19:53:31,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:31,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:31,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223856892] [2020-02-10 19:53:31,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:31,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:31,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:31,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:31,969 INFO L87 Difference]: Start difference. First operand 381 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:53:32,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:32,085 INFO L93 Difference]: Finished difference Result 550 states and 1635 transitions. [2020-02-10 19:53:32,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:32,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:32,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:32,087 INFO L225 Difference]: With dead ends: 550 [2020-02-10 19:53:32,087 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 19:53:32,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 19:53:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 19:53:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 383. [2020-02-10 19:53:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:53:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1307 transitions. [2020-02-10 19:53:32,097 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1307 transitions. Word has length 22 [2020-02-10 19:53:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:32,097 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1307 transitions. [2020-02-10 19:53:32,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1307 transitions. [2020-02-10 19:53:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:32,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:32,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 19:53:32,098 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 19:53:32,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:32,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1699806440, now seen corresponding path program 1404 times [2020-02-10 19:53:32,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:32,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311657796] [2020-02-10 19:53:32,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:32,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 19:53:32,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311657796] [2020-02-10 19:53:32,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:32,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:32,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682583343] [2020-02-10 19:53:32,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:32,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:32,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:32,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:32,365 INFO L87 Difference]: Start difference. First operand 383 states and 1307 transitions. Second operand 9 states. [2020-02-10 19:53:32,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:32,494 INFO L93 Difference]: Finished difference Result 543 states and 1629 transitions. [2020-02-10 19:53:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:32,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:32,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:32,495 INFO L225 Difference]: With dead ends: 543 [2020-02-10 19:53:32,496 INFO L226 Difference]: Without dead ends: 527 [2020-02-10 19:53:32,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 19:53:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-02-10 19:53:32,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 379. [2020-02-10 19:53:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-02-10 19:53:32,504 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-02-10 19:53:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:32,504 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-02-10 19:53:32,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-02-10 19:53:32,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:32,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:32,505 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:32,505 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 19:53:32,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:32,505 INFO L82 PathProgramCache]: Analyzing trace with hash -128805436, now seen corresponding path program 1405 times [2020-02-10 19:53:32,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:32,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070708816] [2020-02-10 19:53:32,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:32,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 19:53:32,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070708816] [2020-02-10 19:53:32,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:32,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:32,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30707881] [2020-02-10 19:53:32,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:32,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:32,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:32,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:32,771 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:53:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:32,901 INFO L93 Difference]: Finished difference Result 564 states and 1669 transitions. [2020-02-10 19:53:32,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:32,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:32,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:32,903 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:53:32,903 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:53:32,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 19:53:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:53:32,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 385. [2020-02-10 19:53:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:53:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1315 transitions. [2020-02-10 19:53:32,913 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1315 transitions. Word has length 22 [2020-02-10 19:53:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:32,913 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1315 transitions. [2020-02-10 19:53:32,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:32,913 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1315 transitions. [2020-02-10 19:53:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:32,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:32,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 19:53:32,914 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 19:53:32,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:32,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1257229694, now seen corresponding path program 1406 times [2020-02-10 19:53:32,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:32,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697311093] [2020-02-10 19:53:32,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:33,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 19:53:33,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697311093] [2020-02-10 19:53:33,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:33,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:33,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830112429] [2020-02-10 19:53:33,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:33,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:33,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:33,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:33,181 INFO L87 Difference]: Start difference. First operand 385 states and 1315 transitions. Second operand 9 states. [2020-02-10 19:53:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:33,300 INFO L93 Difference]: Finished difference Result 567 states and 1672 transitions. [2020-02-10 19:53:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:33,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:33,302 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:53:33,302 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 19:53:33,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 19:53:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 19:53:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 382. [2020-02-10 19:53:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:53:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1307 transitions. [2020-02-10 19:53:33,310 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1307 transitions. Word has length 22 [2020-02-10 19:53:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:33,311 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1307 transitions. [2020-02-10 19:53:33,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1307 transitions. [2020-02-10 19:53:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:33,311 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:33,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:33,311 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 19:53:33,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1729243290, now seen corresponding path program 1407 times [2020-02-10 19:53:33,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:33,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628218299] [2020-02-10 19:53:33,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:33,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628218299] [2020-02-10 19:53:33,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:33,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:33,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169121280] [2020-02-10 19:53:33,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:33,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:33,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:33,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:33,579 INFO L87 Difference]: Start difference. First operand 382 states and 1307 transitions. Second operand 9 states. [2020-02-10 19:53:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:33,704 INFO L93 Difference]: Finished difference Result 559 states and 1657 transitions. [2020-02-10 19:53:33,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:33,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:33,706 INFO L225 Difference]: With dead ends: 559 [2020-02-10 19:53:33,706 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:53:33,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 19:53:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:53:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 385. [2020-02-10 19:53:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:53:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1312 transitions. [2020-02-10 19:53:33,716 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1312 transitions. Word has length 22 [2020-02-10 19:53:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:33,716 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1312 transitions. [2020-02-10 19:53:33,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1312 transitions. [2020-02-10 19:53:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:33,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:33,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 19:53:33,717 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 19:53:33,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:33,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1427225346, now seen corresponding path program 1408 times [2020-02-10 19:53:33,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:33,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266236351] [2020-02-10 19:53:33,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:33,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 19:53:33,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266236351] [2020-02-10 19:53:33,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:33,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:33,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718405056] [2020-02-10 19:53:33,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:33,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:33,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:33,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:33,988 INFO L87 Difference]: Start difference. First operand 385 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:53:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:34,108 INFO L93 Difference]: Finished difference Result 551 states and 1648 transitions. [2020-02-10 19:53:34,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:34,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:34,110 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:53:34,110 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 19:53:34,110 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 19:53:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 382. [2020-02-10 19:53:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:53:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-02-10 19:53:34,119 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-02-10 19:53:34,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:34,119 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-02-10 19:53:34,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-02-10 19:53:34,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:34,120 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:34,120 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:34,120 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 19:53:34,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:34,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2029851366, now seen corresponding path program 1409 times [2020-02-10 19:53:34,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:34,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791104650] [2020-02-10 19:53:34,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:34,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791104650] [2020-02-10 19:53:34,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:34,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:34,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395253511] [2020-02-10 19:53:34,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:34,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:34,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:34,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:34,384 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:53:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:34,501 INFO L93 Difference]: Finished difference Result 563 states and 1663 transitions. [2020-02-10 19:53:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:34,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:34,503 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:53:34,503 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 19:53:34,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 19:53:34,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 19:53:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 386. [2020-02-10 19:53:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-02-10 19:53:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1311 transitions. [2020-02-10 19:53:34,513 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1311 transitions. Word has length 22 [2020-02-10 19:53:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:34,513 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1311 transitions. [2020-02-10 19:53:34,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1311 transitions. [2020-02-10 19:53:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:34,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:34,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 19:53:34,514 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 19:53:34,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:34,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1409809276, now seen corresponding path program 1410 times [2020-02-10 19:53:34,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:34,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024340607] [2020-02-10 19:53:34,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:34,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 19:53:34,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024340607] [2020-02-10 19:53:34,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:34,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:34,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548629592] [2020-02-10 19:53:34,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:34,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:34,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:34,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:34,785 INFO L87 Difference]: Start difference. First operand 386 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:53:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:34,902 INFO L93 Difference]: Finished difference Result 552 states and 1647 transitions. [2020-02-10 19:53:34,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:34,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:34,904 INFO L225 Difference]: With dead ends: 552 [2020-02-10 19:53:34,904 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:53:34,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 19:53:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:53:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 379. [2020-02-10 19:53:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1297 transitions. [2020-02-10 19:53:34,913 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1297 transitions. Word has length 22 [2020-02-10 19:53:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:34,913 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1297 transitions. [2020-02-10 19:53:34,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1297 transitions. [2020-02-10 19:53:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:34,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:34,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 19:53:34,914 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 19:53:34,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:34,914 INFO L82 PathProgramCache]: Analyzing trace with hash 673776822, now seen corresponding path program 1411 times [2020-02-10 19:53:34,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:34,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247191308] [2020-02-10 19:53:34,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:35,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247191308] [2020-02-10 19:53:35,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:35,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:35,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362279391] [2020-02-10 19:53:35,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:35,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:35,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:35,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:35,158 INFO L87 Difference]: Start difference. First operand 379 states and 1297 transitions. Second operand 9 states. [2020-02-10 19:53:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:35,263 INFO L93 Difference]: Finished difference Result 558 states and 1651 transitions. [2020-02-10 19:53:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:35,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:35,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:35,265 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:53:35,265 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:53:35,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 19:53:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:53:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 383. [2020-02-10 19:53:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:53:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1307 transitions. [2020-02-10 19:53:35,275 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1307 transitions. Word has length 22 [2020-02-10 19:53:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:35,275 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1307 transitions. [2020-02-10 19:53:35,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1307 transitions. [2020-02-10 19:53:35,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:35,275 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:35,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 19:53:35,276 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 19:53:35,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:35,276 INFO L82 PathProgramCache]: Analyzing trace with hash -244173368, now seen corresponding path program 1412 times [2020-02-10 19:53:35,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:35,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370887428] [2020-02-10 19:53:35,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:35,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 19:53:35,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370887428] [2020-02-10 19:53:35,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:35,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:35,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149528686] [2020-02-10 19:53:35,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:35,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:35,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:35,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:35,517 INFO L87 Difference]: Start difference. First operand 383 states and 1307 transitions. Second operand 9 states. [2020-02-10 19:53:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:35,639 INFO L93 Difference]: Finished difference Result 562 states and 1657 transitions. [2020-02-10 19:53:35,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:35,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:35,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:35,641 INFO L225 Difference]: With dead ends: 562 [2020-02-10 19:53:35,641 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:53:35,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 19:53:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:53:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 381. [2020-02-10 19:53:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-02-10 19:53:35,650 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-02-10 19:53:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:35,650 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-02-10 19:53:35,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-02-10 19:53:35,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:35,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:35,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 19:53:35,651 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 19:53:35,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:35,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2010249516, now seen corresponding path program 1413 times [2020-02-10 19:53:35,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:35,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552162268] [2020-02-10 19:53:35,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:35,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552162268] [2020-02-10 19:53:35,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:35,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:35,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14391285] [2020-02-10 19:53:35,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:35,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:35,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:35,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:35,899 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:53:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:36,011 INFO L93 Difference]: Finished difference Result 554 states and 1642 transitions. [2020-02-10 19:53:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:36,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:36,013 INFO L225 Difference]: With dead ends: 554 [2020-02-10 19:53:36,013 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:53:36,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:36,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:53:36,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 383. [2020-02-10 19:53:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:53:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1305 transitions. [2020-02-10 19:53:36,022 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1305 transitions. Word has length 22 [2020-02-10 19:53:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:36,022 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1305 transitions. [2020-02-10 19:53:36,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1305 transitions. [2020-02-10 19:53:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:36,022 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:36,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 19:53:36,023 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 19:53:36,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:36,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2111470088, now seen corresponding path program 1414 times [2020-02-10 19:53:36,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:36,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224018128] [2020-02-10 19:53:36,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:36,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 19:53:36,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224018128] [2020-02-10 19:53:36,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:36,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:36,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133103671] [2020-02-10 19:53:36,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:36,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:36,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:36,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:36,284 INFO L87 Difference]: Start difference. First operand 383 states and 1305 transitions. Second operand 9 states. [2020-02-10 19:53:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:36,394 INFO L93 Difference]: Finished difference Result 547 states and 1636 transitions. [2020-02-10 19:53:36,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:36,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:36,396 INFO L225 Difference]: With dead ends: 547 [2020-02-10 19:53:36,396 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:53:36,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 19:53:36,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:53:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 381. [2020-02-10 19:53:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1300 transitions. [2020-02-10 19:53:36,405 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1300 transitions. Word has length 22 [2020-02-10 19:53:36,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:36,405 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1300 transitions. [2020-02-10 19:53:36,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1300 transitions. [2020-02-10 19:53:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:36,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:36,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 19:53:36,406 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 19:53:36,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:36,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1319884524, now seen corresponding path program 1415 times [2020-02-10 19:53:36,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:36,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111616739] [2020-02-10 19:53:36,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:36,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 19:53:36,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111616739] [2020-02-10 19:53:36,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:36,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:36,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555090021] [2020-02-10 19:53:36,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:36,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:36,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:36,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:36,655 INFO L87 Difference]: Start difference. First operand 381 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:53:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:36,775 INFO L93 Difference]: Finished difference Result 560 states and 1654 transitions. [2020-02-10 19:53:36,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:36,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:36,777 INFO L225 Difference]: With dead ends: 560 [2020-02-10 19:53:36,777 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:53: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 19:53:36,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:53:36,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 385. [2020-02-10 19:53:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:53:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1307 transitions. [2020-02-10 19:53:36,787 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1307 transitions. Word has length 22 [2020-02-10 19:53:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:36,787 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1307 transitions. [2020-02-10 19:53:36,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1307 transitions. [2020-02-10 19:53:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:36,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:36,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 19:53:36,787 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 19:53:36,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash -575182026, now seen corresponding path program 1416 times [2020-02-10 19:53:36,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:36,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478732773] [2020-02-10 19:53:36,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:37,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478732773] [2020-02-10 19:53:37,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:37,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:37,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713058080] [2020-02-10 19:53:37,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:37,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:37,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:37,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:37,037 INFO L87 Difference]: Start difference. First operand 385 states and 1307 transitions. Second operand 9 states. [2020-02-10 19:53:37,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:37,172 INFO L93 Difference]: Finished difference Result 549 states and 1638 transitions. [2020-02-10 19:53:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:37,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:37,174 INFO L225 Difference]: With dead ends: 549 [2020-02-10 19:53:37,174 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 19:53:37,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 19:53:37,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 377. [2020-02-10 19:53:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:53:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1293 transitions. [2020-02-10 19:53:37,184 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1293 transitions. Word has length 22 [2020-02-10 19:53:37,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:37,184 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1293 transitions. [2020-02-10 19:53:37,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1293 transitions. [2020-02-10 19:53:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:37,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:37,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 19:53:37,185 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 19:53:37,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:37,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1318072458, now seen corresponding path program 1417 times [2020-02-10 19:53:37,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:37,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396165329] [2020-02-10 19:53:37,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53: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 19:53:37,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396165329] [2020-02-10 19:53:37,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:37,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:37,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134014718] [2020-02-10 19:53:37,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:37,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:37,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:37,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:37,466 INFO L87 Difference]: Start difference. First operand 377 states and 1293 transitions. Second operand 9 states. [2020-02-10 19:53:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:37,566 INFO L93 Difference]: Finished difference Result 534 states and 1588 transitions. [2020-02-10 19:53:37,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:37,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:37,568 INFO L225 Difference]: With dead ends: 534 [2020-02-10 19:53:37,568 INFO L226 Difference]: Without dead ends: 525 [2020-02-10 19:53:37,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-02-10 19:53:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 380. [2020-02-10 19:53:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-02-10 19:53:37,578 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-02-10 19:53:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:37,578 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-02-10 19:53:37,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-02-10 19:53:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:37,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:37,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 19:53:37,579 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 19:53:37,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:37,579 INFO L82 PathProgramCache]: Analyzing trace with hash 292868500, now seen corresponding path program 1418 times [2020-02-10 19:53:37,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:37,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332461054] [2020-02-10 19:53:37,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:37,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 19:53:37,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332461054] [2020-02-10 19:53:37,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:37,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:37,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375789249] [2020-02-10 19:53:37,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:37,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:37,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:37,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:37,858 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:53:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:37,966 INFO L93 Difference]: Finished difference Result 535 states and 1589 transitions. [2020-02-10 19:53:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:37,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:37,968 INFO L225 Difference]: With dead ends: 535 [2020-02-10 19:53:37,968 INFO L226 Difference]: Without dead ends: 524 [2020-02-10 19:53:37,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 19:53:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-02-10 19:53:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 379. [2020-02-10 19:53:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-02-10 19:53:37,978 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-02-10 19:53:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:37,978 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-02-10 19:53:37,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-02-10 19:53:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:37,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:37,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 19:53:37,979 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 19:53:37,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:37,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1295057928, now seen corresponding path program 1419 times [2020-02-10 19:53:37,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:37,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95438295] [2020-02-10 19:53:37,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:38,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 19:53:38,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95438295] [2020-02-10 19:53:38,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:38,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:38,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534701092] [2020-02-10 19:53:38,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:38,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:38,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:38,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:38,249 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:53:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:38,338 INFO L93 Difference]: Finished difference Result 538 states and 1595 transitions. [2020-02-10 19:53:38,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:38,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:38,340 INFO L225 Difference]: With dead ends: 538 [2020-02-10 19:53:38,340 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 19:53:38,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 19:53:38,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 19:53:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 380. [2020-02-10 19:53:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-02-10 19:53:38,350 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-02-10 19:53:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:38,351 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-02-10 19:53:38,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-02-10 19:53:38,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:38,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:38,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 19:53:38,351 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 19:53:38,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:38,352 INFO L82 PathProgramCache]: Analyzing trace with hash 219346772, now seen corresponding path program 1420 times [2020-02-10 19:53:38,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:38,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290598737] [2020-02-10 19:53:38,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:38,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 19:53:38,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290598737] [2020-02-10 19:53:38,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:38,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:38,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845234758] [2020-02-10 19:53:38,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:38,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:38,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:38,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:38,613 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:53:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:38,741 INFO L93 Difference]: Finished difference Result 543 states and 1604 transitions. [2020-02-10 19:53:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:38,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:38,743 INFO L225 Difference]: With dead ends: 543 [2020-02-10 19:53:38,743 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 19:53:38,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 19:53:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 19:53:38,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 379. [2020-02-10 19:53:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-02-10 19:53:38,752 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-02-10 19:53:38,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:38,752 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-02-10 19:53:38,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-02-10 19:53:38,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:38,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:38,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 19:53:38,753 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 19:53:38,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:38,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1305561032, now seen corresponding path program 1421 times [2020-02-10 19:53:38,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:38,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604783867] [2020-02-10 19:53:38,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:39,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 19:53:39,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604783867] [2020-02-10 19:53:39,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:39,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:39,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101488951] [2020-02-10 19:53:39,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:39,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:39,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:39,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:39,019 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:53:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:39,141 INFO L93 Difference]: Finished difference Result 541 states and 1601 transitions. [2020-02-10 19:53:39,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:39,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:39,143 INFO L225 Difference]: With dead ends: 541 [2020-02-10 19:53:39,143 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:53:39,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 19:53:39,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:53:39,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 381. [2020-02-10 19:53:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1301 transitions. [2020-02-10 19:53:39,156 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1301 transitions. Word has length 22 [2020-02-10 19:53:39,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:39,156 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1301 transitions. [2020-02-10 19:53:39,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1301 transitions. [2020-02-10 19:53:39,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:39,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:39,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 19:53:39,157 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 19:53:39,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:39,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1381091082, now seen corresponding path program 1422 times [2020-02-10 19:53:39,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:39,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401195705] [2020-02-10 19:53:39,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:39,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 19:53:39,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401195705] [2020-02-10 19:53:39,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:39,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:39,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726111869] [2020-02-10 19:53:39,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:39,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:39,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:39,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:39,441 INFO L87 Difference]: Start difference. First operand 381 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:53:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:39,565 INFO L93 Difference]: Finished difference Result 545 states and 1607 transitions. [2020-02-10 19:53:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:39,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:39,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:39,566 INFO L225 Difference]: With dead ends: 545 [2020-02-10 19:53:39,567 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 19:53:39,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 19:53:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 19:53:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 378. [2020-02-10 19:53:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1296 transitions. [2020-02-10 19:53:39,575 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1296 transitions. Word has length 22 [2020-02-10 19:53:39,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:39,575 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1296 transitions. [2020-02-10 19:53:39,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1296 transitions. [2020-02-10 19:53:39,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:39,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:39,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 19:53:39,576 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 19:53:39,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:39,576 INFO L82 PathProgramCache]: Analyzing trace with hash 607961620, now seen corresponding path program 1423 times [2020-02-10 19:53:39,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:39,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962333274] [2020-02-10 19:53:39,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:39,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 19:53:39,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962333274] [2020-02-10 19:53:39,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:39,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:39,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395933989] [2020-02-10 19:53:39,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:39,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:39,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:39,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:39,862 INFO L87 Difference]: Start difference. First operand 378 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:53:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:39,965 INFO L93 Difference]: Finished difference Result 531 states and 1581 transitions. [2020-02-10 19:53:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:39,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:39,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:39,967 INFO L225 Difference]: With dead ends: 531 [2020-02-10 19:53:39,967 INFO L226 Difference]: Without dead ends: 522 [2020-02-10 19:53:39,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-02-10 19:53:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 380. [2020-02-10 19:53:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-02-10 19:53:39,976 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-02-10 19:53:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:39,976 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-02-10 19:53:39,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-02-10 19:53:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:39,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:39,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 19:53:39,977 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 19:53:39,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:39,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2076064718, now seen corresponding path program 1424 times [2020-02-10 19:53:39,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:39,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917783864] [2020-02-10 19:53:39,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:40,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:40,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917783864] [2020-02-10 19:53:40,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:40,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:40,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623641170] [2020-02-10 19:53:40,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:40,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:40,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:40,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:40,261 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:53:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:40,375 INFO L93 Difference]: Finished difference Result 532 states and 1582 transitions. [2020-02-10 19:53:40,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:40,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:40,377 INFO L225 Difference]: With dead ends: 532 [2020-02-10 19:53:40,377 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 19:53:40,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 19:53:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 19:53:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 379. [2020-02-10 19:53:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-02-10 19:53:40,387 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-02-10 19:53:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:40,387 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-02-10 19:53:40,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-02-10 19:53:40,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:40,388 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:40,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 19:53:40,388 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 19:53:40,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:40,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1620654152, now seen corresponding path program 1425 times [2020-02-10 19:53:40,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:40,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347019154] [2020-02-10 19:53:40,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:40,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 19:53:40,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347019154] [2020-02-10 19:53:40,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:40,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:40,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167735817] [2020-02-10 19:53:40,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:40,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:40,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:40,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:40,665 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:53:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:40,756 INFO L93 Difference]: Finished difference Result 532 states and 1583 transitions. [2020-02-10 19:53:40,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:40,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:40,758 INFO L225 Difference]: With dead ends: 532 [2020-02-10 19:53:40,758 INFO L226 Difference]: Without dead ends: 523 [2020-02-10 19:53:40,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 19:53:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-02-10 19:53:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 380. [2020-02-10 19:53:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-02-10 19:53:40,768 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-02-10 19:53:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:40,768 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-02-10 19:53:40,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-02-10 19:53:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:40,768 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:40,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 19:53:40,768 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 19:53:40,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:40,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2139083342, now seen corresponding path program 1426 times [2020-02-10 19:53:40,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:40,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500488074] [2020-02-10 19:53:40,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:41,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 19:53:41,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500488074] [2020-02-10 19:53:41,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:41,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:41,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513360742] [2020-02-10 19:53:41,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:41,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:41,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:41,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:41,047 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:53:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:41,174 INFO L93 Difference]: Finished difference Result 526 states and 1580 transitions. [2020-02-10 19:53:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:41,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:41,176 INFO L225 Difference]: With dead ends: 526 [2020-02-10 19:53:41,176 INFO L226 Difference]: Without dead ends: 513 [2020-02-10 19:53:41,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:41,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-02-10 19:53:41,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 379. [2020-02-10 19:53:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1297 transitions. [2020-02-10 19:53:41,186 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1297 transitions. Word has length 22 [2020-02-10 19:53:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:41,186 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1297 transitions. [2020-02-10 19:53:41,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1297 transitions. [2020-02-10 19:53:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:41,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:41,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 19:53:41,187 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 19:53:41,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:41,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1631157256, now seen corresponding path program 1427 times [2020-02-10 19:53:41,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:41,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194972693] [2020-02-10 19:53:41,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:41,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 19:53:41,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194972693] [2020-02-10 19:53:41,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:41,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:41,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81671157] [2020-02-10 19:53:41,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:41,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:41,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:41,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:41,468 INFO L87 Difference]: Start difference. First operand 379 states and 1297 transitions. Second operand 9 states. [2020-02-10 19:53:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:41,583 INFO L93 Difference]: Finished difference Result 534 states and 1587 transitions. [2020-02-10 19:53:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:41,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:41,585 INFO L225 Difference]: With dead ends: 534 [2020-02-10 19:53:41,585 INFO L226 Difference]: Without dead ends: 524 [2020-02-10 19:53:41,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 19:53:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-02-10 19:53:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 381. [2020-02-10 19:53:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1300 transitions. [2020-02-10 19:53:41,595 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1300 transitions. Word has length 22 [2020-02-10 19:53:41,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:41,595 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1300 transitions. [2020-02-10 19:53:41,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1300 transitions. [2020-02-10 19:53:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:41,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:41,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 19:53:41,596 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 19:53:41,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:41,596 INFO L82 PathProgramCache]: Analyzing trace with hash 555446100, now seen corresponding path program 1428 times [2020-02-10 19:53:41,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:41,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501614148] [2020-02-10 19:53:41,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:41,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:41,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501614148] [2020-02-10 19:53:41,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:41,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:41,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194382523] [2020-02-10 19:53:41,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:41,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:41,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:41,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:41,874 INFO L87 Difference]: Start difference. First operand 381 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:53:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:42,000 INFO L93 Difference]: Finished difference Result 527 states and 1581 transitions. [2020-02-10 19:53:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:42,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:42,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:42,002 INFO L225 Difference]: With dead ends: 527 [2020-02-10 19:53:42,002 INFO L226 Difference]: Without dead ends: 512 [2020-02-10 19:53:42,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 19:53:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2020-02-10 19:53:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 378. [2020-02-10 19:53:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1295 transitions. [2020-02-10 19:53:42,012 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1295 transitions. Word has length 22 [2020-02-10 19:53:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:42,012 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1295 transitions. [2020-02-10 19:53:42,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1295 transitions. [2020-02-10 19:53:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:42,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:42,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 19:53:42,013 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 19:53:42,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:42,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1671211948, now seen corresponding path program 1429 times [2020-02-10 19:53:42,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:42,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405569570] [2020-02-10 19:53:42,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:42,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 19:53:42,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405569570] [2020-02-10 19:53:42,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:42,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:42,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536823556] [2020-02-10 19:53:42,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:42,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:42,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:42,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:42,275 INFO L87 Difference]: Start difference. First operand 378 states and 1295 transitions. Second operand 9 states. [2020-02-10 19:53:42,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:42,368 INFO L93 Difference]: Finished difference Result 541 states and 1602 transitions. [2020-02-10 19:53:42,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:42,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:42,370 INFO L225 Difference]: With dead ends: 541 [2020-02-10 19:53:42,370 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 19:53:42,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 19:53:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 19:53:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 380. [2020-02-10 19:53:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-02-10 19:53:42,379 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-02-10 19:53:42,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:42,379 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-02-10 19:53:42,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-02-10 19:53:42,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:42,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:42,380 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:42,380 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 19:53:42,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:42,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1548044192, now seen corresponding path program 1430 times [2020-02-10 19:53:42,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:42,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431294631] [2020-02-10 19:53:42,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:42,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 19:53:42,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431294631] [2020-02-10 19:53:42,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:42,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:42,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577124162] [2020-02-10 19:53:42,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:42,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:42,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:42,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:42,639 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:53:42,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:42,757 INFO L93 Difference]: Finished difference Result 546 states and 1611 transitions. [2020-02-10 19:53:42,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:42,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:42,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:42,759 INFO L225 Difference]: With dead ends: 546 [2020-02-10 19:53:42,759 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:53:42,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 19:53:42,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:53:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 379. [2020-02-10 19:53:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1297 transitions. [2020-02-10 19:53:42,768 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1297 transitions. Word has length 22 [2020-02-10 19:53:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:42,769 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1297 transitions. [2020-02-10 19:53:42,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1297 transitions. [2020-02-10 19:53:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:42,769 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:42,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 19:53:42,769 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 19:53:42,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:42,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1023317494, now seen corresponding path program 1431 times [2020-02-10 19:53:42,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:42,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379360019] [2020-02-10 19:53:42,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:43,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 19:53:43,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379360019] [2020-02-10 19:53:43,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:43,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:43,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967333758] [2020-02-10 19:53:43,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:43,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:43,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:43,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:43,037 INFO L87 Difference]: Start difference. First operand 379 states and 1297 transitions. Second operand 9 states. [2020-02-10 19:53:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:43,126 INFO L93 Difference]: Finished difference Result 538 states and 1596 transitions. [2020-02-10 19:53:43,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:43,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:43,127 INFO L225 Difference]: With dead ends: 538 [2020-02-10 19:53:43,128 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 19:53:43,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 19:53:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 19:53:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 380. [2020-02-10 19:53:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1298 transitions. [2020-02-10 19:53:43,137 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1298 transitions. Word has length 22 [2020-02-10 19:53:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:43,137 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1298 transitions. [2020-02-10 19:53:43,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1298 transitions. [2020-02-10 19:53:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:43,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:43,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 19:53:43,138 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 19:53:43,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:43,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1558547296, now seen corresponding path program 1432 times [2020-02-10 19:53:43,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:43,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413281196] [2020-02-10 19:53:43,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:43,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413281196] [2020-02-10 19:53:43,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:43,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:43,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943318987] [2020-02-10 19:53:43,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:43,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:43,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:43,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:43,400 INFO L87 Difference]: Start difference. First operand 380 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:53:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:43,519 INFO L93 Difference]: Finished difference Result 532 states and 1593 transitions. [2020-02-10 19:53:43,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:43,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:43,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:43,521 INFO L225 Difference]: With dead ends: 532 [2020-02-10 19:53:43,521 INFO L226 Difference]: Without dead ends: 519 [2020-02-10 19:53:43,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 19:53:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-02-10 19:53:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 379. [2020-02-10 19:53:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-02-10 19:53:43,531 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-02-10 19:53:43,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:43,531 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-02-10 19:53:43,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:43,531 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-02-10 19:53:43,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:43,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:43,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 19:53:43,532 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 19:53:43,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:43,532 INFO L82 PathProgramCache]: Analyzing trace with hash 960298870, now seen corresponding path program 1433 times [2020-02-10 19:53:43,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:43,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343925420] [2020-02-10 19:53:43,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53: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 19:53:43,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343925420] [2020-02-10 19:53:43,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:43,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:43,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318834210] [2020-02-10 19:53:43,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:43,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:43,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:43,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:43,795 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:53:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:43,909 INFO L93 Difference]: Finished difference Result 546 states and 1614 transitions. [2020-02-10 19:53:43,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:43,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:43,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:43,911 INFO L225 Difference]: With dead ends: 546 [2020-02-10 19:53:43,911 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 19:53:43,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 19:53:43,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 19:53:43,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 383. [2020-02-10 19:53:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:53:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1303 transitions. [2020-02-10 19:53:43,926 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1303 transitions. Word has length 22 [2020-02-10 19:53:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:43,926 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1303 transitions. [2020-02-10 19:53:43,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1303 transitions. [2020-02-10 19:53:43,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:43,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:43,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:43,927 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 19:53:43,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:43,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1723727468, now seen corresponding path program 1434 times [2020-02-10 19:53:43,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:43,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632838159] [2020-02-10 19:53:43,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:44,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 19:53:44,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632838159] [2020-02-10 19:53:44,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:44,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:44,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864647467] [2020-02-10 19:53:44,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:44,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:44,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:44,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:44,195 INFO L87 Difference]: Start difference. First operand 383 states and 1303 transitions. Second operand 9 states. [2020-02-10 19:53:44,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:44,318 INFO L93 Difference]: Finished difference Result 535 states and 1598 transitions. [2020-02-10 19:53:44,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:44,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:44,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:44,319 INFO L225 Difference]: With dead ends: 535 [2020-02-10 19:53:44,320 INFO L226 Difference]: Without dead ends: 518 [2020-02-10 19:53:44,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-02-10 19:53:44,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 378. [2020-02-10 19:53:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:44,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1294 transitions. [2020-02-10 19:53:44,328 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1294 transitions. Word has length 22 [2020-02-10 19:53:44,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:44,329 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1294 transitions. [2020-02-10 19:53:44,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:44,329 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1294 transitions. [2020-02-10 19:53:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:44,329 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:44,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 19:53:44,329 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 19:53:44,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:44,330 INFO L82 PathProgramCache]: Analyzing trace with hash 265325234, now seen corresponding path program 1435 times [2020-02-10 19:53:44,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:44,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71061940] [2020-02-10 19:53:44,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:44,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 19:53:44,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71061940] [2020-02-10 19:53:44,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:44,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:44,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075444646] [2020-02-10 19:53:44,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:44,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:44,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:44,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:44,574 INFO L87 Difference]: Start difference. First operand 378 states and 1294 transitions. Second operand 9 states. [2020-02-10 19:53:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:44,701 INFO L93 Difference]: Finished difference Result 547 states and 1617 transitions. [2020-02-10 19:53:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:44,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:44,703 INFO L225 Difference]: With dead ends: 547 [2020-02-10 19:53:44,703 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:53:44,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:53:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 382. [2020-02-10 19:53:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:53:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-02-10 19:53:44,713 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-02-10 19:53:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:44,713 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-02-10 19:53:44,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-02-10 19:53:44,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:44,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:44,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 19:53:44,714 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 19:53:44,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:44,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1873640416, now seen corresponding path program 1436 times [2020-02-10 19:53:44,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:44,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467850826] [2020-02-10 19:53:44,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:44,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 19:53:44,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467850826] [2020-02-10 19:53:44,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:44,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:44,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23113318] [2020-02-10 19:53:44,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:44,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:44,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:44,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:44,957 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:53:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:45,074 INFO L93 Difference]: Finished difference Result 551 states and 1623 transitions. [2020-02-10 19:53:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:45,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:45,076 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:53:45,076 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:53:45,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:53:45,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 380. [2020-02-10 19:53:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:45,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-02-10 19:53:45,086 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-02-10 19:53:45,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:45,086 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-02-10 19:53:45,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-02-10 19:53:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:45,087 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:45,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 19:53:45,087 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 19:53:45,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:45,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1335112620, now seen corresponding path program 1437 times [2020-02-10 19:53:45,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:45,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285334311] [2020-02-10 19:53:45,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:45,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 19:53:45,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285334311] [2020-02-10 19:53:45,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:45,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:45,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449137869] [2020-02-10 19:53:45,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:45,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:45,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:45,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:45,339 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:53:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:45,466 INFO L93 Difference]: Finished difference Result 543 states and 1608 transitions. [2020-02-10 19:53:45,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:45,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:45,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:45,467 INFO L225 Difference]: With dead ends: 543 [2020-02-10 19:53:45,468 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:53:45,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:53:45,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 382. [2020-02-10 19:53:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:53:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1302 transitions. [2020-02-10 19:53:45,476 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1302 transitions. Word has length 22 [2020-02-10 19:53:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:45,477 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1302 transitions. [2020-02-10 19:53:45,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1302 transitions. [2020-02-10 19:53:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:45,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:45,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 19:53:45,477 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 19:53:45,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:45,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1884143520, now seen corresponding path program 1438 times [2020-02-10 19:53:45,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:45,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153480314] [2020-02-10 19:53:45,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:45,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 19:53:45,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153480314] [2020-02-10 19:53:45,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:45,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:45,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830354091] [2020-02-10 19:53:45,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:45,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:45,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:45,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:45,739 INFO L87 Difference]: Start difference. First operand 382 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:53:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:45,860 INFO L93 Difference]: Finished difference Result 536 states and 1602 transitions. [2020-02-10 19:53:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:45,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:45,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:45,862 INFO L225 Difference]: With dead ends: 536 [2020-02-10 19:53:45,862 INFO L226 Difference]: Without dead ends: 522 [2020-02-10 19:53:45,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 19:53:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-02-10 19:53:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 380. [2020-02-10 19:53:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1297 transitions. [2020-02-10 19:53:45,872 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1297 transitions. Word has length 22 [2020-02-10 19:53:45,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:45,872 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1297 transitions. [2020-02-10 19:53:45,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1297 transitions. [2020-02-10 19:53:45,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:45,873 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:45,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 19:53:45,873 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 19:53:45,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:45,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1408634348, now seen corresponding path program 1439 times [2020-02-10 19:53:45,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:45,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314361670] [2020-02-10 19:53:45,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:46,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 19:53:46,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314361670] [2020-02-10 19:53:46,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:46,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:46,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823558805] [2020-02-10 19:53:46,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:46,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:46,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:46,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:46,123 INFO L87 Difference]: Start difference. First operand 380 states and 1297 transitions. Second operand 9 states. [2020-02-10 19:53:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:46,242 INFO L93 Difference]: Finished difference Result 549 states and 1620 transitions. [2020-02-10 19:53:46,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:46,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:46,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:46,244 INFO L225 Difference]: With dead ends: 549 [2020-02-10 19:53:46,244 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:53:46,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:46,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:53:46,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 384. [2020-02-10 19:53:46,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:53:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1304 transitions. [2020-02-10 19:53:46,254 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1304 transitions. Word has length 22 [2020-02-10 19:53:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:46,254 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1304 transitions. [2020-02-10 19:53:46,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1304 transitions. [2020-02-10 19:53:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:46,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:46,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 19:53:46,255 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 19:53:46,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:46,255 INFO L82 PathProgramCache]: Analyzing trace with hash 202306610, now seen corresponding path program 1440 times [2020-02-10 19:53:46,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:46,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561609776] [2020-02-10 19:53:46,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:46,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561609776] [2020-02-10 19:53:46,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:46,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:46,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151604642] [2020-02-10 19:53:46,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:46,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:46,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:46,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:46,507 INFO L87 Difference]: Start difference. First operand 384 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:53:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:46,634 INFO L93 Difference]: Finished difference Result 538 states and 1604 transitions. [2020-02-10 19:53:46,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:46,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:46,636 INFO L225 Difference]: With dead ends: 538 [2020-02-10 19:53:46,636 INFO L226 Difference]: Without dead ends: 515 [2020-02-10 19:53:46,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:46,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2020-02-10 19:53:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 373. [2020-02-10 19:53:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:53:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1286 transitions. [2020-02-10 19:53:46,645 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1286 transitions. Word has length 22 [2020-02-10 19:53:46,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:46,645 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1286 transitions. [2020-02-10 19:53:46,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1286 transitions. [2020-02-10 19:53:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:46,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:46,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 19:53:46,646 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 19:53:46,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:46,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1828499748, now seen corresponding path program 1441 times [2020-02-10 19:53:46,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:46,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429752395] [2020-02-10 19:53:46,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:46,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 19:53:46,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429752395] [2020-02-10 19:53:46,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:46,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:46,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357124158] [2020-02-10 19:53:46,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:46,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:46,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:46,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:46,950 INFO L87 Difference]: Start difference. First operand 373 states and 1286 transitions. Second operand 9 states. [2020-02-10 19:53:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:47,058 INFO L93 Difference]: Finished difference Result 578 states and 1693 transitions. [2020-02-10 19:53:47,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:47,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:47,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:47,060 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:53:47,060 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:53:47,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 19:53:47,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:53:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 381. [2020-02-10 19:53:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-02-10 19:53:47,070 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-02-10 19:53:47,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:47,070 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-02-10 19:53:47,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-02-10 19:53:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:47,071 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:47,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 19:53:47,071 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 19:53:47,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:47,071 INFO L82 PathProgramCache]: Analyzing trace with hash -876201662, now seen corresponding path program 1442 times [2020-02-10 19:53:47,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:47,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110387792] [2020-02-10 19:53:47,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:47,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 19:53:47,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110387792] [2020-02-10 19:53:47,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:47,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:47,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807068586] [2020-02-10 19:53:47,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:47,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:47,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:47,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:47,369 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:53:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:47,487 INFO L93 Difference]: Finished difference Result 573 states and 1680 transitions. [2020-02-10 19:53:47,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:47,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:47,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:47,489 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:53:47,489 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:53:47,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 19:53:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:53:47,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 377. [2020-02-10 19:53:47,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:53:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1298 transitions. [2020-02-10 19:53:47,499 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1298 transitions. Word has length 22 [2020-02-10 19:53:47,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:47,499 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1298 transitions. [2020-02-10 19:53:47,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1298 transitions. [2020-02-10 19:53:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:47,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:47,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 19:53:47,500 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 19:53:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:47,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1113917228, now seen corresponding path program 1443 times [2020-02-10 19:53:47,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:47,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286246129] [2020-02-10 19:53:47,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:47,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 19:53:47,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286246129] [2020-02-10 19:53:47,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:47,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:47,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410732025] [2020-02-10 19:53:47,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:47,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:47,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:47,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:47,802 INFO L87 Difference]: Start difference. First operand 377 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:53:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:47,894 INFO L93 Difference]: Finished difference Result 574 states and 1681 transitions. [2020-02-10 19:53:47,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:47,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:47,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:47,895 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:53:47,896 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:53:47,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 19:53:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:53:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 379. [2020-02-10 19:53:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-02-10 19:53:47,905 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-02-10 19:53:47,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:47,905 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-02-10 19:53:47,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-02-10 19:53:47,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:47,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:47,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:47,906 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 19:53:47,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:47,906 INFO L82 PathProgramCache]: Analyzing trace with hash -552848736, now seen corresponding path program 1444 times [2020-02-10 19:53:47,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:47,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009086695] [2020-02-10 19:53:47,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:48,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009086695] [2020-02-10 19:53:48,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:48,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:48,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201735545] [2020-02-10 19:53:48,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:48,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:48,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:48,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:48,206 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:53:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:48,314 INFO L93 Difference]: Finished difference Result 567 states and 1666 transitions. [2020-02-10 19:53:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:48,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:48,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:48,316 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:53:48,316 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:53:48,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:53:48,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 377. [2020-02-10 19:53:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:53:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1296 transitions. [2020-02-10 19:53:48,326 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1296 transitions. Word has length 22 [2020-02-10 19:53:48,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:48,327 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1296 transitions. [2020-02-10 19:53:48,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1296 transitions. [2020-02-10 19:53:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:48,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:48,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 19:53:48,327 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 19:53:48,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:48,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1986759862, now seen corresponding path program 1445 times [2020-02-10 19:53:48,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:48,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446054056] [2020-02-10 19:53:48,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:48,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 19:53:48,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446054056] [2020-02-10 19:53:48,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:48,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:48,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355041217] [2020-02-10 19:53:48,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:48,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:48,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:48,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:48,630 INFO L87 Difference]: Start difference. First operand 377 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:53:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:48,740 INFO L93 Difference]: Finished difference Result 563 states and 1659 transitions. [2020-02-10 19:53:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:48,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:48,742 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:53:48,742 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:53:48,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 19:53:48,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:53:48,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 378. [2020-02-10 19:53:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1297 transitions. [2020-02-10 19:53:48,751 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1297 transitions. Word has length 22 [2020-02-10 19:53:48,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:48,752 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1297 transitions. [2020-02-10 19:53:48,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1297 transitions. [2020-02-10 19:53:48,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:48,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:48,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 19:53:48,752 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 19:53:48,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:48,753 INFO L82 PathProgramCache]: Analyzing trace with hash 541242852, now seen corresponding path program 1446 times [2020-02-10 19:53:48,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:48,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495636012] [2020-02-10 19:53:48,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:49,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 19:53:49,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495636012] [2020-02-10 19:53:49,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:49,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:49,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253062041] [2020-02-10 19:53:49,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:49,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:49,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:49,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:49,059 INFO L87 Difference]: Start difference. First operand 378 states and 1297 transitions. Second operand 9 states. [2020-02-10 19:53:49,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:49,171 INFO L93 Difference]: Finished difference Result 561 states and 1654 transitions. [2020-02-10 19:53:49,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:49,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:49,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:49,173 INFO L225 Difference]: With dead ends: 561 [2020-02-10 19:53:49,173 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 19:53:49,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 19:53:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 375. [2020-02-10 19:53:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:53:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1292 transitions. [2020-02-10 19:53:49,183 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1292 transitions. Word has length 22 [2020-02-10 19:53:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:49,183 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1292 transitions. [2020-02-10 19:53:49,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1292 transitions. [2020-02-10 19:53:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:49,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:49,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 19:53:49,184 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 19:53:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:49,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1406014022, now seen corresponding path program 1447 times [2020-02-10 19:53:49,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:49,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915323855] [2020-02-10 19:53:49,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:49,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 19:53:49,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915323855] [2020-02-10 19:53:49,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:49,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:49,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693742012] [2020-02-10 19:53:49,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:49,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:49,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:49,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:49,494 INFO L87 Difference]: Start difference. First operand 375 states and 1292 transitions. Second operand 9 states. [2020-02-10 19:53:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:49,610 INFO L93 Difference]: Finished difference Result 582 states and 1703 transitions. [2020-02-10 19:53:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:49,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:49,612 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:53:49,612 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:53:49,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 19:53:49,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:53:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 382. [2020-02-10 19:53:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:53:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1308 transitions. [2020-02-10 19:53:49,622 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1308 transitions. Word has length 22 [2020-02-10 19:53:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:49,622 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1308 transitions. [2020-02-10 19:53:49,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1308 transitions. [2020-02-10 19:53:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:49,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:49,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:49,623 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 19:53:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1298687388, now seen corresponding path program 1448 times [2020-02-10 19:53:49,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:49,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691019064] [2020-02-10 19:53:49,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:49,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 19:53:49,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691019064] [2020-02-10 19:53:49,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:49,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:49,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450842829] [2020-02-10 19:53:49,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:49,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:49,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:49,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:49,921 INFO L87 Difference]: Start difference. First operand 382 states and 1308 transitions. Second operand 9 states. [2020-02-10 19:53:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:50,062 INFO L93 Difference]: Finished difference Result 577 states and 1690 transitions. [2020-02-10 19:53:50,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:50,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:50,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:50,064 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:53:50,064 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:53:50,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 19:53:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:53:50,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 378. [2020-02-10 19:53:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1299 transitions. [2020-02-10 19:53:50,074 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1299 transitions. Word has length 22 [2020-02-10 19:53:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:50,074 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1299 transitions. [2020-02-10 19:53:50,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1299 transitions. [2020-02-10 19:53:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:50,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:50,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:50,075 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 19:53:50,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:50,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1506926194, now seen corresponding path program 1449 times [2020-02-10 19:53:50,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:50,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337566692] [2020-02-10 19:53:50,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:50,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 19:53:50,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337566692] [2020-02-10 19:53:50,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:50,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:50,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8192462] [2020-02-10 19:53:50,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:50,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:50,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:50,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:50,376 INFO L87 Difference]: Start difference. First operand 378 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:53:50,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:50,495 INFO L93 Difference]: Finished difference Result 580 states and 1695 transitions. [2020-02-10 19:53:50,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:50,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:50,496 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:53:50,497 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:53:50,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 19:53:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:53:50,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 381. [2020-02-10 19:53:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1303 transitions. [2020-02-10 19:53:50,507 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1303 transitions. Word has length 22 [2020-02-10 19:53:50,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:50,507 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1303 transitions. [2020-02-10 19:53:50,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1303 transitions. [2020-02-10 19:53:50,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:50,507 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:50,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 19:53:50,507 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 19:53:50,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:50,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1633562568, now seen corresponding path program 1450 times [2020-02-10 19:53:50,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:50,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41784024] [2020-02-10 19:53:50,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:50,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 19:53:50,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41784024] [2020-02-10 19:53:50,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:50,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:50,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015033147] [2020-02-10 19:53:50,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:50,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:50,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:50,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:50,795 INFO L87 Difference]: Start difference. First operand 381 states and 1303 transitions. Second operand 9 states. [2020-02-10 19:53:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:50,924 INFO L93 Difference]: Finished difference Result 574 states and 1681 transitions. [2020-02-10 19:53:50,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:50,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:50,926 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:53:50,926 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:53:50,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 19:53:50,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:53:50,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 378. [2020-02-10 19:53:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1296 transitions. [2020-02-10 19:53:50,936 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1296 transitions. Word has length 22 [2020-02-10 19:53:50,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:50,936 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1296 transitions. [2020-02-10 19:53:50,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1296 transitions. [2020-02-10 19:53:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:50,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:50,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 19:53:50,937 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 19:53:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:50,937 INFO L82 PathProgramCache]: Analyzing trace with hash -781455600, now seen corresponding path program 1451 times [2020-02-10 19:53:50,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:50,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290136392] [2020-02-10 19:53:50,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:51,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 19:53:51,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290136392] [2020-02-10 19:53:51,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:51,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:51,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322574306] [2020-02-10 19:53:51,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:51,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:51,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:51,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:51,239 INFO L87 Difference]: Start difference. First operand 378 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:53:51,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:51,358 INFO L93 Difference]: Finished difference Result 569 states and 1672 transitions. [2020-02-10 19:53:51,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:51,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:51,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:51,360 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:53:51,360 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:53:51,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 19:53:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:53:51,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-02-10 19:53:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-02-10 19:53:51,370 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-02-10 19:53:51,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:51,370 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-02-10 19:53:51,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:51,371 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-02-10 19:53:51,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:51,371 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:51,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 19:53:51,371 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 19:53:51,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:51,371 INFO L82 PathProgramCache]: Analyzing trace with hash 560477188, now seen corresponding path program 1452 times [2020-02-10 19:53:51,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:51,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373320255] [2020-02-10 19:53:51,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53: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 19:53:51,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373320255] [2020-02-10 19:53:51,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:51,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:51,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476858099] [2020-02-10 19:53:51,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:51,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:51,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:51,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:51,670 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:53:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:51,817 INFO L93 Difference]: Finished difference Result 568 states and 1668 transitions. [2020-02-10 19:53:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:51,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:51,819 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:53:51,819 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:53:51,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:51,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:53:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 375. [2020-02-10 19:53:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:53:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1290 transitions. [2020-02-10 19:53:51,828 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1290 transitions. Word has length 22 [2020-02-10 19:53:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:51,829 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1290 transitions. [2020-02-10 19:53:51,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1290 transitions. [2020-02-10 19:53:51,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:51,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:51,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 19:53:51,830 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 19:53:51,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:51,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1132505132, now seen corresponding path program 1453 times [2020-02-10 19:53:51,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:51,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787751503] [2020-02-10 19:53:51,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:52,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 19:53:52,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787751503] [2020-02-10 19:53:52,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:52,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:52,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272624362] [2020-02-10 19:53:52,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:52,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:52,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:52,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:52,155 INFO L87 Difference]: Start difference. First operand 375 states and 1290 transitions. Second operand 9 states. [2020-02-10 19:53:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:52,265 INFO L93 Difference]: Finished difference Result 572 states and 1674 transitions. [2020-02-10 19:53:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:52,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:52,267 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:53:52,267 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:53:52,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 19:53:52,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:53:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 379. [2020-02-10 19:53:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-02-10 19:53:52,276 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-02-10 19:53:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:52,276 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-02-10 19:53:52,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-02-10 19:53:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:52,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:52,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 19:53:52,277 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 19:53:52,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:52,277 INFO L82 PathProgramCache]: Analyzing trace with hash -571436640, now seen corresponding path program 1454 times [2020-02-10 19:53:52,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:52,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825985532] [2020-02-10 19:53:52,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:52,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:52,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825985532] [2020-02-10 19:53:52,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:52,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:52,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181624487] [2020-02-10 19:53:52,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:52,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:52,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:52,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:52,583 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:53:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:52,701 INFO L93 Difference]: Finished difference Result 565 states and 1659 transitions. [2020-02-10 19:53:52,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:52,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:52,703 INFO L225 Difference]: With dead ends: 565 [2020-02-10 19:53:52,703 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:53:52,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:52,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:53:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 377. [2020-02-10 19:53:52,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:53:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1294 transitions. [2020-02-10 19:53:52,712 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1294 transitions. Word has length 22 [2020-02-10 19:53:52,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:52,712 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1294 transitions. [2020-02-10 19:53:52,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1294 transitions. [2020-02-10 19:53:52,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:52,713 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:52,713 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:52,713 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 19:53:52,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:52,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1562024310, now seen corresponding path program 1455 times [2020-02-10 19:53:52,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:52,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308807737] [2020-02-10 19:53:52,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:53,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308807737] [2020-02-10 19:53:53,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:53,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:53,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951104371] [2020-02-10 19:53:53,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:53,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:53,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:53,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:53,005 INFO L87 Difference]: Start difference. First operand 377 states and 1294 transitions. Second operand 9 states. [2020-02-10 19:53:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:53,122 INFO L93 Difference]: Finished difference Result 574 states and 1677 transitions. [2020-02-10 19:53:53,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:53,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:53,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:53,123 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:53:53,124 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:53:53,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 19:53:53,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:53:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-02-10 19:53:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:53:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1298 transitions. [2020-02-10 19:53:53,133 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1298 transitions. Word has length 22 [2020-02-10 19:53:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:53,134 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1298 transitions. [2020-02-10 19:53:53,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:53,134 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1298 transitions. [2020-02-10 19:53:53,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:53,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:53,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 19:53:53,134 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 19:53:53,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:53,135 INFO L82 PathProgramCache]: Analyzing trace with hash 599820648, now seen corresponding path program 1456 times [2020-02-10 19:53:53,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:53,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876986066] [2020-02-10 19:53:53,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:53,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 19:53:53,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876986066] [2020-02-10 19:53:53,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:53,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:53,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384707399] [2020-02-10 19:53:53,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:53,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:53,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:53,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:53,433 INFO L87 Difference]: Start difference. First operand 380 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:53:53,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:53,573 INFO L93 Difference]: Finished difference Result 568 states and 1663 transitions. [2020-02-10 19:53:53,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:53,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:53,574 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:53:53,575 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 19:53:53,575 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 19:53:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 377. [2020-02-10 19:53:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:53:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1292 transitions. [2020-02-10 19:53:53,584 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1292 transitions. Word has length 22 [2020-02-10 19:53:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:53,584 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1292 transitions. [2020-02-10 19:53:53,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1292 transitions. [2020-02-10 19:53:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:53,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:53,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 19:53:53,585 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 19:53:53,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:53,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1616746536, now seen corresponding path program 1457 times [2020-02-10 19:53:53,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:53,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858746424] [2020-02-10 19:53:53,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:53,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 19:53:53,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858746424] [2020-02-10 19:53:53,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:53,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:53,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381498192] [2020-02-10 19:53:53,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:53,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:53,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:53,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:53,901 INFO L87 Difference]: Start difference. First operand 377 states and 1292 transitions. Second operand 9 states. [2020-02-10 19:53:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:53,998 INFO L93 Difference]: Finished difference Result 558 states and 1644 transitions. [2020-02-10 19:53:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:53,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:54,000 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:53:54,000 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 19:53:54,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 19:53:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 19:53:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 378. [2020-02-10 19:53:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1293 transitions. [2020-02-10 19:53:54,010 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1293 transitions. Word has length 22 [2020-02-10 19:53:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:54,010 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1293 transitions. [2020-02-10 19:53:54,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1293 transitions. [2020-02-10 19:53:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:54,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:54,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 19:53:54,011 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 19:53:54,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:54,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1067279802, now seen corresponding path program 1458 times [2020-02-10 19:53:54,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:54,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358018034] [2020-02-10 19:53:54,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:54,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 19:53:54,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358018034] [2020-02-10 19:53:54,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:54,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:54,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790762757] [2020-02-10 19:53:54,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:54,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:54,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:54,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:54,322 INFO L87 Difference]: Start difference. First operand 378 states and 1293 transitions. Second operand 9 states. [2020-02-10 19:53:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:54,454 INFO L93 Difference]: Finished difference Result 559 states and 1645 transitions. [2020-02-10 19:53:54,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:54,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:54,456 INFO L225 Difference]: With dead ends: 559 [2020-02-10 19:53:54,456 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:53:54,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 19:53:54,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:53:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 375. [2020-02-10 19:53:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:53:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1288 transitions. [2020-02-10 19:53:54,465 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1288 transitions. Word has length 22 [2020-02-10 19:53:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:54,465 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1288 transitions. [2020-02-10 19:53:54,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1288 transitions. [2020-02-10 19:53:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:54,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:54,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 19:53:54,466 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 19:53:54,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:54,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1525272818, now seen corresponding path program 1459 times [2020-02-10 19:53:54,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:54,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448183927] [2020-02-10 19:53:54,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:54,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 19:53:54,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448183927] [2020-02-10 19:53:54,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:54,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:54,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422495893] [2020-02-10 19:53:54,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:54,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:54,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:54,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:54,778 INFO L87 Difference]: Start difference. First operand 375 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:53:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:54,929 INFO L93 Difference]: Finished difference Result 553 states and 1636 transitions. [2020-02-10 19:53:54,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:54,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:54,931 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:53:54,931 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 19:53:54,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 19:53:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 19:53:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 377. [2020-02-10 19:53:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:53:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1292 transitions. [2020-02-10 19:53:54,940 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1292 transitions. Word has length 22 [2020-02-10 19:53:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:54,941 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1292 transitions. [2020-02-10 19:53:54,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1292 transitions. [2020-02-10 19:53:54,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:54,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:54,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 19:53:54,941 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 19:53:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:54,942 INFO L82 PathProgramCache]: Analyzing trace with hash 79755808, now seen corresponding path program 1460 times [2020-02-10 19:53:54,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:54,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339383925] [2020-02-10 19:53:54,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:55,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 19:53:55,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339383925] [2020-02-10 19:53:55,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:55,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:55,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942856478] [2020-02-10 19:53:55,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:55,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:55,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:55,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:55,257 INFO L87 Difference]: Start difference. First operand 377 states and 1292 transitions. Second operand 9 states. [2020-02-10 19:53:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:55,378 INFO L93 Difference]: Finished difference Result 551 states and 1631 transitions. [2020-02-10 19:53:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:55,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:55,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:55,380 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:53:55,380 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:53:55,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:53:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 376. [2020-02-10 19:53:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:53:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1290 transitions. [2020-02-10 19:53:55,391 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1290 transitions. Word has length 22 [2020-02-10 19:53:55,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:55,391 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1290 transitions. [2020-02-10 19:53:55,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1290 transitions. [2020-02-10 19:53:55,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:55,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:55,391 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:55,392 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 19:53:55,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:55,392 INFO L82 PathProgramCache]: Analyzing trace with hash -75165036, now seen corresponding path program 1461 times [2020-02-10 19:53:55,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:55,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752545593] [2020-02-10 19:53:55,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:55,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 19:53:55,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752545593] [2020-02-10 19:53:55,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:55,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:55,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386408094] [2020-02-10 19:53:55,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:55,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:55,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:55,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:55,702 INFO L87 Difference]: Start difference. First operand 376 states and 1290 transitions. Second operand 9 states. [2020-02-10 19:53:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:55,828 INFO L93 Difference]: Finished difference Result 555 states and 1640 transitions. [2020-02-10 19:53:55,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:55,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:55,830 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:53:55,830 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:53:55,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 19:53:55,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:53:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 378. [2020-02-10 19:53:55,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1293 transitions. [2020-02-10 19:53:55,839 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1293 transitions. Word has length 22 [2020-02-10 19:53:55,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:55,839 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1293 transitions. [2020-02-10 19:53:55,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:55,839 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1293 transitions. [2020-02-10 19:53:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:55,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:55,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 19:53:55,840 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 19:53:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:55,840 INFO L82 PathProgramCache]: Analyzing trace with hash 177927716, now seen corresponding path program 1462 times [2020-02-10 19:53:55,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:55,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116398401] [2020-02-10 19:53:55,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53: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 19:53:56,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116398401] [2020-02-10 19:53:56,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:56,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:56,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903468928] [2020-02-10 19:53:56,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:56,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:56,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:56,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:56,154 INFO L87 Difference]: Start difference. First operand 378 states and 1293 transitions. Second operand 9 states. [2020-02-10 19:53:56,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:56,301 INFO L93 Difference]: Finished difference Result 554 states and 1636 transitions. [2020-02-10 19:53:56,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:56,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:56,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:56,303 INFO L225 Difference]: With dead ends: 554 [2020-02-10 19:53:56,303 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 19:53:56,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 19:53:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 19:53:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 376. [2020-02-10 19:53:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:53:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1289 transitions. [2020-02-10 19:53:56,312 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1289 transitions. Word has length 22 [2020-02-10 19:53:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:56,312 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1289 transitions. [2020-02-10 19:53:56,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1289 transitions. [2020-02-10 19:53:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:56,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:56,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 19:53:56,313 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 19:53:56,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:56,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1173847396, now seen corresponding path program 1463 times [2020-02-10 19:53:56,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:56,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593188199] [2020-02-10 19:53:56,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:56,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 19:53:56,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593188199] [2020-02-10 19:53:56,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:56,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:56,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052581653] [2020-02-10 19:53:56,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:56,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:56,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:56,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:56,629 INFO L87 Difference]: Start difference. First operand 376 states and 1289 transitions. Second operand 9 states. [2020-02-10 19:53:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:56,745 INFO L93 Difference]: Finished difference Result 550 states and 1628 transitions. [2020-02-10 19:53:56,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:56,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:56,747 INFO L225 Difference]: With dead ends: 550 [2020-02-10 19:53:56,747 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:53:56,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 19:53:56,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:53:56,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 377. [2020-02-10 19:53:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:53:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-02-10 19:53:56,756 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-02-10 19:53:56,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:56,757 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-02-10 19:53:56,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:56,757 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-02-10 19:53:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:56,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:56,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 19:53:56,757 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 19:53:56,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:56,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1510178942, now seen corresponding path program 1464 times [2020-02-10 19:53:56,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:56,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583825457] [2020-02-10 19:53:56,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:57,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 19:53:57,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583825457] [2020-02-10 19:53:57,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:57,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:57,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941313368] [2020-02-10 19:53:57,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:57,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:57,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:57,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:57,072 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-02-10 19:53:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:57,193 INFO L93 Difference]: Finished difference Result 551 states and 1629 transitions. [2020-02-10 19:53:57,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:57,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:57,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:57,195 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:53:57,195 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:53:57,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 19:53:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:53:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 373. [2020-02-10 19:53:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:53:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1284 transitions. [2020-02-10 19:53:57,206 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1284 transitions. Word has length 22 [2020-02-10 19:53:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:57,206 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1284 transitions. [2020-02-10 19:53:57,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1284 transitions. [2020-02-10 19:53:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:57,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:57,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 19:53:57,207 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 19:53:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1193533840, now seen corresponding path program 1465 times [2020-02-10 19:53:57,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:57,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585219634] [2020-02-10 19:53:57,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:57,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 19:53:57,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585219634] [2020-02-10 19:53:57,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:57,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:57,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689000918] [2020-02-10 19:53:57,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:57,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:57,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:57,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:57,517 INFO L87 Difference]: Start difference. First operand 373 states and 1284 transitions. Second operand 9 states. [2020-02-10 19:53:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:57,633 INFO L93 Difference]: Finished difference Result 584 states and 1708 transitions. [2020-02-10 19:53:57,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:57,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:57,635 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:53:57,635 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:53:57,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 19:53:57,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:53:57,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 381. [2020-02-10 19:53:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:53:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1304 transitions. [2020-02-10 19:53:57,645 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1304 transitions. Word has length 22 [2020-02-10 19:53:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:57,645 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1304 transitions. [2020-02-10 19:53:57,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1304 transitions. [2020-02-10 19:53:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:57,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:57,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 19:53:57,646 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 19:53:57,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:57,646 INFO L82 PathProgramCache]: Analyzing trace with hash 396732046, now seen corresponding path program 1466 times [2020-02-10 19:53:57,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:57,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791974157] [2020-02-10 19:53:57,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:57,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 19:53:57,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791974157] [2020-02-10 19:53:57,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:57,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:57,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135156734] [2020-02-10 19:53:57,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:57,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:57,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:57,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:57,953 INFO L87 Difference]: Start difference. First operand 381 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:53:58,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:58,093 INFO L93 Difference]: Finished difference Result 579 states and 1695 transitions. [2020-02-10 19:53:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:58,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:58,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:58,095 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:53:58,095 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:53:58,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 19:53:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:53:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 377. [2020-02-10 19:53:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:53:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1296 transitions. [2020-02-10 19:53:58,104 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1296 transitions. Word has length 22 [2020-02-10 19:53:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:58,104 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1296 transitions. [2020-02-10 19:53:58,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:58,104 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1296 transitions. [2020-02-10 19:53:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:58,104 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:58,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 19:53:58,105 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 19:53:58,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:58,105 INFO L82 PathProgramCache]: Analyzing trace with hash 159016480, now seen corresponding path program 1467 times [2020-02-10 19:53:58,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:58,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932992883] [2020-02-10 19:53:58,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:58,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 19:53:58,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932992883] [2020-02-10 19:53:58,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:58,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:58,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662669071] [2020-02-10 19:53:58,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:58,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:58,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:58,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:58,409 INFO L87 Difference]: Start difference. First operand 377 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:53:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:58,521 INFO L93 Difference]: Finished difference Result 580 states and 1696 transitions. [2020-02-10 19:53:58,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:58,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:58,523 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:53:58,523 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:53:58,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 19:53:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:53:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 379. [2020-02-10 19:53:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:53:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-02-10 19:53:58,532 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-02-10 19:53:58,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:58,532 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-02-10 19:53:58,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:58,532 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-02-10 19:53:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:58,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:58,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 19:53:58,533 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 19:53:58,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:58,533 INFO L82 PathProgramCache]: Analyzing trace with hash 720084972, now seen corresponding path program 1468 times [2020-02-10 19:53:58,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:58,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811665594] [2020-02-10 19:53:58,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:58,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811665594] [2020-02-10 19:53:58,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:58,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:58,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116086915] [2020-02-10 19:53:58,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:58,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:58,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:58,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:58,827 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:53:58,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:58,926 INFO L93 Difference]: Finished difference Result 573 states and 1681 transitions. [2020-02-10 19:53:58,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:58,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:58,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:58,928 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:53:58,928 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:53:58,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:53:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 377. [2020-02-10 19:53:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:53:58,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1294 transitions. [2020-02-10 19:53:58,938 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1294 transitions. Word has length 22 [2020-02-10 19:53:58,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:58,938 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1294 transitions. [2020-02-10 19:53:58,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1294 transitions. [2020-02-10 19:53:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:58,938 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:58,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 19:53:58,939 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 19:53:58,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:58,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1035273726, now seen corresponding path program 1469 times [2020-02-10 19:53:58,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:58,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319306967] [2020-02-10 19:53:58,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:59,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 19:53:59,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319306967] [2020-02-10 19:53:59,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:59,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:59,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145392800] [2020-02-10 19:53:59,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:59,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:59,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:59,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:59,230 INFO L87 Difference]: Start difference. First operand 377 states and 1294 transitions. Second operand 9 states. [2020-02-10 19:53:59,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:59,373 INFO L93 Difference]: Finished difference Result 569 states and 1674 transitions. [2020-02-10 19:53:59,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:59,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:59,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:59,375 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:53:59,376 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:53:59,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 19:53:59,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:53:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 378. [2020-02-10 19:53:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:53:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1295 transitions. [2020-02-10 19:53:59,385 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1295 transitions. Word has length 22 [2020-02-10 19:53:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:59,386 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1295 transitions. [2020-02-10 19:53:59,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1295 transitions. [2020-02-10 19:53:59,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:59,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53: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 19:53:59,386 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 19:53:59,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:59,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1814176560, now seen corresponding path program 1470 times [2020-02-10 19:53:59,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:59,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034093964] [2020-02-10 19:53:59,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:59,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 19:53:59,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034093964] [2020-02-10 19:53:59,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:59,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:53:59,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634901410] [2020-02-10 19:53:59,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:53:59,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:59,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:53:59,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:53:59,687 INFO L87 Difference]: Start difference. First operand 378 states and 1295 transitions. Second operand 9 states. [2020-02-10 19:53:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:59,781 INFO L93 Difference]: Finished difference Result 567 states and 1669 transitions. [2020-02-10 19:53:59,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:53:59,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:53:59,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:59,783 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:53:59,783 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 19:53:59,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 19:53:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 19:53:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 375. [2020-02-10 19:53:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:53:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1290 transitions. [2020-02-10 19:53:59,791 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1290 transitions. Word has length 22 [2020-02-10 19:53:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:59,791 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1290 transitions. [2020-02-10 19:53:59,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:53:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1290 transitions. [2020-02-10 19:53:59,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:53:59,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:59,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 19:53:59,792 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 19:53:59,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:59,792 INFO L82 PathProgramCache]: Analyzing trace with hash 918894790, now seen corresponding path program 1471 times [2020-02-10 19:53:59,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:59,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367386512] [2020-02-10 19:53:59,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:00,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 19:54:00,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367386512] [2020-02-10 19:54:00,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:00,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:00,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85876618] [2020-02-10 19:54:00,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:00,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:00,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:00,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:00,100 INFO L87 Difference]: Start difference. First operand 375 states and 1290 transitions. Second operand 9 states. [2020-02-10 19:54:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:00,189 INFO L93 Difference]: Finished difference Result 594 states and 1735 transitions. [2020-02-10 19:54:00,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:00,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:00,191 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:54:00,192 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:54:00,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 19:54:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:54:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 383. [2020-02-10 19:54:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:54:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1310 transitions. [2020-02-10 19:54:00,201 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1310 transitions. Word has length 22 [2020-02-10 19:54:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:00,201 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1310 transitions. [2020-02-10 19:54:00,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1310 transitions. [2020-02-10 19:54:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:00,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:00,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 19:54:00,202 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 19:54:00,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:00,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1785806620, now seen corresponding path program 1472 times [2020-02-10 19:54:00,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:00,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81324584] [2020-02-10 19:54:00,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:00,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 19:54:00,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81324584] [2020-02-10 19:54:00,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:00,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:00,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129201020] [2020-02-10 19:54:00,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:00,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:00,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:00,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:00,506 INFO L87 Difference]: Start difference. First operand 383 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:54:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:00,654 INFO L93 Difference]: Finished difference Result 589 states and 1722 transitions. [2020-02-10 19:54:00,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:00,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:00,656 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:54:00,656 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:54:00,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:00,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:54:00,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 379. [2020-02-10 19:54:00,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:54:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-02-10 19:54:00,666 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-02-10 19:54:00,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:00,666 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-02-10 19:54:00,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-02-10 19:54:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:00,666 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:00,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 19:54:00,667 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 19:54:00,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:00,667 INFO L82 PathProgramCache]: Analyzing trace with hash -429781962, now seen corresponding path program 1473 times [2020-02-10 19:54:00,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:00,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579698797] [2020-02-10 19:54:00,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:00,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 19:54:00,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579698797] [2020-02-10 19:54:00,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:00,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:00,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533323015] [2020-02-10 19:54:00,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:00,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:00,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:00,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:00,972 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:54:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:01,089 INFO L93 Difference]: Finished difference Result 596 states and 1736 transitions. [2020-02-10 19:54:01,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:01,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:01,091 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:54:01,092 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:54:01,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 19:54:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:54:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 384. [2020-02-10 19:54:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:54:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1308 transitions. [2020-02-10 19:54:01,102 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1308 transitions. Word has length 22 [2020-02-10 19:54:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:01,102 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1308 transitions. [2020-02-10 19:54:01,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1308 transitions. [2020-02-10 19:54:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:01,103 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:01,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 19:54:01,103 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 19:54:01,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:01,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2131109864, now seen corresponding path program 1474 times [2020-02-10 19:54:01,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:01,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876482477] [2020-02-10 19:54:01,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:01,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 19:54:01,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876482477] [2020-02-10 19:54:01,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:01,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:01,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567027298] [2020-02-10 19:54:01,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:01,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:01,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:01,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:01,403 INFO L87 Difference]: Start difference. First operand 384 states and 1308 transitions. Second operand 9 states. [2020-02-10 19:54:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:01,544 INFO L93 Difference]: Finished difference Result 592 states and 1724 transitions. [2020-02-10 19:54:01,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:01,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:01,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:01,546 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:54:01,546 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:54:01,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 19:54:01,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:54:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 379. [2020-02-10 19:54:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:54:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-02-10 19:54:01,555 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-02-10 19:54:01,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:01,555 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-02-10 19:54:01,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-02-10 19:54:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:01,555 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:01,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 19:54:01,556 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 19:54:01,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:01,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1645078376, now seen corresponding path program 1475 times [2020-02-10 19:54:01,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:01,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756266033] [2020-02-10 19:54:01,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:01,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 19:54:01,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756266033] [2020-02-10 19:54:01,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:01,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:01,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417761613] [2020-02-10 19:54:01,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:01,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:01,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:01,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:01,854 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:54:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:02,000 INFO L93 Difference]: Finished difference Result 584 states and 1709 transitions. [2020-02-10 19:54:02,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:02,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:02,002 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:54:02,002 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 19:54:02,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 19:54:02,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 19:54:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 382. [2020-02-10 19:54:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:54:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1301 transitions. [2020-02-10 19:54:02,011 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1301 transitions. Word has length 22 [2020-02-10 19:54:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:02,011 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1301 transitions. [2020-02-10 19:54:02,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1301 transitions. [2020-02-10 19:54:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:02,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:02,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 19:54:02,012 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 19:54:02,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:02,012 INFO L82 PathProgramCache]: Analyzing trace with hash -771337696, now seen corresponding path program 1476 times [2020-02-10 19:54:02,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:02,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142306296] [2020-02-10 19:54:02,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:02,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 19:54:02,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142306296] [2020-02-10 19:54:02,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:02,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:02,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457722400] [2020-02-10 19:54:02,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:02,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:02,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:02,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:02,310 INFO L87 Difference]: Start difference. First operand 382 states and 1301 transitions. Second operand 9 states. [2020-02-10 19:54:02,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:02,451 INFO L93 Difference]: Finished difference Result 585 states and 1708 transitions. [2020-02-10 19:54:02,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:02,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:02,453 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:54:02,453 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:54:02,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:54:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 375. [2020-02-10 19:54:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:02,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1288 transitions. [2020-02-10 19:54:02,462 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1288 transitions. Word has length 22 [2020-02-10 19:54:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:02,462 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1288 transitions. [2020-02-10 19:54:02,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1288 transitions. [2020-02-10 19:54:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:02,463 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:02,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 19:54:02,463 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 19:54:02,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:02,463 INFO L82 PathProgramCache]: Analyzing trace with hash -290926944, now seen corresponding path program 1477 times [2020-02-10 19:54:02,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:02,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476581531] [2020-02-10 19:54:02,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:02,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 19:54:02,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476581531] [2020-02-10 19:54:02,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:02,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:02,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150789642] [2020-02-10 19:54:02,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:02,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:02,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:02,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:02,759 INFO L87 Difference]: Start difference. First operand 375 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:54:02,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:02,872 INFO L93 Difference]: Finished difference Result 582 states and 1699 transitions. [2020-02-10 19:54:02,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:02,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:02,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:02,874 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:54:02,874 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:54:02,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 19:54:02,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:54:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 379. [2020-02-10 19:54:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:54:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-02-10 19:54:02,884 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-02-10 19:54:02,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:02,884 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-02-10 19:54:02,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-02-10 19:54:02,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:02,884 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:02,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 19:54:02,884 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 19:54:02,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:02,885 INFO L82 PathProgramCache]: Analyzing trace with hash 270141548, now seen corresponding path program 1478 times [2020-02-10 19:54:02,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:02,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086258222] [2020-02-10 19:54:02,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:03,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 19:54:03,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086258222] [2020-02-10 19:54:03,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:03,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:03,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708775151] [2020-02-10 19:54:03,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:03,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:03,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:03,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:03,180 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:54:03,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:03,275 INFO L93 Difference]: Finished difference Result 575 states and 1684 transitions. [2020-02-10 19:54:03,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:03,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:03,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:03,277 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:54:03,277 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:54:03,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:03,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:54:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 377. [2020-02-10 19:54:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1292 transitions. [2020-02-10 19:54:03,288 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1292 transitions. Word has length 22 [2020-02-10 19:54:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:03,288 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1292 transitions. [2020-02-10 19:54:03,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1292 transitions. [2020-02-10 19:54:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:03,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:03,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 19:54:03,289 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 19:54:03,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:03,289 INFO L82 PathProgramCache]: Analyzing trace with hash -878672266, now seen corresponding path program 1479 times [2020-02-10 19:54:03,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:03,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971363369] [2020-02-10 19:54:03,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:03,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 19:54:03,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971363369] [2020-02-10 19:54:03,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:03,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:03,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416525494] [2020-02-10 19:54:03,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:03,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:03,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:03,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:03,607 INFO L87 Difference]: Start difference. First operand 377 states and 1292 transitions. Second operand 9 states. [2020-02-10 19:54:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:03,723 INFO L93 Difference]: Finished difference Result 588 states and 1712 transitions. [2020-02-10 19:54:03,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:03,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:03,725 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:54:03,725 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:54:03,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 19:54:03,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:54:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 382. [2020-02-10 19:54:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:54:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1300 transitions. [2020-02-10 19:54:03,736 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1300 transitions. Word has length 22 [2020-02-10 19:54:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:03,736 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1300 transitions. [2020-02-10 19:54:03,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1300 transitions. [2020-02-10 19:54:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:03,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:03,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 19:54:03,737 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 19:54:03,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:03,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1143244392, now seen corresponding path program 1480 times [2020-02-10 19:54:03,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:03,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758845347] [2020-02-10 19:54:03,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:04,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 19:54:04,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758845347] [2020-02-10 19:54:04,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:04,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:04,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983947690] [2020-02-10 19:54:04,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:04,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:04,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:04,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:04,029 INFO L87 Difference]: Start difference. First operand 382 states and 1300 transitions. Second operand 9 states. [2020-02-10 19:54:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:04,145 INFO L93 Difference]: Finished difference Result 584 states and 1700 transitions. [2020-02-10 19:54:04,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:04,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:04,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:04,147 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:54:04,147 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:54:04,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:54:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 377. [2020-02-10 19:54:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-02-10 19:54:04,156 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-02-10 19:54:04,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:04,157 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-02-10 19:54:04,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-02-10 19:54:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:04,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:04,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 19:54:04,157 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 19:54:04,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:04,157 INFO L82 PathProgramCache]: Analyzing trace with hash -823950040, now seen corresponding path program 1481 times [2020-02-10 19:54:04,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:04,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987670991] [2020-02-10 19:54:04,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:04,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 19:54:04,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987670991] [2020-02-10 19:54:04,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:04,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:04,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908648639] [2020-02-10 19:54:04,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:04,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:04,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:04,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:04,460 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-02-10 19:54:04,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:04,581 INFO L93 Difference]: Finished difference Result 570 states and 1673 transitions. [2020-02-10 19:54:04,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:04,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:04,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:04,583 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:54:04,583 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:54:04,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 19:54:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:54:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 378. [2020-02-10 19:54:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:54:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1291 transitions. [2020-02-10 19:54:04,592 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1291 transitions. Word has length 22 [2020-02-10 19:54:04,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:04,592 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1291 transitions. [2020-02-10 19:54:04,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1291 transitions. [2020-02-10 19:54:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:04,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:04,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 19:54:04,593 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 19:54:04,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:04,593 INFO L82 PathProgramCache]: Analyzing trace with hash -288720238, now seen corresponding path program 1482 times [2020-02-10 19:54:04,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:04,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105519543] [2020-02-10 19:54:04,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:04,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 19:54:04,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105519543] [2020-02-10 19:54:04,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:04,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:04,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74828827] [2020-02-10 19:54:04,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:04,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:04,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:04,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:04,893 INFO L87 Difference]: Start difference. First operand 378 states and 1291 transitions. Second operand 9 states. [2020-02-10 19:54:05,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:05,025 INFO L93 Difference]: Finished difference Result 573 states and 1678 transitions. [2020-02-10 19:54:05,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:05,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:05,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:05,027 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:54:05,027 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:54:05,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 19:54:05,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:54:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 375. [2020-02-10 19:54:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1286 transitions. [2020-02-10 19:54:05,037 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1286 transitions. Word has length 22 [2020-02-10 19:54:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:05,037 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1286 transitions. [2020-02-10 19:54:05,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1286 transitions. [2020-02-10 19:54:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:05,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54: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 19:54:05,038 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 19:54:05,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1928116290, now seen corresponding path program 1483 times [2020-02-10 19:54:05,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:05,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564367526] [2020-02-10 19:54:05,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:05,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 19:54:05,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564367526] [2020-02-10 19:54:05,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:05,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:05,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633680450] [2020-02-10 19:54:05,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:05,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:05,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:05,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:05,343 INFO L87 Difference]: Start difference. First operand 375 states and 1286 transitions. Second operand 9 states. [2020-02-10 19:54:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:05,487 INFO L93 Difference]: Finished difference Result 562 states and 1658 transitions. [2020-02-10 19:54:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:05,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:05,489 INFO L225 Difference]: With dead ends: 562 [2020-02-10 19:54:05,489 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:54:05,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:05,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:54:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 377. [2020-02-10 19:54:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-02-10 19:54:05,499 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-02-10 19:54:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:05,499 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-02-10 19:54:05,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-02-10 19:54:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:05,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:05,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 19:54:05,500 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 19:54:05,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:05,500 INFO L82 PathProgramCache]: Analyzing trace with hash 921333996, now seen corresponding path program 1484 times [2020-02-10 19:54:05,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:05,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768800854] [2020-02-10 19:54:05,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:05,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 19:54:05,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768800854] [2020-02-10 19:54:05,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:05,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:05,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123077734] [2020-02-10 19:54:05,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:05,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:05,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:05,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:05,803 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-02-10 19:54:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:05,924 INFO L93 Difference]: Finished difference Result 560 states and 1653 transitions. [2020-02-10 19:54:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:05,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:05,926 INFO L225 Difference]: With dead ends: 560 [2020-02-10 19:54:05,926 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 19:54:05,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 19:54:05,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 19:54:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 376. [2020-02-10 19:54:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1288 transitions. [2020-02-10 19:54:05,936 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1288 transitions. Word has length 22 [2020-02-10 19:54:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:05,936 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1288 transitions. [2020-02-10 19:54:05,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1288 transitions. [2020-02-10 19:54:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:05,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:05,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 19:54:05,937 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 19:54:05,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:05,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1779105684, now seen corresponding path program 1485 times [2020-02-10 19:54:05,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:05,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796186270] [2020-02-10 19:54:05,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:06,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 19:54:06,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796186270] [2020-02-10 19:54:06,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:06,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:06,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068776486] [2020-02-10 19:54:06,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:06,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:06,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:06,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:06,245 INFO L87 Difference]: Start difference. First operand 376 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:54:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:06,370 INFO L93 Difference]: Finished difference Result 567 states and 1669 transitions. [2020-02-10 19:54:06,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:06,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:06,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:06,372 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:54:06,372 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:54:06,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:54:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 379. [2020-02-10 19:54:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:54:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1293 transitions. [2020-02-10 19:54:06,381 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1293 transitions. Word has length 22 [2020-02-10 19:54:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:06,382 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1293 transitions. [2020-02-10 19:54:06,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1293 transitions. [2020-02-10 19:54:06,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:06,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:06,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 19:54:06,382 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 19:54:06,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:06,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2081123628, now seen corresponding path program 1486 times [2020-02-10 19:54:06,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:06,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971640787] [2020-02-10 19:54:06,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54: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 19:54:06,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971640787] [2020-02-10 19:54:06,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:06,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:06,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45326530] [2020-02-10 19:54:06,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:06,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:06,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:06,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:06,691 INFO L87 Difference]: Start difference. First operand 379 states and 1293 transitions. Second operand 9 states. [2020-02-10 19:54:06,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:06,836 INFO L93 Difference]: Finished difference Result 568 states and 1668 transitions. [2020-02-10 19:54:06,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:06,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:06,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:06,838 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:54:06,838 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:54:06,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:54:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 376. [2020-02-10 19:54:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1287 transitions. [2020-02-10 19:54:06,848 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1287 transitions. Word has length 22 [2020-02-10 19:54:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:06,849 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1287 transitions. [2020-02-10 19:54:06,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1287 transitions. [2020-02-10 19:54:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:06,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:06,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 19:54:06,849 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 19:54:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:06,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1266849180, now seen corresponding path program 1487 times [2020-02-10 19:54:06,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:06,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765108097] [2020-02-10 19:54:06,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:07,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 19:54:07,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765108097] [2020-02-10 19:54:07,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:07,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:07,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286312003] [2020-02-10 19:54:07,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:07,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:07,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:07,158 INFO L87 Difference]: Start difference. First operand 376 states and 1287 transitions. Second operand 9 states. [2020-02-10 19:54:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:07,273 INFO L93 Difference]: Finished difference Result 561 states and 1654 transitions. [2020-02-10 19:54:07,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:07,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:07,275 INFO L225 Difference]: With dead ends: 561 [2020-02-10 19:54:07,275 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:54:07,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 19:54:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:54:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 377. [2020-02-10 19:54:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1288 transitions. [2020-02-10 19:54:07,285 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1288 transitions. Word has length 22 [2020-02-10 19:54:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:07,285 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1288 transitions. [2020-02-10 19:54:07,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1288 transitions. [2020-02-10 19:54:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:07,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:07,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 19:54:07,286 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 19:54:07,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:07,286 INFO L82 PathProgramCache]: Analyzing trace with hash -731619378, now seen corresponding path program 1488 times [2020-02-10 19:54:07,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:07,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881215600] [2020-02-10 19:54:07,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:07,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 19:54:07,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881215600] [2020-02-10 19:54:07,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:07,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:07,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252421966] [2020-02-10 19:54:07,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:07,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:07,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:07,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:07,584 INFO L87 Difference]: Start difference. First operand 377 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:54:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:07,730 INFO L93 Difference]: Finished difference Result 564 states and 1659 transitions. [2020-02-10 19:54:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:07,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:07,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:07,732 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:54:07,733 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:54:07,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 19:54:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:54:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 373. [2020-02-10 19:54:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1282 transitions. [2020-02-10 19:54:07,741 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1282 transitions. Word has length 22 [2020-02-10 19:54:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:07,741 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1282 transitions. [2020-02-10 19:54:07,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1282 transitions. [2020-02-10 19:54:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:07,742 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:07,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 19:54:07,742 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 19:54:07,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:07,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1828175184, now seen corresponding path program 1489 times [2020-02-10 19:54:07,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:07,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868611091] [2020-02-10 19:54:07,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:08,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 19:54:08,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868611091] [2020-02-10 19:54:08,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:08,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:08,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106921948] [2020-02-10 19:54:08,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:08,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:08,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:08,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:08,046 INFO L87 Difference]: Start difference. First operand 373 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:54:08,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:08,136 INFO L93 Difference]: Finished difference Result 596 states and 1746 transitions. [2020-02-10 19:54:08,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:08,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:08,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:08,138 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:54:08,138 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:54:08,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 19:54:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:54:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 383. [2020-02-10 19:54:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:54:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-02-10 19:54:08,148 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-02-10 19:54:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:08,148 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-02-10 19:54:08,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-02-10 19:54:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:08,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:08,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:08,149 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 19:54:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:08,149 INFO L82 PathProgramCache]: Analyzing trace with hash -237909298, now seen corresponding path program 1490 times [2020-02-10 19:54:08,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:08,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614217692] [2020-02-10 19:54:08,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:08,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 19:54:08,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614217692] [2020-02-10 19:54:08,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:08,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:08,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138479839] [2020-02-10 19:54:08,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:08,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:08,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:08,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:08,445 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-02-10 19:54:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:08,584 INFO L93 Difference]: Finished difference Result 591 states and 1733 transitions. [2020-02-10 19:54:08,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:08,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:08,586 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:54:08,586 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:54:08,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 19:54:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:54:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 379. [2020-02-10 19:54:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:54:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1302 transitions. [2020-02-10 19:54:08,595 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1302 transitions. Word has length 22 [2020-02-10 19:54:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:08,595 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1302 transitions. [2020-02-10 19:54:08,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1302 transitions. [2020-02-10 19:54:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:08,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:08,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 19:54:08,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 19:54:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:08,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1727263012, now seen corresponding path program 1491 times [2020-02-10 19:54:08,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:08,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242724611] [2020-02-10 19:54:08,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:08,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 19:54:08,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242724611] [2020-02-10 19:54:08,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:08,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:08,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562962931] [2020-02-10 19:54:08,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:08,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:08,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:08,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:08,894 INFO L87 Difference]: Start difference. First operand 379 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:54:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:09,005 INFO L93 Difference]: Finished difference Result 594 states and 1738 transitions. [2020-02-10 19:54:09,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:09,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:09,006 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:54:09,007 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:54:09,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 19:54:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:54:09,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 382. [2020-02-10 19:54:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:54:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-02-10 19:54:09,016 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-02-10 19:54:09,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:09,017 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-02-10 19:54:09,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-02-10 19:54:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:09,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:09,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 19:54:09,017 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 19:54:09,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:09,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1600626638, now seen corresponding path program 1492 times [2020-02-10 19:54:09,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:09,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372230344] [2020-02-10 19:54:09,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:09,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 19:54:09,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372230344] [2020-02-10 19:54:09,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:09,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:09,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329050678] [2020-02-10 19:54:09,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:09,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:09,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:09,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:09,315 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-02-10 19:54:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:09,454 INFO L93 Difference]: Finished difference Result 588 states and 1724 transitions. [2020-02-10 19:54:09,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:09,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:09,456 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:54:09,456 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:54:09,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 19:54:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:54:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 379. [2020-02-10 19:54:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:54:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-02-10 19:54:09,466 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-02-10 19:54:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:09,466 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-02-10 19:54:09,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:09,466 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-02-10 19:54:09,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:09,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:09,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 19:54:09,467 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 19:54:09,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:09,467 INFO L82 PathProgramCache]: Analyzing trace with hash 279322490, now seen corresponding path program 1493 times [2020-02-10 19:54:09,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:09,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140041173] [2020-02-10 19:54:09,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:09,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 19:54:09,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140041173] [2020-02-10 19:54:09,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:09,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:09,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497069645] [2020-02-10 19:54:09,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:09,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:09,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:09,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:09,784 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:54:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:09,924 INFO L93 Difference]: Finished difference Result 583 states and 1715 transitions. [2020-02-10 19:54:09,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:09,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:09,926 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:54:09,926 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:54:09,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 19:54:09,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:54:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 381. [2020-02-10 19:54:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:54:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-02-10 19:54:09,936 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-02-10 19:54:09,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:09,936 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-02-10 19:54:09,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-02-10 19:54:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:09,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:09,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 19:54:09,937 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 19:54:09,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:09,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1621255278, now seen corresponding path program 1494 times [2020-02-10 19:54:09,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:09,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089571582] [2020-02-10 19:54:09,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:10,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 19:54:10,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089571582] [2020-02-10 19:54:10,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:10,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:10,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137412591] [2020-02-10 19:54:10,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:10,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:10,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:10,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:10,233 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:54:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:10,346 INFO L93 Difference]: Finished difference Result 582 states and 1711 transitions. [2020-02-10 19:54:10,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:10,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:10,348 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:54:10,348 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:54: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 19:54:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:54:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 376. [2020-02-10 19:54:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1292 transitions. [2020-02-10 19:54:10,358 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1292 transitions. Word has length 22 [2020-02-10 19:54:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:10,358 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1292 transitions. [2020-02-10 19:54:10,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1292 transitions. [2020-02-10 19:54:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:10,359 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:10,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 19:54:10,359 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 19:54:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:10,359 INFO L82 PathProgramCache]: Analyzing trace with hash 706739172, now seen corresponding path program 1495 times [2020-02-10 19:54:10,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:10,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430568434] [2020-02-10 19:54:10,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:10,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 19:54:10,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430568434] [2020-02-10 19:54:10,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:10,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:10,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288314135] [2020-02-10 19:54:10,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:10,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:10,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:10,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:10,660 INFO L87 Difference]: Start difference. First operand 376 states and 1292 transitions. Second operand 9 states. [2020-02-10 19:54:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:10,743 INFO L93 Difference]: Finished difference Result 602 states and 1760 transitions. [2020-02-10 19:54:10,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:10,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:10,745 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:54:10,745 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:54:10,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 19:54:10,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:54:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 384. [2020-02-10 19:54:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:54:10,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1312 transitions. [2020-02-10 19:54:10,754 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1312 transitions. Word has length 22 [2020-02-10 19:54:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:10,754 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1312 transitions. [2020-02-10 19:54:10,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1312 transitions. [2020-02-10 19:54:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:10,755 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:10,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 19:54:10,755 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 19:54:10,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:10,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1997962238, now seen corresponding path program 1496 times [2020-02-10 19:54:10,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:10,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107874703] [2020-02-10 19:54:10,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:11,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 19:54:11,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107874703] [2020-02-10 19:54:11,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:11,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:11,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408202231] [2020-02-10 19:54:11,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:11,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:11,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:11,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:11,054 INFO L87 Difference]: Start difference. First operand 384 states and 1312 transitions. Second operand 9 states. [2020-02-10 19:54:11,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:11,162 INFO L93 Difference]: Finished difference Result 597 states and 1747 transitions. [2020-02-10 19:54:11,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:11,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:11,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:11,164 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:54:11,164 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:54:11,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:54:11,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 380. [2020-02-10 19:54:11,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:54:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-02-10 19:54:11,173 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-02-10 19:54:11,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:11,174 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-02-10 19:54:11,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:11,174 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-02-10 19:54:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:11,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:11,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 19:54:11,174 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 19:54:11,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:11,175 INFO L82 PathProgramCache]: Analyzing trace with hash -641937580, now seen corresponding path program 1497 times [2020-02-10 19:54:11,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:11,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742017149] [2020-02-10 19:54:11,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:11,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 19:54:11,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742017149] [2020-02-10 19:54:11,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:11,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:11,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688998303] [2020-02-10 19:54:11,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:11,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:11,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:11,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:11,480 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-02-10 19:54:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:11,561 INFO L93 Difference]: Finished difference Result 604 states and 1761 transitions. [2020-02-10 19:54:11,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:11,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:11,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:11,562 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:54:11,563 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:54:11,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 19:54:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:54:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 385. [2020-02-10 19:54:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-02-10 19:54:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1310 transitions. [2020-02-10 19:54:11,572 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1310 transitions. Word has length 22 [2020-02-10 19:54:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:11,573 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 1310 transitions. [2020-02-10 19:54:11,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1310 transitions. [2020-02-10 19:54:11,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:11,573 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:11,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 19:54:11,573 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 19:54:11,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:11,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1951701814, now seen corresponding path program 1498 times [2020-02-10 19:54:11,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:11,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856649158] [2020-02-10 19:54:11,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:11,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 19:54:11,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856649158] [2020-02-10 19:54:11,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:11,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:11,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565587526] [2020-02-10 19:54:11,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:11,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:11,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:11,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:11,876 INFO L87 Difference]: Start difference. First operand 385 states and 1310 transitions. Second operand 9 states. [2020-02-10 19:54:11,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:11,985 INFO L93 Difference]: Finished difference Result 600 states and 1749 transitions. [2020-02-10 19:54:11,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:11,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:11,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:11,987 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:54:11,987 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:54:11,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:54:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 380. [2020-02-10 19:54:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:54:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1298 transitions. [2020-02-10 19:54:11,996 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1298 transitions. Word has length 22 [2020-02-10 19:54:11,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:11,996 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1298 transitions. [2020-02-10 19:54:11,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1298 transitions. [2020-02-10 19:54:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:11,996 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:11,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 19:54:11,996 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 19:54:11,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:11,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1857233994, now seen corresponding path program 1499 times [2020-02-10 19:54:11,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:11,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413636961] [2020-02-10 19:54:11,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:12,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 19:54:12,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413636961] [2020-02-10 19:54:12,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:12,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:12,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16621131] [2020-02-10 19:54:12,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:12,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:12,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:12,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:12,303 INFO L87 Difference]: Start difference. First operand 380 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:54:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:12,412 INFO L93 Difference]: Finished difference Result 592 states and 1734 transitions. [2020-02-10 19:54:12,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:12,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:12,414 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:54:12,414 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 19:54:12,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 19:54:12,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 19:54:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 383. [2020-02-10 19:54:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:54:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1303 transitions. [2020-02-10 19:54:12,424 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1303 transitions. Word has length 22 [2020-02-10 19:54:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:12,424 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1303 transitions. [2020-02-10 19:54:12,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1303 transitions. [2020-02-10 19:54:12,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:12,425 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:12,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 19:54:12,425 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 19:54:12,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:12,425 INFO L82 PathProgramCache]: Analyzing trace with hash -983493314, now seen corresponding path program 1500 times [2020-02-10 19:54:12,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:12,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668129546] [2020-02-10 19:54:12,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:12,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 19:54:12,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668129546] [2020-02-10 19:54:12,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:12,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:12,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416032365] [2020-02-10 19:54:12,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:12,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:12,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:12,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:12,737 INFO L87 Difference]: Start difference. First operand 383 states and 1303 transitions. Second operand 9 states. [2020-02-10 19:54:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:12,843 INFO L93 Difference]: Finished difference Result 593 states and 1733 transitions. [2020-02-10 19:54:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:12,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:12,845 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:54:12,845 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:54:12,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:54:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 376. [2020-02-10 19:54:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1289 transitions. [2020-02-10 19:54:12,856 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1289 transitions. Word has length 22 [2020-02-10 19:54:12,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:12,856 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1289 transitions. [2020-02-10 19:54:12,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1289 transitions. [2020-02-10 19:54:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:12,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:12,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:12,857 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 19:54:12,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:12,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1969222452, now seen corresponding path program 1501 times [2020-02-10 19:54:12,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:12,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390810600] [2020-02-10 19:54:12,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:13,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390810600] [2020-02-10 19:54:13,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:13,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:13,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255836420] [2020-02-10 19:54:13,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:13,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:13,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:13,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:13,149 INFO L87 Difference]: Start difference. First operand 376 states and 1289 transitions. Second operand 9 states. [2020-02-10 19:54:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:13,231 INFO L93 Difference]: Finished difference Result 596 states and 1740 transitions. [2020-02-10 19:54:13,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:13,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:13,233 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:54:13,233 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:54:13,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 19:54:13,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:54:13,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 382. [2020-02-10 19:54:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:54:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1303 transitions. [2020-02-10 19:54:13,244 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1303 transitions. Word has length 22 [2020-02-10 19:54:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:13,244 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1303 transitions. [2020-02-10 19:54:13,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1303 transitions. [2020-02-10 19:54:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:13,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:13,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 19:54:13,245 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 19:54:13,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:13,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2095858826, now seen corresponding path program 1502 times [2020-02-10 19:54:13,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:13,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829716723] [2020-02-10 19:54:13,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:13,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 19:54:13,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829716723] [2020-02-10 19:54:13,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:13,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:13,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345682447] [2020-02-10 19:54:13,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:13,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:13,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:13,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:13,534 INFO L87 Difference]: Start difference. First operand 382 states and 1303 transitions. Second operand 9 states. [2020-02-10 19:54:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:13,640 INFO L93 Difference]: Finished difference Result 590 states and 1726 transitions. [2020-02-10 19:54:13,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:13,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:13,642 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:54:13,642 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:54:13,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:13,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:54:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-02-10 19:54:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:54:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-02-10 19:54:13,652 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-02-10 19:54:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:13,652 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-02-10 19:54:13,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-02-10 19:54:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:13,653 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:13,653 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:13,653 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 19:54:13,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:13,653 INFO L82 PathProgramCache]: Analyzing trace with hash 893511296, now seen corresponding path program 1503 times [2020-02-10 19:54:13,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:13,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160411842] [2020-02-10 19:54:13,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:13,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 19:54:13,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160411842] [2020-02-10 19:54:13,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:13,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:13,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91436641] [2020-02-10 19:54:13,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:13,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:13,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:13,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:13,949 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:54:14,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:14,037 INFO L93 Difference]: Finished difference Result 600 states and 1747 transitions. [2020-02-10 19:54:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:14,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:14,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:14,038 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:54:14,039 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:54:14,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 19:54:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:54:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-02-10 19:54:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:54:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1304 transitions. [2020-02-10 19:54:14,048 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1304 transitions. Word has length 22 [2020-02-10 19:54:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:14,048 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1304 transitions. [2020-02-10 19:54:14,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1304 transitions. [2020-02-10 19:54:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:14,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:14,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 19:54:14,049 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 19:54:14,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash 785011850, now seen corresponding path program 1504 times [2020-02-10 19:54:14,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:14,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153367213] [2020-02-10 19:54:14,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:14,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153367213] [2020-02-10 19:54:14,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:14,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:14,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844310564] [2020-02-10 19:54:14,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:14,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:14,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:14,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:14,340 INFO L87 Difference]: Start difference. First operand 384 states and 1304 transitions. Second operand 9 states. [2020-02-10 19:54:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:14,450 INFO L93 Difference]: Finished difference Result 596 states and 1735 transitions. [2020-02-10 19:54:14,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:14,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:14,452 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:54:14,452 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:54:14,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 19:54:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:54:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 379. [2020-02-10 19:54:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:54:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1293 transitions. [2020-02-10 19:54:14,463 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1293 transitions. Word has length 22 [2020-02-10 19:54:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:14,463 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1293 transitions. [2020-02-10 19:54:14,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1293 transitions. [2020-02-10 19:54:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:14,463 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:14,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 19:54:14,464 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 19:54:14,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:14,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1126023090, now seen corresponding path program 1505 times [2020-02-10 19:54:14,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:14,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103840700] [2020-02-10 19:54:14,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:14,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 19:54:14,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103840700] [2020-02-10 19:54:14,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:14,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:14,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907093859] [2020-02-10 19:54:14,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:14,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:14,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:14,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:14,756 INFO L87 Difference]: Start difference. First operand 379 states and 1293 transitions. Second operand 9 states. [2020-02-10 19:54:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:14,860 INFO L93 Difference]: Finished difference Result 585 states and 1714 transitions. [2020-02-10 19:54:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:14,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:14,862 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:54:14,862 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:54:14,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:54:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 381. [2020-02-10 19:54:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:54:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1296 transitions. [2020-02-10 19:54:14,873 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1296 transitions. Word has length 22 [2020-02-10 19:54:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:14,873 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1296 transitions. [2020-02-10 19:54:14,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1296 transitions. [2020-02-10 19:54:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:14,873 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:14,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 19:54:14,874 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 19:54:14,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:14,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1299270782, now seen corresponding path program 1506 times [2020-02-10 19:54:14,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:14,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092039369] [2020-02-10 19:54:14,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:15,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092039369] [2020-02-10 19:54:15,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:15,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:15,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220171713] [2020-02-10 19:54:15,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:15,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:15,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:15,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:15,166 INFO L87 Difference]: Start difference. First operand 381 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:54:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:15,277 INFO L93 Difference]: Finished difference Result 587 states and 1716 transitions. [2020-02-10 19:54:15,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:15,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:15,279 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:54:15,279 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:54:15,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 19:54:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:54:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 376. [2020-02-10 19:54:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1286 transitions. [2020-02-10 19:54:15,289 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1286 transitions. Word has length 22 [2020-02-10 19:54:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:15,289 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1286 transitions. [2020-02-10 19:54:15,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1286 transitions. [2020-02-10 19:54:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:15,290 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:15,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 19:54:15,290 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 19:54:15,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:15,290 INFO L82 PathProgramCache]: Analyzing trace with hash 774932246, now seen corresponding path program 1507 times [2020-02-10 19:54:15,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:15,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485304684] [2020-02-10 19:54:15,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54: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 19:54:15,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485304684] [2020-02-10 19:54:15,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:15,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:15,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505142308] [2020-02-10 19:54:15,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:15,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:15,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:15,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:15,607 INFO L87 Difference]: Start difference. First operand 376 states and 1286 transitions. Second operand 9 states. [2020-02-10 19:54:15,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:15,715 INFO L93 Difference]: Finished difference Result 576 states and 1698 transitions. [2020-02-10 19:54:15,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:15,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:15,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:15,717 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:54:15,717 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:54:15,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 19:54:15,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:54:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 380. [2020-02-10 19:54:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:54:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1296 transitions. [2020-02-10 19:54:15,726 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1296 transitions. Word has length 22 [2020-02-10 19:54:15,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:15,726 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1296 transitions. [2020-02-10 19:54:15,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1296 transitions. [2020-02-10 19:54:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:15,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:15,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 19:54:15,727 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 19:54:15,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:15,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2116865034, now seen corresponding path program 1508 times [2020-02-10 19:54:15,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:15,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496943508] [2020-02-10 19:54:15,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:16,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 19:54:16,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496943508] [2020-02-10 19:54:16,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:16,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:16,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700667556] [2020-02-10 19:54:16,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:16,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:16,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:16,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:16,030 INFO L87 Difference]: Start difference. First operand 380 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:54:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:16,147 INFO L93 Difference]: Finished difference Result 575 states and 1694 transitions. [2020-02-10 19:54:16,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:16,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:16,149 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:54:16,149 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:54:16,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:54:16,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 378. [2020-02-10 19:54:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:54:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1291 transitions. [2020-02-10 19:54:16,157 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1291 transitions. Word has length 22 [2020-02-10 19:54:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:16,157 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1291 transitions. [2020-02-10 19:54:16,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1291 transitions. [2020-02-10 19:54:16,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:16,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:16,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 19:54:16,158 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 19:54:16,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:16,158 INFO L82 PathProgramCache]: Analyzing trace with hash -300778910, now seen corresponding path program 1509 times [2020-02-10 19:54:16,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:16,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14368605] [2020-02-10 19:54:16,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:16,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 19:54:16,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14368605] [2020-02-10 19:54:16,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:16,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:16,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031259168] [2020-02-10 19:54:16,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:16,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:16,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:16,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:16,457 INFO L87 Difference]: Start difference. First operand 378 states and 1291 transitions. Second operand 9 states. [2020-02-10 19:54:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:16,563 INFO L93 Difference]: Finished difference Result 579 states and 1703 transitions. [2020-02-10 19:54:16,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:16,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:16,565 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:54:16,565 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:54:16,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 19:54:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:54:16,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 381. [2020-02-10 19:54:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:54:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1296 transitions. [2020-02-10 19:54:16,574 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1296 transitions. Word has length 22 [2020-02-10 19:54:16,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:16,574 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1296 transitions. [2020-02-10 19:54:16,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1296 transitions. [2020-02-10 19:54:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:16,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:16,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 19:54:16,575 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 19:54:16,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:16,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2129177070, now seen corresponding path program 1510 times [2020-02-10 19:54:16,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:16,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842976689] [2020-02-10 19:54:16,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:16,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 19:54:16,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842976689] [2020-02-10 19:54:16,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:16,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:16,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637971746] [2020-02-10 19:54:16,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:16,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:16,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:16,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:16,873 INFO L87 Difference]: Start difference. First operand 381 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:54:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:16,982 INFO L93 Difference]: Finished difference Result 580 states and 1702 transitions. [2020-02-10 19:54:16,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:16,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:16,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:16,984 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:54:16,984 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:54:16,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 19:54:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:54:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 378. [2020-02-10 19:54:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:54:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1289 transitions. [2020-02-10 19:54:16,994 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1289 transitions. Word has length 22 [2020-02-10 19:54:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:16,994 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1289 transitions. [2020-02-10 19:54:16,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1289 transitions. [2020-02-10 19:54:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:16,995 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:16,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 19:54:16,995 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 19:54:16,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:16,995 INFO L82 PathProgramCache]: Analyzing trace with hash -31931502, now seen corresponding path program 1511 times [2020-02-10 19:54:16,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:16,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900716862] [2020-02-10 19:54:16,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:17,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 19:54:17,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900716862] [2020-02-10 19:54:17,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:17,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:17,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27622948] [2020-02-10 19:54:17,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:17,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:17,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:17,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:17,293 INFO L87 Difference]: Start difference. First operand 378 states and 1289 transitions. Second operand 9 states. [2020-02-10 19:54:17,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:17,399 INFO L93 Difference]: Finished difference Result 576 states and 1694 transitions. [2020-02-10 19:54:17,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:17,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:17,401 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:54:17,401 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:54:17,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:54:17,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 380. [2020-02-10 19:54:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:54:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1292 transitions. [2020-02-10 19:54:17,411 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1292 transitions. Word has length 22 [2020-02-10 19:54:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:17,411 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1292 transitions. [2020-02-10 19:54:17,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1292 transitions. [2020-02-10 19:54:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:17,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:17,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:17,411 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 19:54:17,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:17,412 INFO L82 PathProgramCache]: Analyzing trace with hash -205179194, now seen corresponding path program 1512 times [2020-02-10 19:54:17,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:17,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614027549] [2020-02-10 19:54:17,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:17,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 19:54:17,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614027549] [2020-02-10 19:54:17,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:17,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:17,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454213691] [2020-02-10 19:54:17,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:17,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:17,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:17,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:17,707 INFO L87 Difference]: Start difference. First operand 380 states and 1292 transitions. Second operand 9 states. [2020-02-10 19:54:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:17,813 INFO L93 Difference]: Finished difference Result 578 states and 1696 transitions. [2020-02-10 19:54:17,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:17,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:17,815 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:54:17,815 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:54:17,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 19:54:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:54:17,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 373. [2020-02-10 19:54:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1280 transitions. [2020-02-10 19:54:17,824 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1280 transitions. Word has length 22 [2020-02-10 19:54:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:17,825 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1280 transitions. [2020-02-10 19:54:17,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1280 transitions. [2020-02-10 19:54:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:17,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:17,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 19:54:17,825 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 19:54:17,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:17,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2099117908, now seen corresponding path program 1513 times [2020-02-10 19:54:17,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:17,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766836997] [2020-02-10 19:54:17,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:18,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 19:54:18,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766836997] [2020-02-10 19:54:18,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:18,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:18,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651261573] [2020-02-10 19:54:18,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:18,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:18,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:18,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:18,123 INFO L87 Difference]: Start difference. First operand 373 states and 1280 transitions. Second operand 9 states. [2020-02-10 19:54:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:18,201 INFO L93 Difference]: Finished difference Result 574 states and 1677 transitions. [2020-02-10 19:54:18,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:18,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:18,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:18,203 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:54:18,203 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:54:18,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 19:54:18,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:54:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 379. [2020-02-10 19:54:18,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:54:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-02-10 19:54:18,213 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-02-10 19:54:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:18,213 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-02-10 19:54:18,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-02-10 19:54:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:18,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:18,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 19:54:18,214 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 19:54:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1634780896, now seen corresponding path program 1514 times [2020-02-10 19:54:18,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:18,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214101595] [2020-02-10 19:54:18,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:18,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 19:54:18,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214101595] [2020-02-10 19:54:18,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:18,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:18,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674691758] [2020-02-10 19:54:18,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:18,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:18,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:18,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:18,509 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:54:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:18,599 INFO L93 Difference]: Finished difference Result 567 states and 1662 transitions. [2020-02-10 19:54:18,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:18,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:18,600 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:54:18,601 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:54:18,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:54:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 377. [2020-02-10 19:54:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1292 transitions. [2020-02-10 19:54:18,611 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1292 transitions. Word has length 22 [2020-02-10 19:54:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:18,611 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1292 transitions. [2020-02-10 19:54:18,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1292 transitions. [2020-02-10 19:54:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:18,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:18,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 19:54:18,611 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 19:54:18,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:18,612 INFO L82 PathProgramCache]: Analyzing trace with hash 498680054, now seen corresponding path program 1515 times [2020-02-10 19:54:18,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:18,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118024961] [2020-02-10 19:54:18,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:18,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 19:54:18,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118024961] [2020-02-10 19:54:18,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:18,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:18,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725360696] [2020-02-10 19:54:18,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:18,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:18,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:18,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:18,905 INFO L87 Difference]: Start difference. First operand 377 states and 1292 transitions. Second operand 9 states. [2020-02-10 19:54:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:18,983 INFO L93 Difference]: Finished difference Result 576 states and 1680 transitions. [2020-02-10 19:54:18,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:18,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:18,985 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:54:18,985 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:54:18,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 19:54:18,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:54:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 380. [2020-02-10 19:54:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:54:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1296 transitions. [2020-02-10 19:54:18,995 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1296 transitions. Word has length 22 [2020-02-10 19:54:18,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:18,995 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1296 transitions. [2020-02-10 19:54:18,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1296 transitions. [2020-02-10 19:54:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:18,996 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:18,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 19:54:18,996 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 19:54:18,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:18,996 INFO L82 PathProgramCache]: Analyzing trace with hash -463523608, now seen corresponding path program 1516 times [2020-02-10 19:54:18,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:18,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385925365] [2020-02-10 19:54:18,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:19,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385925365] [2020-02-10 19:54:19,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:19,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:19,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567449793] [2020-02-10 19:54:19,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:19,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:19,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:19,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:19,283 INFO L87 Difference]: Start difference. First operand 380 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:54:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:19,387 INFO L93 Difference]: Finished difference Result 570 states and 1666 transitions. [2020-02-10 19:54:19,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:19,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:19,389 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:54:19,389 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:54:19,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 19:54:19,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:54:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 377. [2020-02-10 19:54:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-02-10 19:54:19,398 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-02-10 19:54:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:19,398 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-02-10 19:54:19,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-02-10 19:54:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:19,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:19,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 19:54:19,399 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 19:54:19,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash 553402280, now seen corresponding path program 1517 times [2020-02-10 19:54:19,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:19,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201857624] [2020-02-10 19:54:19,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:19,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 19:54:19,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201857624] [2020-02-10 19:54:19,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:19,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:19,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374914964] [2020-02-10 19:54:19,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:19,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:19,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:19,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:19,715 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-02-10 19:54:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:19,802 INFO L93 Difference]: Finished difference Result 560 states and 1647 transitions. [2020-02-10 19:54:19,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:19,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:19,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:19,804 INFO L225 Difference]: With dead ends: 560 [2020-02-10 19:54:19,805 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:54:19,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:54:19,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 378. [2020-02-10 19:54:19,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:54:19,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1291 transitions. [2020-02-10 19:54:19,814 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1291 transitions. Word has length 22 [2020-02-10 19:54:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:19,814 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1291 transitions. [2020-02-10 19:54:19,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1291 transitions. [2020-02-10 19:54:19,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:19,815 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:19,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 19:54:19,815 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 19:54:19,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:19,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2130624058, now seen corresponding path program 1518 times [2020-02-10 19:54:19,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:19,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532092659] [2020-02-10 19:54:19,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:20,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 19:54:20,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532092659] [2020-02-10 19:54:20,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:20,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:20,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249434062] [2020-02-10 19:54:20,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:20,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:20,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:20,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:20,120 INFO L87 Difference]: Start difference. First operand 378 states and 1291 transitions. Second operand 9 states. [2020-02-10 19:54:20,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:20,242 INFO L93 Difference]: Finished difference Result 561 states and 1648 transitions. [2020-02-10 19:54:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:20,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:20,244 INFO L225 Difference]: With dead ends: 561 [2020-02-10 19:54:20,244 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:54:20,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 19:54:20,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:54:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 375. [2020-02-10 19:54:20,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1286 transitions. [2020-02-10 19:54:20,253 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1286 transitions. Word has length 22 [2020-02-10 19:54:20,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:20,253 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1286 transitions. [2020-02-10 19:54:20,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1286 transitions. [2020-02-10 19:54:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:20,253 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:20,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 19:54:20,254 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 19:54:20,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:20,254 INFO L82 PathProgramCache]: Analyzing trace with hash -867151968, now seen corresponding path program 1519 times [2020-02-10 19:54:20,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:20,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328349714] [2020-02-10 19:54:20,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:20,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328349714] [2020-02-10 19:54:20,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:20,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:20,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693759474] [2020-02-10 19:54:20,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:20,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:20,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:20,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:20,549 INFO L87 Difference]: Start difference. First operand 375 states and 1286 transitions. Second operand 9 states. [2020-02-10 19:54:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:20,628 INFO L93 Difference]: Finished difference Result 578 states and 1685 transitions. [2020-02-10 19:54:20,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:20,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:20,630 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:54:20,630 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:54:20,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 19:54:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:54:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 379. [2020-02-10 19:54:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:54:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1294 transitions. [2020-02-10 19:54:20,640 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1294 transitions. Word has length 22 [2020-02-10 19:54:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:20,640 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1294 transitions. [2020-02-10 19:54:20,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1294 transitions. [2020-02-10 19:54:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:20,641 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:20,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 19:54:20,641 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 19:54:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash -306083476, now seen corresponding path program 1520 times [2020-02-10 19:54:20,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:20,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759553839] [2020-02-10 19:54:20,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:20,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 19:54:20,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759553839] [2020-02-10 19:54:20,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:20,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:20,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448229087] [2020-02-10 19:54:20,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:20,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:20,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:20,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:20,939 INFO L87 Difference]: Start difference. First operand 379 states and 1294 transitions. Second operand 9 states. [2020-02-10 19:54:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:21,017 INFO L93 Difference]: Finished difference Result 571 states and 1670 transitions. [2020-02-10 19:54:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:21,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:21,019 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:54:21,019 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:54:21,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 19:54:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:54:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 377. [2020-02-10 19:54:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-02-10 19:54:21,028 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-02-10 19:54:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:21,028 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-02-10 19:54:21,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-02-10 19:54:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:21,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:21,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 19:54:21,029 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 19:54:21,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1454897290, now seen corresponding path program 1521 times [2020-02-10 19:54:21,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:21,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611440257] [2020-02-10 19:54:21,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:21,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 19:54:21,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611440257] [2020-02-10 19:54:21,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:21,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:21,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730589727] [2020-02-10 19:54:21,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:21,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:21,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:21,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:21,334 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-02-10 19:54:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:21,409 INFO L93 Difference]: Finished difference Result 584 states and 1698 transitions. [2020-02-10 19:54:21,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:21,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:21,411 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:54:21,411 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:54:21,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 19:54:21,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:54:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 382. [2020-02-10 19:54:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:54:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1298 transitions. [2020-02-10 19:54:21,420 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1298 transitions. Word has length 22 [2020-02-10 19:54:21,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:21,420 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1298 transitions. [2020-02-10 19:54:21,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1298 transitions. [2020-02-10 19:54:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:21,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:21,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 19:54:21,421 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 19:54:21,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:21,421 INFO L82 PathProgramCache]: Analyzing trace with hash 567019368, now seen corresponding path program 1522 times [2020-02-10 19:54:21,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:21,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016247162] [2020-02-10 19:54:21,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:21,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 19:54:21,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016247162] [2020-02-10 19:54:21,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:21,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:21,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993134789] [2020-02-10 19:54:21,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:21,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:21,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:21,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:21,736 INFO L87 Difference]: Start difference. First operand 382 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:54:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:21,844 INFO L93 Difference]: Finished difference Result 580 states and 1686 transitions. [2020-02-10 19:54:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:21,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:21,846 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:54:21,846 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:54:21,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:54:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 377. [2020-02-10 19:54:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1288 transitions. [2020-02-10 19:54:21,857 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1288 transitions. Word has length 22 [2020-02-10 19:54:21,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:21,857 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1288 transitions. [2020-02-10 19:54:21,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1288 transitions. [2020-02-10 19:54:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:21,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:21,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 19:54:21,858 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 19:54:21,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:21,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1400175064, now seen corresponding path program 1523 times [2020-02-10 19:54:21,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:21,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455746465] [2020-02-10 19:54:21,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:22,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455746465] [2020-02-10 19:54:22,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:22,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:22,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127997526] [2020-02-10 19:54:22,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:22,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:22,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:22,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:22,160 INFO L87 Difference]: Start difference. First operand 377 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:54:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:22,240 INFO L93 Difference]: Finished difference Result 566 states and 1659 transitions. [2020-02-10 19:54:22,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:22,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:22,242 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:54:22,242 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:54:22,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 19:54:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:54:22,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 378. [2020-02-10 19:54:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:54:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1289 transitions. [2020-02-10 19:54:22,252 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1289 transitions. Word has length 22 [2020-02-10 19:54:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:22,252 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1289 transitions. [2020-02-10 19:54:22,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1289 transitions. [2020-02-10 19:54:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:22,253 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:22,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 19:54:22,253 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 19:54:22,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:22,253 INFO L82 PathProgramCache]: Analyzing trace with hash -864945262, now seen corresponding path program 1524 times [2020-02-10 19:54:22,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:22,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595771617] [2020-02-10 19:54:22,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:22,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 19:54:22,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595771617] [2020-02-10 19:54:22,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:22,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:22,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15266835] [2020-02-10 19:54:22,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:22,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:22,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:22,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:22,544 INFO L87 Difference]: Start difference. First operand 378 states and 1289 transitions. Second operand 9 states. [2020-02-10 19:54:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:22,646 INFO L93 Difference]: Finished difference Result 569 states and 1664 transitions. [2020-02-10 19:54:22,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:22,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:22,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:22,648 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:54:22,648 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:54:22,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 19:54:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:54:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 375. [2020-02-10 19:54:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1284 transitions. [2020-02-10 19:54:22,658 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1284 transitions. Word has length 22 [2020-02-10 19:54:22,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:22,658 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1284 transitions. [2020-02-10 19:54:22,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1284 transitions. [2020-02-10 19:54:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:22,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:22,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 19:54:22,658 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 19:54:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:22,659 INFO L82 PathProgramCache]: Analyzing trace with hash -541555744, now seen corresponding path program 1525 times [2020-02-10 19:54:22,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:22,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777361189] [2020-02-10 19:54:22,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:22,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 19:54:22,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777361189] [2020-02-10 19:54:22,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:22,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:22,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044084255] [2020-02-10 19:54:22,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:22,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:22,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:22,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:22,952 INFO L87 Difference]: Start difference. First operand 375 states and 1284 transitions. Second operand 9 states. [2020-02-10 19:54:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:23,032 INFO L93 Difference]: Finished difference Result 584 states and 1700 transitions. [2020-02-10 19:54:23,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:23,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:23,034 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:54:23,034 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:54:23,034 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:23,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:54:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 381. [2020-02-10 19:54:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:54:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1298 transitions. [2020-02-10 19:54:23,044 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1298 transitions. Word has length 22 [2020-02-10 19:54:23,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:23,044 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1298 transitions. [2020-02-10 19:54:23,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:23,044 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1298 transitions. [2020-02-10 19:54:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:23,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:23,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 19:54:23,045 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 19:54:23,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:23,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1503759406, now seen corresponding path program 1526 times [2020-02-10 19:54:23,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:23,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475083150] [2020-02-10 19:54:23,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:23,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 19:54:23,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475083150] [2020-02-10 19:54:23,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:23,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:23,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729950248] [2020-02-10 19:54:23,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:23,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:23,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:23,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:23,327 INFO L87 Difference]: Start difference. First operand 381 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:54:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:23,433 INFO L93 Difference]: Finished difference Result 578 states and 1686 transitions. [2020-02-10 19:54:23,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:23,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:23,435 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:54:23,436 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:54:23,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:54:23,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 378. [2020-02-10 19:54:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:54:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1291 transitions. [2020-02-10 19:54:23,446 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1291 transitions. Word has length 22 [2020-02-10 19:54:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:23,446 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1291 transitions. [2020-02-10 19:54:23,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1291 transitions. [2020-02-10 19:54:23,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:23,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:23,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 19:54:23,447 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 19:54:23,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:23,447 INFO L82 PathProgramCache]: Analyzing trace with hash 471136788, now seen corresponding path program 1527 times [2020-02-10 19:54:23,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:23,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873186106] [2020-02-10 19:54:23,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:23,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 19:54:23,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873186106] [2020-02-10 19:54:23,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:23,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:23,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342654320] [2020-02-10 19:54:23,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:23,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:23,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:23,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:23,745 INFO L87 Difference]: Start difference. First operand 378 states and 1291 transitions. Second operand 9 states. [2020-02-10 19:54:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:23,824 INFO L93 Difference]: Finished difference Result 588 states and 1707 transitions. [2020-02-10 19:54:23,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:23,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:23,825 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:54:23,826 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:54:23,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 19:54:23,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:54:23,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 383. [2020-02-10 19:54:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:54:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1299 transitions. [2020-02-10 19:54:23,835 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1299 transitions. Word has length 22 [2020-02-10 19:54:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:23,835 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1299 transitions. [2020-02-10 19:54:23,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1299 transitions. [2020-02-10 19:54:23,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:23,836 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:23,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 19:54:23,836 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 19:54:23,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1801913850, now seen corresponding path program 1528 times [2020-02-10 19:54:23,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:23,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069938607] [2020-02-10 19:54:23,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:24,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 19:54:24,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069938607] [2020-02-10 19:54:24,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:24,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:24,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764652199] [2020-02-10 19:54:24,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:24,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:24,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:24,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:24,131 INFO L87 Difference]: Start difference. First operand 383 states and 1299 transitions. Second operand 9 states. [2020-02-10 19:54:24,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:24,239 INFO L93 Difference]: Finished difference Result 584 states and 1695 transitions. [2020-02-10 19:54:24,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:24,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:24,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:24,240 INFO L225 Difference]: With dead ends: 584 [2020-02-10 19:54:24,241 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:54:24,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 19:54:24,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:54:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 378. [2020-02-10 19:54:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:54:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1288 transitions. [2020-02-10 19:54:24,250 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1288 transitions. Word has length 22 [2020-02-10 19:54:24,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:24,250 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1288 transitions. [2020-02-10 19:54:24,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:24,250 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1288 transitions. [2020-02-10 19:54:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:24,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:24,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 19:54:24,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 19:54:24,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:24,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1187715758, now seen corresponding path program 1529 times [2020-02-10 19:54:24,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:24,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686655427] [2020-02-10 19:54:24,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:24,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 19:54:24,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686655427] [2020-02-10 19:54:24,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:24,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:24,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026648570] [2020-02-10 19:54:24,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:24,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:24,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:24,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:24,543 INFO L87 Difference]: Start difference. First operand 378 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:54:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:24,657 INFO L93 Difference]: Finished difference Result 573 states and 1674 transitions. [2020-02-10 19:54:24,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:24,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:24,659 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:54:24,659 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:54: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 19:54:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:54:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 380. [2020-02-10 19:54:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:54:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1291 transitions. [2020-02-10 19:54:24,669 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1291 transitions. Word has length 22 [2020-02-10 19:54:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:24,669 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1291 transitions. [2020-02-10 19:54:24,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1291 transitions. [2020-02-10 19:54:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:24,669 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54: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 19:54:24,669 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 19:54:24,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:24,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1014468066, now seen corresponding path program 1530 times [2020-02-10 19:54:24,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:24,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53228558] [2020-02-10 19:54:24,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:24,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 19:54:24,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53228558] [2020-02-10 19:54:24,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:24,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:24,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551968007] [2020-02-10 19:54:24,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:24,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:24,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:24,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:24,965 INFO L87 Difference]: Start difference. First operand 380 states and 1291 transitions. Second operand 9 states. [2020-02-10 19:54:25,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:25,073 INFO L93 Difference]: Finished difference Result 575 states and 1676 transitions. [2020-02-10 19:54:25,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:25,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:25,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:25,075 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:54:25,075 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:54:25,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:54:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 375. [2020-02-10 19:54:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1282 transitions. [2020-02-10 19:54:25,084 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1282 transitions. Word has length 22 [2020-02-10 19:54:25,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:25,084 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1282 transitions. [2020-02-10 19:54:25,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1282 transitions. [2020-02-10 19:54:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:25,085 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:25,085 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:25,085 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 19:54:25,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash 996301420, now seen corresponding path program 1531 times [2020-02-10 19:54:25,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:25,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855448430] [2020-02-10 19:54:25,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:25,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 19:54:25,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855448430] [2020-02-10 19:54:25,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:25,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:25,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352410145] [2020-02-10 19:54:25,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:25,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:25,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:25,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:25,397 INFO L87 Difference]: Start difference. First operand 375 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:54:25,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:25,477 INFO L93 Difference]: Finished difference Result 553 states and 1631 transitions. [2020-02-10 19:54:25,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:25,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:25,479 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:54:25,479 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:54:25,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 19:54:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:54:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 377. [2020-02-10 19:54:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1286 transitions. [2020-02-10 19:54:25,488 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1286 transitions. Word has length 22 [2020-02-10 19:54:25,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:25,489 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1286 transitions. [2020-02-10 19:54:25,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:25,489 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1286 transitions. [2020-02-10 19:54:25,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:25,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:25,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 19:54:25,489 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 19:54:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:25,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1687724918, now seen corresponding path program 1532 times [2020-02-10 19:54:25,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:25,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664773444] [2020-02-10 19:54:25,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:25,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 19:54:25,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664773444] [2020-02-10 19:54:25,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:25,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:25,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691622947] [2020-02-10 19:54:25,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:25,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:25,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:25,795 INFO L87 Difference]: Start difference. First operand 377 states and 1286 transitions. Second operand 9 states. [2020-02-10 19:54:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:25,902 INFO L93 Difference]: Finished difference Result 554 states and 1632 transitions. [2020-02-10 19:54:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:25,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:25,904 INFO L225 Difference]: With dead ends: 554 [2020-02-10 19:54:25,904 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 19:54:25,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 19:54:25,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 19:54:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 376. [2020-02-10 19:54:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1284 transitions. [2020-02-10 19:54:25,912 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1284 transitions. Word has length 22 [2020-02-10 19:54:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:25,913 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1284 transitions. [2020-02-10 19:54:25,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1284 transitions. [2020-02-10 19:54:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:25,913 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:25,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 19:54:25,913 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 19:54:25,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:25,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2008993952, now seen corresponding path program 1533 times [2020-02-10 19:54:25,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:25,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404138458] [2020-02-10 19:54:25,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:26,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 19:54:26,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404138458] [2020-02-10 19:54:26,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:26,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:26,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517157262] [2020-02-10 19:54:26,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:26,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:26,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:26,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:26,219 INFO L87 Difference]: Start difference. First operand 376 states and 1284 transitions. Second operand 9 states. [2020-02-10 19:54:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:26,299 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-02-10 19:54:26,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:26,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:26,300 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:54:26,301 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:54:26,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 19:54:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:54:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 377. [2020-02-10 19:54:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1285 transitions. [2020-02-10 19:54:26,310 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1285 transitions. Word has length 22 [2020-02-10 19:54:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:26,310 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1285 transitions. [2020-02-10 19:54:26,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1285 transitions. [2020-02-10 19:54:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:26,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:26,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:26,311 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 19:54:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1750743542, now seen corresponding path program 1534 times [2020-02-10 19:54:26,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:26,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198282676] [2020-02-10 19:54:26,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:26,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 19:54:26,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198282676] [2020-02-10 19:54:26,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:26,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:26,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326504568] [2020-02-10 19:54:26,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:26,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:26,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:26,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:26,610 INFO L87 Difference]: Start difference. First operand 377 states and 1285 transitions. Second operand 9 states. [2020-02-10 19:54:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:26,731 INFO L93 Difference]: Finished difference Result 558 states and 1639 transitions. [2020-02-10 19:54:26,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:26,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:26,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:26,732 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:54:26,733 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:54:26,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 19:54:26,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:54:26,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 376. [2020-02-10 19:54:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1283 transitions. [2020-02-10 19:54:26,742 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1283 transitions. Word has length 22 [2020-02-10 19:54:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:26,742 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1283 transitions. [2020-02-10 19:54:26,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1283 transitions. [2020-02-10 19:54:26,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:26,742 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:26,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 19:54:26,743 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 19:54:26,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:26,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2019497056, now seen corresponding path program 1535 times [2020-02-10 19:54:26,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:26,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996597339] [2020-02-10 19:54:26,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:27,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 19:54:27,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996597339] [2020-02-10 19:54:27,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:27,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:27,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999076621] [2020-02-10 19:54:27,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:27,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:27,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:27,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:27,035 INFO L87 Difference]: Start difference. First operand 376 states and 1283 transitions. Second operand 9 states. [2020-02-10 19:54:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:27,140 INFO L93 Difference]: Finished difference Result 558 states and 1640 transitions. [2020-02-10 19:54:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:27,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:27,142 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:54:27,142 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:54:27,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:54:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 378. [2020-02-10 19:54:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:54:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1286 transitions. [2020-02-10 19:54:27,152 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1286 transitions. Word has length 22 [2020-02-10 19:54:27,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:27,152 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1286 transitions. [2020-02-10 19:54:27,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:27,152 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1286 transitions. [2020-02-10 19:54:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:27,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:27,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:27,153 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 19:54:27,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:27,153 INFO L82 PathProgramCache]: Analyzing trace with hash 943785900, now seen corresponding path program 1536 times [2020-02-10 19:54:27,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:27,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696185521] [2020-02-10 19:54:27,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:27,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 19:54:27,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696185521] [2020-02-10 19:54:27,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:27,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:27,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566520423] [2020-02-10 19:54:27,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:27,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:27,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:27,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:27,445 INFO L87 Difference]: Start difference. First operand 378 states and 1286 transitions. Second operand 9 states. [2020-02-10 19:54:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:27,554 INFO L93 Difference]: Finished difference Result 560 states and 1642 transitions. [2020-02-10 19:54:27,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:27,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:27,556 INFO L225 Difference]: With dead ends: 560 [2020-02-10 19:54:27,556 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 19:54:27,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:27,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 19:54:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 373. [2020-02-10 19:54:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1278 transitions. [2020-02-10 19:54:27,565 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1278 transitions. Word has length 22 [2020-02-10 19:54:27,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:27,565 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1278 transitions. [2020-02-10 19:54:27,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1278 transitions. [2020-02-10 19:54:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:27,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:27,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:27,566 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 19:54:27,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:27,566 INFO L82 PathProgramCache]: Analyzing trace with hash -383042890, now seen corresponding path program 1537 times [2020-02-10 19:54:27,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:27,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340267415] [2020-02-10 19:54:27,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:27,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 19:54:27,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340267415] [2020-02-10 19:54:27,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:27,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:27,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553883526] [2020-02-10 19:54:27,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:27,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:27,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:27,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:27,897 INFO L87 Difference]: Start difference. First operand 373 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:54:28,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:28,003 INFO L93 Difference]: Finished difference Result 542 states and 1608 transitions. [2020-02-10 19:54:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:28,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:28,005 INFO L225 Difference]: With dead ends: 542 [2020-02-10 19:54:28,005 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:54:28,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 19:54:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:54:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 376. [2020-02-10 19:54:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1286 transitions. [2020-02-10 19:54:28,014 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1286 transitions. Word has length 22 [2020-02-10 19:54:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:28,014 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1286 transitions. [2020-02-10 19:54:28,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:28,015 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1286 transitions. [2020-02-10 19:54:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:28,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:28,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 19:54:28,015 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 19:54:28,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:28,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1828559900, now seen corresponding path program 1538 times [2020-02-10 19:54:28,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:28,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767019988] [2020-02-10 19:54:28,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:28,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 19:54:28,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767019988] [2020-02-10 19:54:28,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:28,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:28,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661365724] [2020-02-10 19:54:28,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:28,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:28,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:28,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:28,330 INFO L87 Difference]: Start difference. First operand 376 states and 1286 transitions. Second operand 9 states. [2020-02-10 19:54:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:28,413 INFO L93 Difference]: Finished difference Result 540 states and 1603 transitions. [2020-02-10 19:54:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:28,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:28,415 INFO L225 Difference]: With dead ends: 540 [2020-02-10 19:54:28,415 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 19:54:28,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 19:54:28,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 19:54:28,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 375. [2020-02-10 19:54:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1284 transitions. [2020-02-10 19:54:28,424 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1284 transitions. Word has length 22 [2020-02-10 19:54:28,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:28,425 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1284 transitions. [2020-02-10 19:54:28,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:28,425 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1284 transitions. [2020-02-10 19:54:28,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:28,425 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:28,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 19:54:28,425 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 19:54:28,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:28,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1983480744, now seen corresponding path program 1539 times [2020-02-10 19:54:28,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:28,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145539050] [2020-02-10 19:54:28,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:28,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 19:54:28,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145539050] [2020-02-10 19:54:28,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:28,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:28,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241692693] [2020-02-10 19:54:28,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:28,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:28,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:28,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:28,734 INFO L87 Difference]: Start difference. First operand 375 states and 1284 transitions. Second operand 9 states. [2020-02-10 19:54:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:28,835 INFO L93 Difference]: Finished difference Result 544 states and 1612 transitions. [2020-02-10 19:54:28,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:28,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:28,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:28,837 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:54:28,837 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:54:28,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:54:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 377. [2020-02-10 19:54:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1287 transitions. [2020-02-10 19:54:28,847 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1287 transitions. Word has length 22 [2020-02-10 19:54:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:28,847 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1287 transitions. [2020-02-10 19:54:28,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1287 transitions. [2020-02-10 19:54:28,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:28,848 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:28,848 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:28,848 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 19:54:28,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:28,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1730387992, now seen corresponding path program 1540 times [2020-02-10 19:54:28,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:28,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443058265] [2020-02-10 19:54:28,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:29,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443058265] [2020-02-10 19:54:29,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:29,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:29,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940166230] [2020-02-10 19:54:29,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:29,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:29,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:29,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:29,159 INFO L87 Difference]: Start difference. First operand 377 states and 1287 transitions. Second operand 9 states. [2020-02-10 19:54:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:29,267 INFO L93 Difference]: Finished difference Result 543 states and 1608 transitions. [2020-02-10 19:54:29,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:29,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:29,269 INFO L225 Difference]: With dead ends: 543 [2020-02-10 19:54:29,269 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:54:29,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:54:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 375. [2020-02-10 19:54:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1283 transitions. [2020-02-10 19:54:29,280 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1283 transitions. Word has length 22 [2020-02-10 19:54:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:29,280 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1283 transitions. [2020-02-10 19:54:29,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1283 transitions. [2020-02-10 19:54:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:29,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:29,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 19:54:29,281 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 19:54:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:29,281 INFO L82 PathProgramCache]: Analyzing trace with hash -734468312, now seen corresponding path program 1541 times [2020-02-10 19:54:29,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:29,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911496624] [2020-02-10 19:54:29,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:29,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 19:54:29,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911496624] [2020-02-10 19:54:29,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:29,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:29,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214796076] [2020-02-10 19:54:29,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:29,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:29,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:29,607 INFO L87 Difference]: Start difference. First operand 375 states and 1283 transitions. Second operand 9 states. [2020-02-10 19:54:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:29,686 INFO L93 Difference]: Finished difference Result 539 states and 1600 transitions. [2020-02-10 19:54:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:29,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:29,688 INFO L225 Difference]: With dead ends: 539 [2020-02-10 19:54:29,688 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 19:54:29,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 19:54:29,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 376. [2020-02-10 19:54:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1284 transitions. [2020-02-10 19:54:29,699 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1284 transitions. Word has length 22 [2020-02-10 19:54:29,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:29,699 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1284 transitions. [2020-02-10 19:54:29,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:29,699 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1284 transitions. [2020-02-10 19:54:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:29,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:29,700 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:29,700 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 19:54:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:29,700 INFO L82 PathProgramCache]: Analyzing trace with hash 876472646, now seen corresponding path program 1542 times [2020-02-10 19:54:29,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:29,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340448140] [2020-02-10 19:54:29,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:30,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 19:54:30,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340448140] [2020-02-10 19:54:30,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:30,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:30,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485373935] [2020-02-10 19:54:30,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:30,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:30,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:30,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:30,019 INFO L87 Difference]: Start difference. First operand 376 states and 1284 transitions. Second operand 9 states. [2020-02-10 19:54:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:30,124 INFO L93 Difference]: Finished difference Result 540 states and 1601 transitions. [2020-02-10 19:54:30,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:30,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:30,126 INFO L225 Difference]: With dead ends: 540 [2020-02-10 19:54:30,126 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 19:54:30,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 19:54:30,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 19:54:30,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 374. [2020-02-10 19:54:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:54:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1281 transitions. [2020-02-10 19:54:30,136 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1281 transitions. Word has length 22 [2020-02-10 19:54:30,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:30,136 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1281 transitions. [2020-02-10 19:54:30,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:30,136 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1281 transitions. [2020-02-10 19:54:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:30,136 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:30,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 19:54:30,137 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 19:54:30,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:30,137 INFO L82 PathProgramCache]: Analyzing trace with hash 945654530, now seen corresponding path program 1543 times [2020-02-10 19:54:30,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:30,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466530059] [2020-02-10 19:54:30,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:30,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 19:54:30,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466530059] [2020-02-10 19:54:30,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:30,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:30,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086112296] [2020-02-10 19:54:30,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:30,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:30,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:30,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:30,445 INFO L87 Difference]: Start difference. First operand 374 states and 1281 transitions. Second operand 9 states. [2020-02-10 19:54:30,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:30,552 INFO L93 Difference]: Finished difference Result 545 states and 1614 transitions. [2020-02-10 19:54:30,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:30,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:30,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:30,554 INFO L225 Difference]: With dead ends: 545 [2020-02-10 19:54:30,554 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 19:54:30,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 19:54:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 19:54:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 376. [2020-02-10 19:54:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1285 transitions. [2020-02-10 19:54:30,563 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1285 transitions. Word has length 22 [2020-02-10 19:54:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:30,563 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1285 transitions. [2020-02-10 19:54:30,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1285 transitions. [2020-02-10 19:54:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:30,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:30,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 19:54:30,564 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 19:54:30,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:30,564 INFO L82 PathProgramCache]: Analyzing trace with hash -499862480, now seen corresponding path program 1544 times [2020-02-10 19:54:30,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:30,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744758865] [2020-02-10 19:54:30,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:30,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 19:54:30,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744758865] [2020-02-10 19:54:30,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:30,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:30,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94180838] [2020-02-10 19:54:30,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:30,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:30,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:30,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:30,872 INFO L87 Difference]: Start difference. First operand 376 states and 1285 transitions. Second operand 9 states. [2020-02-10 19:54:30,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:30,961 INFO L93 Difference]: Finished difference Result 543 states and 1609 transitions. [2020-02-10 19:54:30,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:30,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:30,963 INFO L225 Difference]: With dead ends: 543 [2020-02-10 19:54:30,963 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:54:30,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:54:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 375. [2020-02-10 19:54:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1283 transitions. [2020-02-10 19:54:30,971 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1283 transitions. Word has length 22 [2020-02-10 19:54:30,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:30,971 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1283 transitions. [2020-02-10 19:54:30,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1283 transitions. [2020-02-10 19:54:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:30,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:30,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 19:54:30,978 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 19:54:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash 357909208, now seen corresponding path program 1545 times [2020-02-10 19:54:30,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:30,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018223409] [2020-02-10 19:54:30,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:31,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 19:54:31,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018223409] [2020-02-10 19:54:31,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:31,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:31,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658874004] [2020-02-10 19:54:31,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:31,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:31,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:31,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:31,287 INFO L87 Difference]: Start difference. First operand 375 states and 1283 transitions. Second operand 9 states. [2020-02-10 19:54:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:31,394 INFO L93 Difference]: Finished difference Result 550 states and 1625 transitions. [2020-02-10 19:54:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:31,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:31,396 INFO L225 Difference]: With dead ends: 550 [2020-02-10 19:54:31,396 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 19:54:31,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 19:54:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 19:54:31,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 378. [2020-02-10 19:54:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:54:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1288 transitions. [2020-02-10 19:54:31,405 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1288 transitions. Word has length 22 [2020-02-10 19:54:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:31,405 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1288 transitions. [2020-02-10 19:54:31,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:31,405 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1288 transitions. [2020-02-10 19:54:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:31,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:31,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 19:54:31,406 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 19:54:31,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:31,406 INFO L82 PathProgramCache]: Analyzing trace with hash 659927152, now seen corresponding path program 1546 times [2020-02-10 19:54:31,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:31,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078729816] [2020-02-10 19:54:31,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:31,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078729816] [2020-02-10 19:54:31,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:31,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:31,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030292624] [2020-02-10 19:54:31,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:31,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:31,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:31,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:31,708 INFO L87 Difference]: Start difference. First operand 378 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:54:31,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:31,846 INFO L93 Difference]: Finished difference Result 551 states and 1624 transitions. [2020-02-10 19:54:31,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:31,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:31,848 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:54:31,848 INFO L226 Difference]: Without dead ends: 536 [2020-02-10 19:54:31,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 19:54:31,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-02-10 19:54:31,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 375. [2020-02-10 19:54:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1282 transitions. [2020-02-10 19:54:31,858 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1282 transitions. Word has length 22 [2020-02-10 19:54:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:31,859 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1282 transitions. [2020-02-10 19:54:31,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1282 transitions. [2020-02-10 19:54:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:31,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:31,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 19:54:31,859 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 19:54:31,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:31,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1606921640, now seen corresponding path program 1547 times [2020-02-10 19:54:31,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:31,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807108540] [2020-02-10 19:54:31,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:32,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 19:54:32,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807108540] [2020-02-10 19:54:32,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:32,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:32,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278280875] [2020-02-10 19:54:32,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:32,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:32,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:32,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:32,165 INFO L87 Difference]: Start difference. First operand 375 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:54:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:32,275 INFO L93 Difference]: Finished difference Result 544 states and 1610 transitions. [2020-02-10 19:54:32,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:32,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:32,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:32,277 INFO L225 Difference]: With dead ends: 544 [2020-02-10 19:54:32,277 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:54:32,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 19:54:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:54:32,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 376. [2020-02-10 19:54:32,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1283 transitions. [2020-02-10 19:54:32,286 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1283 transitions. Word has length 22 [2020-02-10 19:54:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:32,286 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1283 transitions. [2020-02-10 19:54:32,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1283 transitions. [2020-02-10 19:54:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:32,287 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:32,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 19:54:32,287 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 19:54:32,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:32,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2142151442, now seen corresponding path program 1548 times [2020-02-10 19:54:32,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:32,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419766315] [2020-02-10 19:54:32,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:32,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 19:54:32,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419766315] [2020-02-10 19:54:32,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:32,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:32,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272532593] [2020-02-10 19:54:32,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:32,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:32,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:32,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:32,618 INFO L87 Difference]: Start difference. First operand 376 states and 1283 transitions. Second operand 9 states. [2020-02-10 19:54:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:32,736 INFO L93 Difference]: Finished difference Result 547 states and 1615 transitions. [2020-02-10 19:54:32,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:32,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:32,738 INFO L225 Difference]: With dead ends: 547 [2020-02-10 19:54:32,738 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:54:32,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 19:54:32,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:54:32,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 374. [2020-02-10 19:54:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:54:32,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1280 transitions. [2020-02-10 19:54:32,749 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1280 transitions. Word has length 22 [2020-02-10 19:54:32,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:32,749 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1280 transitions. [2020-02-10 19:54:32,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1280 transitions. [2020-02-10 19:54:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:32,750 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:32,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 19:54:32,750 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 19:54:32,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:32,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1271250754, now seen corresponding path program 1549 times [2020-02-10 19:54:32,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:32,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234075657] [2020-02-10 19:54:32,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:33,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 19:54:33,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234075657] [2020-02-10 19:54:33,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:33,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:33,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139074753] [2020-02-10 19:54:33,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:33,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:33,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:33,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:33,057 INFO L87 Difference]: Start difference. First operand 374 states and 1280 transitions. Second operand 9 states. [2020-02-10 19:54:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:33,164 INFO L93 Difference]: Finished difference Result 551 states and 1630 transitions. [2020-02-10 19:54:33,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:33,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:33,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:33,166 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:54:33,166 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 19:54:33,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 19:54:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 19:54:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 378. [2020-02-10 19:54:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:54:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1290 transitions. [2020-02-10 19:54:33,176 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1290 transitions. Word has length 22 [2020-02-10 19:54:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:33,176 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1290 transitions. [2020-02-10 19:54:33,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1290 transitions. [2020-02-10 19:54:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:33,177 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:33,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 19:54:33,177 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 19:54:33,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:33,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1524343506, now seen corresponding path program 1550 times [2020-02-10 19:54:33,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:33,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511072823] [2020-02-10 19:54:33,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:33,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 19:54:33,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511072823] [2020-02-10 19:54:33,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:33,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:33,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279171913] [2020-02-10 19:54:33,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:33,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:33,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:33,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:33,481 INFO L87 Difference]: Start difference. First operand 378 states and 1290 transitions. Second operand 9 states. [2020-02-10 19:54:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:33,586 INFO L93 Difference]: Finished difference Result 550 states and 1626 transitions. [2020-02-10 19:54:33,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:33,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:33,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:33,588 INFO L225 Difference]: With dead ends: 550 [2020-02-10 19:54:33,588 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 19:54:33,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 19:54:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 19:54:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 376. [2020-02-10 19:54:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1285 transitions. [2020-02-10 19:54:33,597 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1285 transitions. Word has length 22 [2020-02-10 19:54:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:33,598 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1285 transitions. [2020-02-10 19:54:33,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1285 transitions. [2020-02-10 19:54:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:33,598 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:33,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 19:54:33,598 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 19:54:33,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:33,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2011024010, now seen corresponding path program 1551 times [2020-02-10 19:54:33,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:33,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727337011] [2020-02-10 19:54:33,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:33,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 19:54:33,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727337011] [2020-02-10 19:54:33,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:33,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:33,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564639286] [2020-02-10 19:54:33,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:33,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:33,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:33,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:33,905 INFO L87 Difference]: Start difference. First operand 376 states and 1285 transitions. Second operand 9 states. [2020-02-10 19:54:34,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:34,015 INFO L93 Difference]: Finished difference Result 554 states and 1635 transitions. [2020-02-10 19:54:34,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:34,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:34,017 INFO L225 Difference]: With dead ends: 554 [2020-02-10 19:54:34,017 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 19:54:34,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 19:54:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 19:54:34,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 379. [2020-02-10 19:54:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:54:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1290 transitions. [2020-02-10 19:54:34,027 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1290 transitions. Word has length 22 [2020-02-10 19:54:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:34,027 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1290 transitions. [2020-02-10 19:54:34,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:34,028 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1290 transitions. [2020-02-10 19:54:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:34,028 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54: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 19:54:34,028 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 19:54:34,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:34,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1709006066, now seen corresponding path program 1552 times [2020-02-10 19:54:34,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:34,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498971336] [2020-02-10 19:54:34,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:34,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 19:54:34,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498971336] [2020-02-10 19:54:34,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:34,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:34,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842153145] [2020-02-10 19:54:34,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:34,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:34,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:34,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:34,354 INFO L87 Difference]: Start difference. First operand 379 states and 1290 transitions. Second operand 9 states. [2020-02-10 19:54:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:34,469 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-02-10 19:54:34,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:34,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:34,471 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:54:34,471 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 19:54:34,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 19:54:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 19:54:34,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 376. [2020-02-10 19:54:34,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1283 transitions. [2020-02-10 19:54:34,480 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1283 transitions. Word has length 22 [2020-02-10 19:54:34,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:34,481 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1283 transitions. [2020-02-10 19:54:34,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1283 transitions. [2020-02-10 19:54:34,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:34,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:34,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:34,481 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 19:54:34,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:34,482 INFO L82 PathProgramCache]: Analyzing trace with hash 993936754, now seen corresponding path program 1553 times [2020-02-10 19:54:34,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:34,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659919014] [2020-02-10 19:54:34,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:34,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 19:54:34,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659919014] [2020-02-10 19:54:34,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:34,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:34,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510734892] [2020-02-10 19:54:34,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:34,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:34,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:34,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:34,777 INFO L87 Difference]: Start difference. First operand 376 states and 1283 transitions. Second operand 9 states. [2020-02-10 19:54:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:34,885 INFO L93 Difference]: Finished difference Result 551 states and 1626 transitions. [2020-02-10 19:54:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:34,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:34,887 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:54:34,887 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:54:34,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:54:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 378. [2020-02-10 19:54:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:54:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1286 transitions. [2020-02-10 19:54:34,897 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1286 transitions. Word has length 22 [2020-02-10 19:54:34,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:34,897 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1286 transitions. [2020-02-10 19:54:34,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1286 transitions. [2020-02-10 19:54:34,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:34,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:34,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 19:54:34,898 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 19:54:34,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:34,898 INFO L82 PathProgramCache]: Analyzing trace with hash 820689062, now seen corresponding path program 1554 times [2020-02-10 19:54:34,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:34,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719850512] [2020-02-10 19:54:34,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:35,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 19:54:35,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719850512] [2020-02-10 19:54:35,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:35,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:35,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030392846] [2020-02-10 19:54:35,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:35,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:35,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:35,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:35,199 INFO L87 Difference]: Start difference. First operand 378 states and 1286 transitions. Second operand 9 states. [2020-02-10 19:54:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:35,312 INFO L93 Difference]: Finished difference Result 553 states and 1628 transitions. [2020-02-10 19:54:35,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:35,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:35,314 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:54:35,314 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:54:35,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 19:54:35,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:54:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 374. [2020-02-10 19:54:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:54:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1279 transitions. [2020-02-10 19:54:35,324 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1279 transitions. Word has length 22 [2020-02-10 19:54:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:35,324 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1279 transitions. [2020-02-10 19:54:35,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1279 transitions. [2020-02-10 19:54:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:35,325 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:35,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 19:54:35,325 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 19:54:35,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash 151329968, now seen corresponding path program 1555 times [2020-02-10 19:54:35,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:35,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779072582] [2020-02-10 19:54:35,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:35,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 19:54:35,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779072582] [2020-02-10 19:54:35,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:35,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:35,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975023195] [2020-02-10 19:54:35,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:35,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:35,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:35,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:35,635 INFO L87 Difference]: Start difference. First operand 374 states and 1279 transitions. Second operand 9 states. [2020-02-10 19:54:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:35,720 INFO L93 Difference]: Finished difference Result 540 states and 1601 transitions. [2020-02-10 19:54:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:35,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:35,722 INFO L225 Difference]: With dead ends: 540 [2020-02-10 19:54:35,722 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:54:35,722 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:54:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 376. [2020-02-10 19:54:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1283 transitions. [2020-02-10 19:54:35,730 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1283 transitions. Word has length 22 [2020-02-10 19:54:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:35,730 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1283 transitions. [2020-02-10 19:54:35,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1283 transitions. [2020-02-10 19:54:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:35,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:35,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 19:54:35,731 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 19:54:35,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:35,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1762270926, now seen corresponding path program 1556 times [2020-02-10 19:54:35,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:35,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777665705] [2020-02-10 19:54:35,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:36,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 19:54:36,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777665705] [2020-02-10 19:54:36,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:36,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:36,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423899454] [2020-02-10 19:54:36,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:36,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:36,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:36,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:36,050 INFO L87 Difference]: Start difference. First operand 376 states and 1283 transitions. Second operand 9 states. [2020-02-10 19:54:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:36,159 INFO L93 Difference]: Finished difference Result 541 states and 1602 transitions. [2020-02-10 19:54:36,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:36,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:36,161 INFO L225 Difference]: With dead ends: 541 [2020-02-10 19:54:36,161 INFO L226 Difference]: Without dead ends: 530 [2020-02-10 19:54:36,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 19:54:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-02-10 19:54:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 375. [2020-02-10 19:54:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1281 transitions. [2020-02-10 19:54:36,170 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1281 transitions. Word has length 22 [2020-02-10 19:54:36,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:36,170 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1281 transitions. [2020-02-10 19:54:36,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1281 transitions. [2020-02-10 19:54:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:36,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:36,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 19:54:36,171 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 19:54:36,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:36,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1164022500, now seen corresponding path program 1557 times [2020-02-10 19:54:36,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:36,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322680620] [2020-02-10 19:54:36,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:36,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 19:54:36,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322680620] [2020-02-10 19:54:36,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:36,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:36,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538278003] [2020-02-10 19:54:36,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:36,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:36,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:36,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:36,481 INFO L87 Difference]: Start difference. First operand 375 states and 1281 transitions. Second operand 9 states. [2020-02-10 19:54:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:36,594 INFO L93 Difference]: Finished difference Result 542 states and 1604 transitions. [2020-02-10 19:54:36,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:36,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:36,596 INFO L225 Difference]: With dead ends: 542 [2020-02-10 19:54:36,596 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:54:36,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 19:54:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:54:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 376. [2020-02-10 19:54:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1282 transitions. [2020-02-10 19:54:36,606 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1282 transitions. Word has length 22 [2020-02-10 19:54:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:36,606 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1282 transitions. [2020-02-10 19:54:36,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1282 transitions. [2020-02-10 19:54:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:36,607 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:36,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 19:54:36,607 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 19:54:36,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:36,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1699252302, now seen corresponding path program 1558 times [2020-02-10 19:54:36,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:36,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680650866] [2020-02-10 19:54:36,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:36,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680650866] [2020-02-10 19:54:36,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:36,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:36,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848467095] [2020-02-10 19:54:36,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:36,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:36,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:36,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:36,904 INFO L87 Difference]: Start difference. First operand 376 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:54:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:37,012 INFO L93 Difference]: Finished difference Result 545 states and 1609 transitions. [2020-02-10 19:54:37,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:37,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:37,014 INFO L225 Difference]: With dead ends: 545 [2020-02-10 19:54:37,014 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 19:54:37,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 19:54:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 375. [2020-02-10 19:54:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1280 transitions. [2020-02-10 19:54:37,024 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1280 transitions. Word has length 22 [2020-02-10 19:54:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:37,024 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1280 transitions. [2020-02-10 19:54:37,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1280 transitions. [2020-02-10 19:54:37,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:37,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:37,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 19:54:37,025 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 19:54:37,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:37,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1174525604, now seen corresponding path program 1559 times [2020-02-10 19:54:37,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:37,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553047179] [2020-02-10 19:54:37,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:37,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 19:54:37,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553047179] [2020-02-10 19:54:37,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:37,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:37,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467551292] [2020-02-10 19:54:37,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:37,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:37,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:37,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:37,328 INFO L87 Difference]: Start difference. First operand 375 states and 1280 transitions. Second operand 9 states. [2020-02-10 19:54:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:37,440 INFO L93 Difference]: Finished difference Result 545 states and 1610 transitions. [2020-02-10 19:54:37,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:37,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:37,442 INFO L225 Difference]: With dead ends: 545 [2020-02-10 19:54:37,442 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:54:37,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 19:54:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:54:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 377. [2020-02-10 19:54:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1283 transitions. [2020-02-10 19:54:37,452 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1283 transitions. Word has length 22 [2020-02-10 19:54:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:37,452 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1283 transitions. [2020-02-10 19:54:37,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1283 transitions. [2020-02-10 19:54:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:37,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:37,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 19:54:37,453 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 19:54:37,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:37,453 INFO L82 PathProgramCache]: Analyzing trace with hash 98814448, now seen corresponding path program 1560 times [2020-02-10 19:54:37,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:37,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998249470] [2020-02-10 19:54:37,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:37,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 19:54:37,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998249470] [2020-02-10 19:54:37,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:37,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:37,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23860025] [2020-02-10 19:54:37,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:37,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:37,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:37,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:37,756 INFO L87 Difference]: Start difference. First operand 377 states and 1283 transitions. Second operand 9 states. [2020-02-10 19:54:37,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:37,883 INFO L93 Difference]: Finished difference Result 547 states and 1612 transitions. [2020-02-10 19:54:37,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:37,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:37,885 INFO L225 Difference]: With dead ends: 547 [2020-02-10 19:54:37,885 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 19:54:37,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 19:54:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 19:54:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 371. [2020-02-10 19:54:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:54:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1274 transitions. [2020-02-10 19:54:37,894 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1274 transitions. Word has length 22 [2020-02-10 19:54:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:37,894 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1274 transitions. [2020-02-10 19:54:37,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:37,894 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1274 transitions. [2020-02-10 19:54:37,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:37,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:37,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 19:54:37,895 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 19:54:37,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:37,895 INFO L82 PathProgramCache]: Analyzing trace with hash -453357114, now seen corresponding path program 1561 times [2020-02-10 19:54:37,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:37,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286658336] [2020-02-10 19:54:37,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:38,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 19:54:38,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286658336] [2020-02-10 19:54:38,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:38,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:38,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279853906] [2020-02-10 19:54:38,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:38,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:38,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:38,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:38,166 INFO L87 Difference]: Start difference. First operand 371 states and 1274 transitions. Second operand 9 states. [2020-02-10 19:54:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:38,248 INFO L93 Difference]: Finished difference Result 576 states and 1678 transitions. [2020-02-10 19:54:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:38,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:38,250 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:54:38,250 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:54:38,250 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:54:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 377. [2020-02-10 19:54:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1286 transitions. [2020-02-10 19:54:38,259 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1286 transitions. Word has length 22 [2020-02-10 19:54:38,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:38,259 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1286 transitions. [2020-02-10 19:54:38,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1286 transitions. [2020-02-10 19:54:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:38,260 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:38,260 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:38,260 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 19:54:38,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:38,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1136908772, now seen corresponding path program 1562 times [2020-02-10 19:54:38,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:38,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006389946] [2020-02-10 19:54:38,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:38,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 19:54:38,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006389946] [2020-02-10 19:54:38,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:38,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:38,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208793080] [2020-02-10 19:54:38,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:38,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:38,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:38,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:38,530 INFO L87 Difference]: Start difference. First operand 377 states and 1286 transitions. Second operand 9 states. [2020-02-10 19:54:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:38,647 INFO L93 Difference]: Finished difference Result 571 states and 1665 transitions. [2020-02-10 19:54:38,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:38,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:38,648 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:54:38,649 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:54:38,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 19:54:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:54:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 373. [2020-02-10 19:54:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1278 transitions. [2020-02-10 19:54:38,658 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1278 transitions. Word has length 22 [2020-02-10 19:54:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:38,658 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1278 transitions. [2020-02-10 19:54:38,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:38,658 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1278 transitions. [2020-02-10 19:54:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:38,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:38,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 19:54:38,659 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 19:54:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash 899193206, now seen corresponding path program 1563 times [2020-02-10 19:54:38,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:38,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241164517] [2020-02-10 19:54:38,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:38,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 19:54:38,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241164517] [2020-02-10 19:54:38,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:38,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:38,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171669188] [2020-02-10 19:54:38,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:38,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:38,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:38,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:38,935 INFO L87 Difference]: Start difference. First operand 373 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:54:39,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:39,024 INFO L93 Difference]: Finished difference Result 572 states and 1666 transitions. [2020-02-10 19:54:39,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:39,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:39,026 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:54:39,026 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:54:39,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 19:54:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:54:39,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 375. [2020-02-10 19:54:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1280 transitions. [2020-02-10 19:54:39,036 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1280 transitions. Word has length 22 [2020-02-10 19:54:39,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:39,036 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1280 transitions. [2020-02-10 19:54:39,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1280 transitions. [2020-02-10 19:54:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:39,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:39,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 19:54:39,037 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 19:54:39,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:39,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1460261698, now seen corresponding path program 1564 times [2020-02-10 19:54:39,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:39,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347129750] [2020-02-10 19:54:39,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:39,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347129750] [2020-02-10 19:54:39,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:39,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:39,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475996071] [2020-02-10 19:54:39,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:39,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:39,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:39,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:39,320 INFO L87 Difference]: Start difference. First operand 375 states and 1280 transitions. Second operand 9 states. [2020-02-10 19:54:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:39,407 INFO L93 Difference]: Finished difference Result 565 states and 1651 transitions. [2020-02-10 19:54:39,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:39,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:39,409 INFO L225 Difference]: With dead ends: 565 [2020-02-10 19:54:39,409 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:54:39,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 19:54:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:54:39,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 373. [2020-02-10 19:54:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1276 transitions. [2020-02-10 19:54:39,418 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1276 transitions. Word has length 22 [2020-02-10 19:54:39,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:39,418 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1276 transitions. [2020-02-10 19:54:39,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1276 transitions. [2020-02-10 19:54:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:39,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:39,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 19:54:39,419 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 19:54:39,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:39,419 INFO L82 PathProgramCache]: Analyzing trace with hash -295097000, now seen corresponding path program 1565 times [2020-02-10 19:54:39,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:39,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929205184] [2020-02-10 19:54:39,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:39,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 19:54:39,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929205184] [2020-02-10 19:54:39,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:39,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:39,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658739221] [2020-02-10 19:54:39,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:39,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:39,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:39,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:39,701 INFO L87 Difference]: Start difference. First operand 373 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:54:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:39,824 INFO L93 Difference]: Finished difference Result 561 states and 1644 transitions. [2020-02-10 19:54:39,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:39,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:39,826 INFO L225 Difference]: With dead ends: 561 [2020-02-10 19:54:39,826 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 19:54:39,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 19:54:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 19:54:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 374. [2020-02-10 19:54:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:54:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1277 transitions. [2020-02-10 19:54:39,835 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1277 transitions. Word has length 22 [2020-02-10 19:54:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:39,835 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1277 transitions. [2020-02-10 19:54:39,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1277 transitions. [2020-02-10 19:54:39,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:39,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:39,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 19:54:39,836 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 19:54:39,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:39,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1740614010, now seen corresponding path program 1566 times [2020-02-10 19:54:39,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:39,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304460506] [2020-02-10 19:54:39,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:40,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 19:54:40,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304460506] [2020-02-10 19:54:40,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:40,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:40,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988544635] [2020-02-10 19:54:40,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:40,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:40,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:40,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:40,125 INFO L87 Difference]: Start difference. First operand 374 states and 1277 transitions. Second operand 9 states. [2020-02-10 19:54:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:40,210 INFO L93 Difference]: Finished difference Result 559 states and 1639 transitions. [2020-02-10 19:54:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:40,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:40,212 INFO L225 Difference]: With dead ends: 559 [2020-02-10 19:54:40,212 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:54:40,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 19:54:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:54:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 371. [2020-02-10 19:54:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:54:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1272 transitions. [2020-02-10 19:54:40,222 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1272 transitions. Word has length 22 [2020-02-10 19:54:40,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:40,222 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1272 transitions. [2020-02-10 19:54:40,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1272 transitions. [2020-02-10 19:54:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:40,223 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:40,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 19:54:40,223 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 19:54:40,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:40,223 INFO L82 PathProgramCache]: Analyzing trace with hash -875842840, now seen corresponding path program 1567 times [2020-02-10 19:54:40,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:40,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755659462] [2020-02-10 19:54:40,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:40,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 19:54:40,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755659462] [2020-02-10 19:54:40,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:40,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:40,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876089796] [2020-02-10 19:54:40,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:40,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:40,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:40,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:40,508 INFO L87 Difference]: Start difference. First operand 371 states and 1272 transitions. Second operand 9 states. [2020-02-10 19:54:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:40,589 INFO L93 Difference]: Finished difference Result 580 states and 1688 transitions. [2020-02-10 19:54:40,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:40,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:40,591 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:54:40,591 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:54:40,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 19:54:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:54:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 378. [2020-02-10 19:54:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:54:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1288 transitions. [2020-02-10 19:54:40,600 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1288 transitions. Word has length 22 [2020-02-10 19:54:40,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:40,600 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1288 transitions. [2020-02-10 19:54:40,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:40,600 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1288 transitions. [2020-02-10 19:54:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:40,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:40,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 19:54:40,601 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 19:54:40,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:40,601 INFO L82 PathProgramCache]: Analyzing trace with hash 714423046, now seen corresponding path program 1568 times [2020-02-10 19:54:40,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:40,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468049345] [2020-02-10 19:54:40,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:40,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 19:54:40,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468049345] [2020-02-10 19:54:40,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:40,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:40,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127715080] [2020-02-10 19:54:40,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:40,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:40,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:40,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:40,887 INFO L87 Difference]: Start difference. First operand 378 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:54:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:40,997 INFO L93 Difference]: Finished difference Result 575 states and 1675 transitions. [2020-02-10 19:54:40,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:40,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:40,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:40,999 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:54:40,999 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:54:40,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 19:54:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:54:41,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 374. [2020-02-10 19:54:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:54:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1279 transitions. [2020-02-10 19:54:41,009 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1279 transitions. Word has length 22 [2020-02-10 19:54:41,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:41,009 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1279 transitions. [2020-02-10 19:54:41,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1279 transitions. [2020-02-10 19:54:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:41,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54: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 19:54:41,010 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 19:54:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:41,010 INFO L82 PathProgramCache]: Analyzing trace with hash -774930668, now seen corresponding path program 1569 times [2020-02-10 19:54:41,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:41,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178705784] [2020-02-10 19:54:41,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:41,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 19:54:41,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178705784] [2020-02-10 19:54:41,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:41,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:41,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936130104] [2020-02-10 19:54:41,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:41,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:41,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:41,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:41,291 INFO L87 Difference]: Start difference. First operand 374 states and 1279 transitions. Second operand 9 states. [2020-02-10 19:54:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:41,380 INFO L93 Difference]: Finished difference Result 578 states and 1680 transitions. [2020-02-10 19:54:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:41,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:41,382 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:54:41,382 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:54:41,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 19:54:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:54:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 377. [2020-02-10 19:54:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1283 transitions. [2020-02-10 19:54:41,393 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1283 transitions. Word has length 22 [2020-02-10 19:54:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:41,393 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1283 transitions. [2020-02-10 19:54:41,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1283 transitions. [2020-02-10 19:54:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:41,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:41,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 19:54:41,394 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 19:54:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:41,394 INFO L82 PathProgramCache]: Analyzing trace with hash -648294294, now seen corresponding path program 1570 times [2020-02-10 19:54:41,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:41,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586931423] [2020-02-10 19:54:41,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:41,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 19:54:41,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586931423] [2020-02-10 19:54:41,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:41,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:41,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396504803] [2020-02-10 19:54:41,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:41,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:41,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:41,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:41,661 INFO L87 Difference]: Start difference. First operand 377 states and 1283 transitions. Second operand 9 states. [2020-02-10 19:54:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:41,785 INFO L93 Difference]: Finished difference Result 572 states and 1666 transitions. [2020-02-10 19:54:41,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:41,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:41,787 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:54:41,787 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:54:41,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 19:54:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:54:41,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 374. [2020-02-10 19:54:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:54:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1276 transitions. [2020-02-10 19:54:41,795 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1276 transitions. Word has length 22 [2020-02-10 19:54:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:41,796 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1276 transitions. [2020-02-10 19:54:41,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1276 transitions. [2020-02-10 19:54:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:41,796 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:41,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 19:54:41,796 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 19:54:41,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1231654834, now seen corresponding path program 1571 times [2020-02-10 19:54:41,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:41,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803664879] [2020-02-10 19:54:41,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:42,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 19:54:42,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803664879] [2020-02-10 19:54:42,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:42,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:42,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315181572] [2020-02-10 19:54:42,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:42,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:42,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:42,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:42,080 INFO L87 Difference]: Start difference. First operand 374 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:54:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:42,190 INFO L93 Difference]: Finished difference Result 567 states and 1657 transitions. [2020-02-10 19:54:42,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:42,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:42,192 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:54:42,192 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:54:42,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 19:54:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:54:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 376. [2020-02-10 19:54:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1279 transitions. [2020-02-10 19:54:42,202 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1279 transitions. Word has length 22 [2020-02-10 19:54:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:42,202 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1279 transitions. [2020-02-10 19:54:42,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1279 transitions. [2020-02-10 19:54:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:42,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:42,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 19:54:42,203 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 19:54:42,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1721379674, now seen corresponding path program 1572 times [2020-02-10 19:54:42,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:42,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106753122] [2020-02-10 19:54:42,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:42,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106753122] [2020-02-10 19:54:42,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:42,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:42,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074542722] [2020-02-10 19:54:42,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:42,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:42,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:42,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:42,476 INFO L87 Difference]: Start difference. First operand 376 states and 1279 transitions. Second operand 9 states. [2020-02-10 19:54:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:42,584 INFO L93 Difference]: Finished difference Result 566 states and 1653 transitions. [2020-02-10 19:54:42,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:42,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:42,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:42,586 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:54:42,587 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:54:42,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 19:54:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:54:42,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 371. [2020-02-10 19:54:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:54:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1270 transitions. [2020-02-10 19:54:42,596 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1270 transitions. Word has length 22 [2020-02-10 19:54:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:42,596 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1270 transitions. [2020-02-10 19:54:42,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1270 transitions. [2020-02-10 19:54:42,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:42,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:42,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 19:54:42,597 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 19:54:42,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:42,597 INFO L82 PathProgramCache]: Analyzing trace with hash 880605302, now seen corresponding path program 1573 times [2020-02-10 19:54:42,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:42,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532832353] [2020-02-10 19:54:42,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:42,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 19:54:42,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532832353] [2020-02-10 19:54:42,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:42,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:42,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678132650] [2020-02-10 19:54:42,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:42,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:42,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:42,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:42,890 INFO L87 Difference]: Start difference. First operand 371 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:54:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:42,973 INFO L93 Difference]: Finished difference Result 570 states and 1659 transitions. [2020-02-10 19:54:42,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:42,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:42,975 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:54:42,975 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:54:42,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 19:54:42,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:54:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 375. [2020-02-10 19:54:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1278 transitions. [2020-02-10 19:54:42,985 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1278 transitions. Word has length 22 [2020-02-10 19:54:42,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:42,985 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1278 transitions. [2020-02-10 19:54:42,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1278 transitions. [2020-02-10 19:54:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:42,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:42,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 19:54:42,986 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 19:54:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:42,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1441673794, now seen corresponding path program 1574 times [2020-02-10 19:54:42,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:42,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321490518] [2020-02-10 19:54:42,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:43,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 19:54:43,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321490518] [2020-02-10 19:54:43,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:43,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:43,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530644501] [2020-02-10 19:54:43,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:43,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:43,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:43,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:43,274 INFO L87 Difference]: Start difference. First operand 375 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:54:43,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:43,378 INFO L93 Difference]: Finished difference Result 563 states and 1644 transitions. [2020-02-10 19:54:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:43,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:43,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:43,380 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:54:43,380 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:54:43,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 19:54:43,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:54:43,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 373. [2020-02-10 19:54:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-02-10 19:54:43,390 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-02-10 19:54:43,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:43,390 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-02-10 19:54:43,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-02-10 19:54:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:43,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:43,391 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:43,391 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 19:54:43,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:43,391 INFO L82 PathProgramCache]: Analyzing trace with hash -719832552, now seen corresponding path program 1575 times [2020-02-10 19:54:43,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:43,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392932501] [2020-02-10 19:54:43,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:43,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 19:54:43,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392932501] [2020-02-10 19:54:43,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:43,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:43,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006256352] [2020-02-10 19:54:43,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:43,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:43,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:43,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:43,674 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-02-10 19:54:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:43,755 INFO L93 Difference]: Finished difference Result 572 states and 1662 transitions. [2020-02-10 19:54:43,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:43,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:43,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:43,757 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:54:43,757 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:54:43,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:54:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 376. [2020-02-10 19:54:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1278 transitions. [2020-02-10 19:54:43,766 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1278 transitions. Word has length 22 [2020-02-10 19:54:43,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:43,766 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1278 transitions. [2020-02-10 19:54:43,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:43,766 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1278 transitions. [2020-02-10 19:54:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:43,767 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:43,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 19:54:43,767 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 19:54:43,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:43,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1682036214, now seen corresponding path program 1576 times [2020-02-10 19:54:43,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:43,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787185863] [2020-02-10 19:54:43,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:44,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 19:54:44,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787185863] [2020-02-10 19:54:44,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:44,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:44,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948429516] [2020-02-10 19:54:44,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:44,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:44,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:44,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:44,041 INFO L87 Difference]: Start difference. First operand 376 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:54:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:44,164 INFO L93 Difference]: Finished difference Result 566 states and 1648 transitions. [2020-02-10 19:54:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:44,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:44,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:44,166 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:54:44,166 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:54:44,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 19:54:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:54:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 373. [2020-02-10 19:54:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 19:54:44,177 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 19:54:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:44,177 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 19:54:44,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 19:54:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:44,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:44,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 19:54:44,178 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 19:54:44,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:44,178 INFO L82 PathProgramCache]: Analyzing trace with hash -665110326, now seen corresponding path program 1577 times [2020-02-10 19:54:44,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:44,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508532193] [2020-02-10 19:54:44,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:44,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 19:54:44,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508532193] [2020-02-10 19:54:44,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:44,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:44,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736256178] [2020-02-10 19:54:44,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:44,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:44,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:44,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:44,479 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 19:54:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:44,563 INFO L93 Difference]: Finished difference Result 556 states and 1629 transitions. [2020-02-10 19:54:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:44,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:44,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:44,565 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:54:44,565 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:54:44,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 19:54:44,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:54:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 374. [2020-02-10 19:54:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:54:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1273 transitions. [2020-02-10 19:54:44,574 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1273 transitions. Word has length 22 [2020-02-10 19:54:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:44,575 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1273 transitions. [2020-02-10 19:54:44,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1273 transitions. [2020-02-10 19:54:44,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:44,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:44,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 19:54:44,575 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 19:54:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:44,576 INFO L82 PathProgramCache]: Analyzing trace with hash 945830632, now seen corresponding path program 1578 times [2020-02-10 19:54:44,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:44,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179305665] [2020-02-10 19:54:44,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:44,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 19:54:44,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179305665] [2020-02-10 19:54:44,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:44,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:44,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25410947] [2020-02-10 19:54:44,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:44,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:44,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:44,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:44,866 INFO L87 Difference]: Start difference. First operand 374 states and 1273 transitions. Second operand 9 states. [2020-02-10 19:54:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:44,973 INFO L93 Difference]: Finished difference Result 557 states and 1630 transitions. [2020-02-10 19:54:44,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:44,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:44,975 INFO L225 Difference]: With dead ends: 557 [2020-02-10 19:54:44,975 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:54:44,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:44,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:54:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 371. [2020-02-10 19:54:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:54:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1268 transitions. [2020-02-10 19:54:44,984 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1268 transitions. Word has length 22 [2020-02-10 19:54:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:44,984 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1268 transitions. [2020-02-10 19:54:44,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1268 transitions. [2020-02-10 19:54:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:44,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:44,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 19:54:44,985 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 19:54:44,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:44,985 INFO L82 PathProgramCache]: Analyzing trace with hash -756584044, now seen corresponding path program 1579 times [2020-02-10 19:54:44,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:44,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846073568] [2020-02-10 19:54:44,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:45,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 19:54:45,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846073568] [2020-02-10 19:54:45,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:45,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:45,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987227130] [2020-02-10 19:54:45,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:45,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:45,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:45,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:45,278 INFO L87 Difference]: Start difference. First operand 371 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:54:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:45,388 INFO L93 Difference]: Finished difference Result 551 states and 1621 transitions. [2020-02-10 19:54:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:45,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:45,390 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:54:45,390 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 19:54:45,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 19:54:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 19:54:45,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 373. [2020-02-10 19:54:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 19:54:45,399 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 19:54:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:45,399 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 19:54:45,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 19:54:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:45,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:45,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 19:54:45,400 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 19:54:45,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:45,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2092866242, now seen corresponding path program 1580 times [2020-02-10 19:54:45,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:45,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135299036] [2020-02-10 19:54:45,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:45,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 19:54:45,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135299036] [2020-02-10 19:54:45,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:45,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:45,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533696724] [2020-02-10 19:54:45,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:45,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:45,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:45,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:45,703 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 19:54:45,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:45,787 INFO L93 Difference]: Finished difference Result 549 states and 1616 transitions. [2020-02-10 19:54:45,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:45,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:45,789 INFO L225 Difference]: With dead ends: 549 [2020-02-10 19:54:45,789 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 19:54:45,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 19:54:45,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 19:54:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 372. [2020-02-10 19:54:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:54:45,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1270 transitions. [2020-02-10 19:54:45,798 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1270 transitions. Word has length 22 [2020-02-10 19:54:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:45,798 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1270 transitions. [2020-02-10 19:54:45,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1270 transitions. [2020-02-10 19:54:45,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:45,798 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:45,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 19:54:45,799 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 19:54:45,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:45,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1937945398, now seen corresponding path program 1581 times [2020-02-10 19:54:45,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:45,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238602659] [2020-02-10 19:54:45,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:46,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 19:54:46,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238602659] [2020-02-10 19:54:46,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:46,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:46,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964178331] [2020-02-10 19:54:46,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:46,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:46,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:46,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:46,095 INFO L87 Difference]: Start difference. First operand 372 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:54:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:46,221 INFO L93 Difference]: Finished difference Result 553 states and 1625 transitions. [2020-02-10 19:54:46,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:46,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:46,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:46,223 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:54:46,223 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 19:54:46,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 19:54:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 19:54:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 374. [2020-02-10 19:54:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:54:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1273 transitions. [2020-02-10 19:54:46,233 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1273 transitions. Word has length 22 [2020-02-10 19:54:46,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:46,233 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1273 transitions. [2020-02-10 19:54:46,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1273 transitions. [2020-02-10 19:54:46,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:46,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:46,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 19:54:46,234 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 19:54:46,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:46,234 INFO L82 PathProgramCache]: Analyzing trace with hash -2103929146, now seen corresponding path program 1582 times [2020-02-10 19:54:46,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:46,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078277120] [2020-02-10 19:54:46,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:46,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 19:54:46,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078277120] [2020-02-10 19:54:46,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:46,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:46,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617414487] [2020-02-10 19:54:46,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:46,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:46,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:46,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:46,525 INFO L87 Difference]: Start difference. First operand 374 states and 1273 transitions. Second operand 9 states. [2020-02-10 19:54:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:46,650 INFO L93 Difference]: Finished difference Result 552 states and 1621 transitions. [2020-02-10 19:54:46,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:46,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:46,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:46,652 INFO L225 Difference]: With dead ends: 552 [2020-02-10 19:54:46,652 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 19:54:46,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 19:54:46,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 19:54:46,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 372. [2020-02-10 19:54:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:54:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1269 transitions. [2020-02-10 19:54:46,661 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1269 transitions. Word has length 22 [2020-02-10 19:54:46,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:46,662 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1269 transitions. [2020-02-10 19:54:46,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1269 transitions. [2020-02-10 19:54:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:46,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:46,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 19:54:46,662 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 19:54:46,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:46,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1108009466, now seen corresponding path program 1583 times [2020-02-10 19:54:46,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:46,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073932043] [2020-02-10 19:54:46,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:46,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073932043] [2020-02-10 19:54:46,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:46,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:46,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711181398] [2020-02-10 19:54:46,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:46,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:46,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:46,971 INFO L87 Difference]: Start difference. First operand 372 states and 1269 transitions. Second operand 9 states. [2020-02-10 19:54:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:47,054 INFO L93 Difference]: Finished difference Result 548 states and 1613 transitions. [2020-02-10 19:54:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:47,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:47,055 INFO L225 Difference]: With dead ends: 548 [2020-02-10 19:54:47,056 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 19:54:47,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 19:54:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 19:54:47,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 373. [2020-02-10 19:54:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 19:54:47,064 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 19:54:47,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:47,065 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 19:54:47,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 19:54:47,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:47,065 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:47,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 19:54:47,065 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 19:54:47,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:47,066 INFO L82 PathProgramCache]: Analyzing trace with hash 502931492, now seen corresponding path program 1584 times [2020-02-10 19:54:47,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:47,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798837687] [2020-02-10 19:54:47,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:47,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 19:54:47,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798837687] [2020-02-10 19:54:47,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:47,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:47,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839156679] [2020-02-10 19:54:47,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:47,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:47,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:47,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:47,360 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:54:47,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:47,472 INFO L93 Difference]: Finished difference Result 549 states and 1614 transitions. [2020-02-10 19:54:47,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:47,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:47,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:47,473 INFO L225 Difference]: With dead ends: 549 [2020-02-10 19:54:47,474 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:54:47,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 19:54:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:54:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 369. [2020-02-10 19:54:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 19:54:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1264 transitions. [2020-02-10 19:54:47,483 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1264 transitions. Word has length 22 [2020-02-10 19:54:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:47,483 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1264 transitions. [2020-02-10 19:54:47,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1264 transitions. [2020-02-10 19:54:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:47,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:47,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 19:54:47,484 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 19:54:47,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:47,484 INFO L82 PathProgramCache]: Analyzing trace with hash 607420976, now seen corresponding path program 1585 times [2020-02-10 19:54:47,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:47,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209311214] [2020-02-10 19:54:47,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:47,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 19:54:47,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209311214] [2020-02-10 19:54:47,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:47,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:47,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486056504] [2020-02-10 19:54:47,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:47,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:47,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:47,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:47,786 INFO L87 Difference]: Start difference. First operand 369 states and 1264 transitions. Second operand 9 states. [2020-02-10 19:54:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:47,870 INFO L93 Difference]: Finished difference Result 582 states and 1692 transitions. [2020-02-10 19:54:47,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:47,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:47,872 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:54:47,872 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:54:47,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 19:54:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:54:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 377. [2020-02-10 19:54:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-02-10 19:54:47,882 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-02-10 19:54:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:47,882 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-02-10 19:54:47,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-02-10 19:54:47,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:47,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:47,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 19:54:47,883 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 19:54:47,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:47,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2097280434, now seen corresponding path program 1586 times [2020-02-10 19:54:47,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:47,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951016380] [2020-02-10 19:54:47,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:48,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 19:54:48,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951016380] [2020-02-10 19:54:48,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:48,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:48,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66087063] [2020-02-10 19:54:48,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:48,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:48,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:48,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:48,146 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-02-10 19:54:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:48,256 INFO L93 Difference]: Finished difference Result 577 states and 1679 transitions. [2020-02-10 19:54:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:48,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:48,258 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:54:48,258 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:54:48,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 19:54:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:54:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 373. [2020-02-10 19:54:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1276 transitions. [2020-02-10 19:54:48,269 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1276 transitions. Word has length 22 [2020-02-10 19:54:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:48,269 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1276 transitions. [2020-02-10 19:54:48,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1276 transitions. [2020-02-10 19:54:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:48,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:48,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 19:54:48,270 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 19:54:48,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:48,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1959971296, now seen corresponding path program 1587 times [2020-02-10 19:54:48,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:48,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709257738] [2020-02-10 19:54:48,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:48,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 19:54:48,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709257738] [2020-02-10 19:54:48,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:48,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:48,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943865698] [2020-02-10 19:54:48,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:48,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:48,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:48,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:48,533 INFO L87 Difference]: Start difference. First operand 373 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:54:48,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:48,616 INFO L93 Difference]: Finished difference Result 578 states and 1680 transitions. [2020-02-10 19:54:48,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:48,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:48,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:48,618 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:54:48,618 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:54:48,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 19:54:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:54:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 375. [2020-02-10 19:54:48,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1278 transitions. [2020-02-10 19:54:48,628 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1278 transitions. Word has length 22 [2020-02-10 19:54:48,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:48,628 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1278 transitions. [2020-02-10 19:54:48,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1278 transitions. [2020-02-10 19:54:48,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:48,629 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:48,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 19:54:48,629 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 19:54:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1773927508, now seen corresponding path program 1588 times [2020-02-10 19:54:48,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:48,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379758760] [2020-02-10 19:54:48,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:48,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 19:54:48,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379758760] [2020-02-10 19:54:48,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:48,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:48,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138534570] [2020-02-10 19:54:48,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:48,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:48,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:48,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:48,892 INFO L87 Difference]: Start difference. First operand 375 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:54:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:48,974 INFO L93 Difference]: Finished difference Result 571 states and 1665 transitions. [2020-02-10 19:54:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:48,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:48,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:48,976 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:54:48,976 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:54: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 19:54:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:54:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 373. [2020-02-10 19:54:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-02-10 19:54:48,986 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-02-10 19:54:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:48,986 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-02-10 19:54:48,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-02-10 19:54:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:48,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54: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 19:54:48,987 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 19:54:48,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:48,987 INFO L82 PathProgramCache]: Analyzing trace with hash 765681090, now seen corresponding path program 1589 times [2020-02-10 19:54:48,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:48,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245367341] [2020-02-10 19:54:48,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:49,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 19:54:49,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245367341] [2020-02-10 19:54:49,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:49,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:49,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415364135] [2020-02-10 19:54:49,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:49,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:49,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:49,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:49,262 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-02-10 19:54:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:49,369 INFO L93 Difference]: Finished difference Result 567 states and 1658 transitions. [2020-02-10 19:54:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:49,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:49,371 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:54:49,371 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:54:49,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:54:49,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 374. [2020-02-10 19:54:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:54:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1275 transitions. [2020-02-10 19:54:49,381 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1275 transitions. Word has length 22 [2020-02-10 19:54:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:49,381 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1275 transitions. [2020-02-10 19:54:49,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1275 transitions. [2020-02-10 19:54:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:49,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:49,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 19:54:49,382 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 19:54:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:49,382 INFO L82 PathProgramCache]: Analyzing trace with hash -679835920, now seen corresponding path program 1590 times [2020-02-10 19:54:49,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:49,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743420175] [2020-02-10 19:54:49,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:49,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 19:54:49,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743420175] [2020-02-10 19:54:49,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:49,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:49,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825374350] [2020-02-10 19:54:49,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:49,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:49,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:49,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:49,659 INFO L87 Difference]: Start difference. First operand 374 states and 1275 transitions. Second operand 9 states. [2020-02-10 19:54:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:49,744 INFO L93 Difference]: Finished difference Result 565 states and 1653 transitions. [2020-02-10 19:54:49,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:49,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:49,746 INFO L225 Difference]: With dead ends: 565 [2020-02-10 19:54:49,746 INFO L226 Difference]: Without dead ends: 553 [2020-02-10 19:54:49,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 19:54:49,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-02-10 19:54:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 371. [2020-02-10 19:54:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:54:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1270 transitions. [2020-02-10 19:54:49,756 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1270 transitions. Word has length 22 [2020-02-10 19:54:49,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:49,756 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1270 transitions. [2020-02-10 19:54:49,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:49,756 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1270 transitions. [2020-02-10 19:54:49,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:49,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:49,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 19:54:49,757 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 19:54:49,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:49,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1997603416, now seen corresponding path program 1591 times [2020-02-10 19:54:49,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:49,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613584192] [2020-02-10 19:54:49,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:50,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 19:54:50,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613584192] [2020-02-10 19:54:50,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:50,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:50,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743259691] [2020-02-10 19:54:50,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:50,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:50,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:50,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:50,023 INFO L87 Difference]: Start difference. First operand 371 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:54:50,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:50,106 INFO L93 Difference]: Finished difference Result 590 states and 1714 transitions. [2020-02-10 19:54:50,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:50,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:50,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:50,107 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:54:50,108 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:54:50,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:54:50,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 379. [2020-02-10 19:54:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:54:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1290 transitions. [2020-02-10 19:54:50,116 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1290 transitions. Word has length 22 [2020-02-10 19:54:50,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:50,117 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1290 transitions. [2020-02-10 19:54:50,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:50,117 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1290 transitions. [2020-02-10 19:54:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:50,117 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:50,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:50,117 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 19:54:50,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:50,118 INFO L82 PathProgramCache]: Analyzing trace with hash -407337530, now seen corresponding path program 1592 times [2020-02-10 19:54:50,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:50,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881869876] [2020-02-10 19:54:50,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:50,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 19:54:50,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881869876] [2020-02-10 19:54:50,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:50,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:50,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598029217] [2020-02-10 19:54:50,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:50,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:50,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:50,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:50,382 INFO L87 Difference]: Start difference. First operand 379 states and 1290 transitions. Second operand 9 states. [2020-02-10 19:54:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:50,490 INFO L93 Difference]: Finished difference Result 585 states and 1701 transitions. [2020-02-10 19:54:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:50,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:50,492 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:54:50,492 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:54:50,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:54:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 375. [2020-02-10 19:54:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1280 transitions. [2020-02-10 19:54:50,502 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1280 transitions. Word has length 22 [2020-02-10 19:54:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:50,502 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1280 transitions. [2020-02-10 19:54:50,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1280 transitions. [2020-02-10 19:54:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:50,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:50,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 19:54:50,503 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 19:54:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:50,503 INFO L82 PathProgramCache]: Analyzing trace with hash -665040488, now seen corresponding path program 1593 times [2020-02-10 19:54:50,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:50,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773387421] [2020-02-10 19:54:50,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:50,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 19:54:50,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773387421] [2020-02-10 19:54:50,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:50,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:50,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738098285] [2020-02-10 19:54:50,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:50,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:50,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:50,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:50,780 INFO L87 Difference]: Start difference. First operand 375 states and 1280 transitions. Second operand 9 states. [2020-02-10 19:54:50,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:50,865 INFO L93 Difference]: Finished difference Result 586 states and 1706 transitions. [2020-02-10 19:54:50,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:50,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:50,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:50,867 INFO L225 Difference]: With dead ends: 586 [2020-02-10 19:54:50,867 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:54:50,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 19:54:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:54:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 381. [2020-02-10 19:54:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:54:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1290 transitions. [2020-02-10 19:54:50,876 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1290 transitions. Word has length 22 [2020-02-10 19:54:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:50,877 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1290 transitions. [2020-02-10 19:54:50,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1290 transitions. [2020-02-10 19:54:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:50,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:50,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 19:54:50,877 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 19:54:50,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:50,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2038826780, now seen corresponding path program 1594 times [2020-02-10 19:54:50,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:50,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960911306] [2020-02-10 19:54:50,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:51,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 19:54:51,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960911306] [2020-02-10 19:54:51,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:51,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:51,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367285575] [2020-02-10 19:54:51,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:51,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:51,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:51,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:51,158 INFO L87 Difference]: Start difference. First operand 381 states and 1290 transitions. Second operand 9 states. [2020-02-10 19:54:51,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:51,267 INFO L93 Difference]: Finished difference Result 574 states and 1687 transitions. [2020-02-10 19:54:51,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:51,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:51,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:51,269 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:54:51,269 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 19:54:51,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 19:54:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 19:54:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 375. [2020-02-10 19:54:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 19:54:51,279 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 19:54:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:51,279 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 19:54:51,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 19:54:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:51,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:51,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 19:54:51,280 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 19:54:51,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:51,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1880336902, now seen corresponding path program 1595 times [2020-02-10 19:54:51,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:51,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003299167] [2020-02-10 19:54:51,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:51,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 19:54:51,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003299167] [2020-02-10 19:54:51,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:51,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:51,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310373583] [2020-02-10 19:54:51,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:51,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:51,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:51,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:51,539 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:54:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:51,646 INFO L93 Difference]: Finished difference Result 578 states and 1685 transitions. [2020-02-10 19:54:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:51,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:51,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:51,648 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:54:51,648 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:54:51,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 19:54:51,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:54:51,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 378. [2020-02-10 19:54:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:54:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1281 transitions. [2020-02-10 19:54:51,658 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1281 transitions. Word has length 22 [2020-02-10 19:54:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:51,659 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1281 transitions. [2020-02-10 19:54:51,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1281 transitions. [2020-02-10 19:54:51,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:51,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:51,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 19:54:51,659 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 19:54:51,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:51,660 INFO L82 PathProgramCache]: Analyzing trace with hash -151289568, now seen corresponding path program 1596 times [2020-02-10 19:54:51,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:51,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196496963] [2020-02-10 19:54:51,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:51,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 19:54:51,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196496963] [2020-02-10 19:54:51,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:51,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:51,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138440565] [2020-02-10 19:54:51,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:51,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:51,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:51,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:51,926 INFO L87 Difference]: Start difference. First operand 378 states and 1281 transitions. Second operand 9 states. [2020-02-10 19:54:52,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:52,034 INFO L93 Difference]: Finished difference Result 571 states and 1678 transitions. [2020-02-10 19:54:52,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:52,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:52,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:52,036 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:54:52,036 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:54:52,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 19:54:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:54:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 371. [2020-02-10 19:54:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:54:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1268 transitions. [2020-02-10 19:54:52,044 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1268 transitions. Word has length 22 [2020-02-10 19:54:52,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:52,044 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1268 transitions. [2020-02-10 19:54:52,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1268 transitions. [2020-02-10 19:54:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:52,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:52,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 19:54:52,045 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 19:54:52,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:52,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1281391072, now seen corresponding path program 1597 times [2020-02-10 19:54:52,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:52,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347508556] [2020-02-10 19:54:52,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:52,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 19:54:52,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347508556] [2020-02-10 19:54:52,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:52,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:52,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078462821] [2020-02-10 19:54:52,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:52,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:52,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:52,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:52,305 INFO L87 Difference]: Start difference. First operand 371 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:54:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:52,404 INFO L93 Difference]: Finished difference Result 580 states and 1684 transitions. [2020-02-10 19:54:52,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:52,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:52,406 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:54:52,406 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:54:52,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 19:54:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:54:52,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 375. [2020-02-10 19:54:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 19:54:52,416 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 19:54:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:52,417 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 19:54:52,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 19:54:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:52,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:52,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 19:54:52,418 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 19:54:52,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:52,418 INFO L82 PathProgramCache]: Analyzing trace with hash -720322580, now seen corresponding path program 1598 times [2020-02-10 19:54:52,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:52,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652590027] [2020-02-10 19:54:52,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:52,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 19:54:52,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652590027] [2020-02-10 19:54:52,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:52,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:52,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667747982] [2020-02-10 19:54:52,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:52,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:52,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:52,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:52,684 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:54:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:52,767 INFO L93 Difference]: Finished difference Result 573 states and 1669 transitions. [2020-02-10 19:54:52,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:52,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:52,769 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:54:52,769 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:54:52,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 19:54:52,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:54:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 373. [2020-02-10 19:54:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 19:54:52,779 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 19:54:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:52,779 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 19:54:52,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 19:54:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:52,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:52,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 19:54:52,780 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 19:54:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash 825393048, now seen corresponding path program 1599 times [2020-02-10 19:54:52,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:52,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859425670] [2020-02-10 19:54:52,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:53,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 19:54:53,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859425670] [2020-02-10 19:54:53,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:53,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:53,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833426727] [2020-02-10 19:54:53,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:53,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:53,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:53,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:53,055 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 19:54:53,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:53,149 INFO L93 Difference]: Finished difference Result 580 states and 1688 transitions. [2020-02-10 19:54:53,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:53,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:53,151 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:54:53,151 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:54:53,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 19:54:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:54:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 379. [2020-02-10 19:54:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:54:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1282 transitions. [2020-02-10 19:54:53,161 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1282 transitions. Word has length 22 [2020-02-10 19:54:53,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:53,161 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1282 transitions. [2020-02-10 19:54:53,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1282 transitions. [2020-02-10 19:54:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:53,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:53,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 19:54:53,162 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 19:54:53,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:53,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1018213740, now seen corresponding path program 1600 times [2020-02-10 19:54:53,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:53,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636327874] [2020-02-10 19:54:53,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:53,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 19:54:53,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636327874] [2020-02-10 19:54:53,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:53,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:53,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180717534] [2020-02-10 19:54:53,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:53,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:53,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:53,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:53,429 INFO L87 Difference]: Start difference. First operand 379 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:54:53,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:53,537 INFO L93 Difference]: Finished difference Result 568 states and 1669 transitions. [2020-02-10 19:54:53,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:53,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:53,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:53,539 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:54:53,539 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 19:54:53,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 19:54:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 19:54:53,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 373. [2020-02-10 19:54:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 19:54:53,549 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 19:54:53,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:53,549 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 19:54:53,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 19:54:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:53,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:53,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 19:54:53,550 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 19:54:53,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:53,550 INFO L82 PathProgramCache]: Analyzing trace with hash 880115274, now seen corresponding path program 1601 times [2020-02-10 19:54:53,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:53,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543715900] [2020-02-10 19:54:53,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:53,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 19:54:53,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543715900] [2020-02-10 19:54:53,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:53,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:53,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551631396] [2020-02-10 19:54:53,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:53,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:53,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:53,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:53,817 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:54:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:53,909 INFO L93 Difference]: Finished difference Result 568 states and 1659 transitions. [2020-02-10 19:54:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:53,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:53,911 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:54:53,911 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:54:53,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 19:54:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:54:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 374. [2020-02-10 19:54:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:54:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-02-10 19:54:53,921 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-02-10 19:54:53,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:53,921 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-02-10 19:54:53,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-02-10 19:54:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:53,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54: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 19:54:53,922 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 19:54:53,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:53,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1268681262, now seen corresponding path program 1602 times [2020-02-10 19:54:53,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:53,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176049486] [2020-02-10 19:54:53,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:54,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 19:54:54,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176049486] [2020-02-10 19:54:54,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:54,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:54,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372779989] [2020-02-10 19:54:54,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:54,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:54,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:54,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:54,183 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-02-10 19:54:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:54,314 INFO L93 Difference]: Finished difference Result 563 states and 1658 transitions. [2020-02-10 19:54:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:54,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:54,315 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:54:54,316 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:54:54,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:54:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 371. [2020-02-10 19:54:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:54:54,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1266 transitions. [2020-02-10 19:54:54,325 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1266 transitions. Word has length 22 [2020-02-10 19:54:54,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:54,325 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1266 transitions. [2020-02-10 19:54:54,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1266 transitions. [2020-02-10 19:54:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:54,326 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:54,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 19:54:54,326 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 19:54:54,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:54,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1376386878, now seen corresponding path program 1603 times [2020-02-10 19:54:54,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:54,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722818121] [2020-02-10 19:54:54,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:54,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 19:54:54,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722818121] [2020-02-10 19:54:54,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:54,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:54,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788489565] [2020-02-10 19:54:54,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:54,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:54,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:54,608 INFO L87 Difference]: Start difference. First operand 371 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:54:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:54,717 INFO L93 Difference]: Finished difference Result 560 states and 1642 transitions. [2020-02-10 19:54:54,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:54,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:54,719 INFO L225 Difference]: With dead ends: 560 [2020-02-10 19:54:54,719 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 19:54:54,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 19:54:54,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 373. [2020-02-10 19:54:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:54,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 19:54:54,728 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 19:54:54,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:54,728 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 19:54:54,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 19:54:54,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:54,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:54,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 19:54:54,729 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 19:54:54,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:54,729 INFO L82 PathProgramCache]: Analyzing trace with hash -69130132, now seen corresponding path program 1604 times [2020-02-10 19:54:54,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:54,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252346275] [2020-02-10 19:54:54,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:55,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 19:54:55,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252346275] [2020-02-10 19:54:55,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:55,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:55,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339367045] [2020-02-10 19:54:55,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:55,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:55,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:55,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:55,002 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:54:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:55,089 INFO L93 Difference]: Finished difference Result 558 states and 1637 transitions. [2020-02-10 19:54:55,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:55,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:55,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:55,090 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:54:55,091 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:54:55,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 19:54:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:54:55,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 372. [2020-02-10 19:54:55,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:54:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1268 transitions. [2020-02-10 19:54:55,101 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1268 transitions. Word has length 22 [2020-02-10 19:54:55,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:55,101 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1268 transitions. [2020-02-10 19:54:55,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:55,101 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1268 transitions. [2020-02-10 19:54:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:55,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:55,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 19:54:55,102 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 19:54:55,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:55,102 INFO L82 PathProgramCache]: Analyzing trace with hash -811796298, now seen corresponding path program 1605 times [2020-02-10 19:54:55,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:55,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971484479] [2020-02-10 19:54:55,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:55,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 19:54:55,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971484479] [2020-02-10 19:54:55,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:55,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:55,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465511472] [2020-02-10 19:54:55,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:55,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:55,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:55,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:55,370 INFO L87 Difference]: Start difference. First operand 372 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:54:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:55,476 INFO L93 Difference]: Finished difference Result 563 states and 1650 transitions. [2020-02-10 19:54:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:55,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:55,478 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:54:55,478 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:54:55,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 19:54:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:54:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 375. [2020-02-10 19:54:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1273 transitions. [2020-02-10 19:54:55,488 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1273 transitions. Word has length 22 [2020-02-10 19:54:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:55,488 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1273 transitions. [2020-02-10 19:54:55,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1273 transitions. [2020-02-10 19:54:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:55,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:55,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 19:54:55,489 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 19:54:55,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:55,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1593795540, now seen corresponding path program 1606 times [2020-02-10 19:54:55,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:55,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110759692] [2020-02-10 19:54:55,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:55,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 19:54:55,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110759692] [2020-02-10 19:54:55,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:55,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:55,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36797824] [2020-02-10 19:54:55,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:55,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:55,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:55,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:55,754 INFO L87 Difference]: Start difference. First operand 375 states and 1273 transitions. Second operand 9 states. [2020-02-10 19:54:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:55,865 INFO L93 Difference]: Finished difference Result 556 states and 1643 transitions. [2020-02-10 19:54:55,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:55,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:55,867 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:54:55,867 INFO L226 Difference]: Without dead ends: 540 [2020-02-10 19:54:55,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 19:54:55,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-02-10 19:54:55,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 372. [2020-02-10 19:54:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:54:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1267 transitions. [2020-02-10 19:54:55,877 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1267 transitions. Word has length 22 [2020-02-10 19:54:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:55,877 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1267 transitions. [2020-02-10 19:54:55,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:55,877 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1267 transitions. [2020-02-10 19:54:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:55,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:55,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 19:54:55,878 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 19:54:55,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:55,878 INFO L82 PathProgramCache]: Analyzing trace with hash 437216134, now seen corresponding path program 1607 times [2020-02-10 19:54:55,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:55,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866972333] [2020-02-10 19:54:55,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:56,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 19:54:56,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866972333] [2020-02-10 19:54:56,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:56,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:56,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173203555] [2020-02-10 19:54:56,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:56,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:56,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:56,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:56,148 INFO L87 Difference]: Start difference. First operand 372 states and 1267 transitions. Second operand 9 states. [2020-02-10 19:54:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:56,233 INFO L93 Difference]: Finished difference Result 559 states and 1639 transitions. [2020-02-10 19:54:56,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:56,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:56,235 INFO L225 Difference]: With dead ends: 559 [2020-02-10 19:54:56,235 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 19:54:56,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 19:54:56,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 19:54:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 373. [2020-02-10 19:54:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:54:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 19:54:56,245 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 19:54:56,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:56,245 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 19:54:56,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 19:54:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:56,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:56,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 19:54:56,246 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 19:54:56,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:56,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1711580402, now seen corresponding path program 1608 times [2020-02-10 19:54:56,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:56,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155158950] [2020-02-10 19:54:56,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:56,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 19:54:56,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155158950] [2020-02-10 19:54:56,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:56,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:56,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842358411] [2020-02-10 19:54:56,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:56,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:56,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:56,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:56,510 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:54:56,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:56,616 INFO L93 Difference]: Finished difference Result 554 states and 1638 transitions. [2020-02-10 19:54:56,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:56,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:56,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:56,618 INFO L225 Difference]: With dead ends: 554 [2020-02-10 19:54:56,618 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:54:56,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 19:54:56,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:54:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 369. [2020-02-10 19:54:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 19:54:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1262 transitions. [2020-02-10 19:54:56,628 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1262 transitions. Word has length 22 [2020-02-10 19:54:56,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:56,628 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1262 transitions. [2020-02-10 19:54:56,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1262 transitions. [2020-02-10 19:54:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:56,629 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:56,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 19:54:56,629 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 19:54:56,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:56,629 INFO L82 PathProgramCache]: Analyzing trace with hash -27220368, now seen corresponding path program 1609 times [2020-02-10 19:54:56,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:56,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545432618] [2020-02-10 19:54:56,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:56,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 19:54:56,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545432618] [2020-02-10 19:54:56,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:56,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:56,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737000707] [2020-02-10 19:54:56,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:56,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:56,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:56,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:56,901 INFO L87 Difference]: Start difference. First operand 369 states and 1262 transitions. Second operand 9 states. [2020-02-10 19:54:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:57,004 INFO L93 Difference]: Finished difference Result 593 states and 1726 transitions. [2020-02-10 19:54:57,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:57,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:57,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:57,006 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:54:57,006 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:54:57,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:54:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-02-10 19:54:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:54:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1291 transitions. [2020-02-10 19:54:57,015 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1291 transitions. Word has length 22 [2020-02-10 19:54:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:57,015 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1291 transitions. [2020-02-10 19:54:57,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1291 transitions. [2020-02-10 19:54:57,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:57,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:57,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 19:54:57,016 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 19:54:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:57,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1563045518, now seen corresponding path program 1610 times [2020-02-10 19:54:57,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:57,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821473033] [2020-02-10 19:54:57,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:57,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 19:54:57,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821473033] [2020-02-10 19:54:57,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:57,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:57,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953137699] [2020-02-10 19:54:57,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:57,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:57,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:57,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:57,282 INFO L87 Difference]: Start difference. First operand 379 states and 1291 transitions. Second operand 9 states. [2020-02-10 19:54:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:57,390 INFO L93 Difference]: Finished difference Result 588 states and 1713 transitions. [2020-02-10 19:54:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:57,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:57,392 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:54:57,393 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 19:54:57,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 19:54:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 19:54:57,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 375. [2020-02-10 19:54:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1282 transitions. [2020-02-10 19:54:57,402 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1282 transitions. Word has length 22 [2020-02-10 19:54:57,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:57,402 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1282 transitions. [2020-02-10 19:54:57,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1282 transitions. [2020-02-10 19:54:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:57,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:57,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 19:54:57,403 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 19:54:57,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:57,403 INFO L82 PathProgramCache]: Analyzing trace with hash 73691804, now seen corresponding path program 1611 times [2020-02-10 19:54:57,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:57,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104838384] [2020-02-10 19:54:57,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:57,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 19:54:57,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104838384] [2020-02-10 19:54:57,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:57,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:57,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154376144] [2020-02-10 19:54:57,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:57,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:57,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:57,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:57,675 INFO L87 Difference]: Start difference. First operand 375 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:54:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:57,755 INFO L93 Difference]: Finished difference Result 591 states and 1718 transitions. [2020-02-10 19:54:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:57,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:57,757 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:54:57,757 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:54:57,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:54:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 378. [2020-02-10 19:54:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:54:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1286 transitions. [2020-02-10 19:54:57,767 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1286 transitions. Word has length 22 [2020-02-10 19:54:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:57,767 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1286 transitions. [2020-02-10 19:54:57,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1286 transitions. [2020-02-10 19:54:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:57,767 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:57,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 19:54:57,767 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 19:54:57,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:57,768 INFO L82 PathProgramCache]: Analyzing trace with hash 200328178, now seen corresponding path program 1612 times [2020-02-10 19:54:57,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:57,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769416004] [2020-02-10 19:54:57,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:58,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 19:54:58,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769416004] [2020-02-10 19:54:58,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:58,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:58,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380460577] [2020-02-10 19:54:58,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:58,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:58,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:58,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:58,031 INFO L87 Difference]: Start difference. First operand 378 states and 1286 transitions. Second operand 9 states. [2020-02-10 19:54:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:58,141 INFO L93 Difference]: Finished difference Result 585 states and 1704 transitions. [2020-02-10 19:54:58,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:58,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:58,143 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:54:58,143 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:54:58,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 19:54:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:54:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 375. [2020-02-10 19:54:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:54:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1279 transitions. [2020-02-10 19:54:58,152 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1279 transitions. Word has length 22 [2020-02-10 19:54:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:58,153 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1279 transitions. [2020-02-10 19:54:58,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:58,153 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1279 transitions. [2020-02-10 19:54:58,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:58,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:58,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:58,153 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 19:54:58,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:58,154 INFO L82 PathProgramCache]: Analyzing trace with hash 2080277306, now seen corresponding path program 1613 times [2020-02-10 19:54:58,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:58,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196386237] [2020-02-10 19:54:58,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:58,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 19:54:58,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196386237] [2020-02-10 19:54:58,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:58,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:58,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685527035] [2020-02-10 19:54:58,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:58,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:58,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:58,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:58,429 INFO L87 Difference]: Start difference. First operand 375 states and 1279 transitions. Second operand 9 states. [2020-02-10 19:54:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:58,536 INFO L93 Difference]: Finished difference Result 580 states and 1695 transitions. [2020-02-10 19:54:58,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:58,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:58,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:58,538 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:54:58,539 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 19:54:58,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 19:54:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 19:54:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 377. [2020-02-10 19:54:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:54:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1282 transitions. [2020-02-10 19:54:58,548 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1282 transitions. Word has length 22 [2020-02-10 19:54:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:58,548 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1282 transitions. [2020-02-10 19:54:58,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1282 transitions. [2020-02-10 19:54:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:58,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:58,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 19:54:58,549 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 19:54:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:58,549 INFO L82 PathProgramCache]: Analyzing trace with hash -872757202, now seen corresponding path program 1614 times [2020-02-10 19:54:58,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:58,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130054504] [2020-02-10 19:54:58,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:58,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 19:54:58,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130054504] [2020-02-10 19:54:58,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:58,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:58,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567088834] [2020-02-10 19:54:58,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:58,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:58,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:58,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:58,820 INFO L87 Difference]: Start difference. First operand 377 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:54:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:58,928 INFO L93 Difference]: Finished difference Result 579 states and 1691 transitions. [2020-02-10 19:54:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:58,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:58,930 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:54:58,930 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:54:58,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 19:54:58,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:54:58,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 372. [2020-02-10 19:54:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:54:58,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1272 transitions. [2020-02-10 19:54:58,940 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1272 transitions. Word has length 22 [2020-02-10 19:54:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:58,940 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1272 transitions. [2020-02-10 19:54:58,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1272 transitions. [2020-02-10 19:54:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:58,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:58,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 19:54:58,941 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 19:54:58,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:58,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2085208262, now seen corresponding path program 1615 times [2020-02-10 19:54:58,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:58,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335635721] [2020-02-10 19:54:58,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:59,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 19:54:59,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335635721] [2020-02-10 19:54:59,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:59,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:59,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823948952] [2020-02-10 19:54:59,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:59,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:59,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:59,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:59,211 INFO L87 Difference]: Start difference. First operand 372 states and 1272 transitions. Second operand 9 states. [2020-02-10 19:54:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:59,311 INFO L93 Difference]: Finished difference Result 597 states and 1735 transitions. [2020-02-10 19:54:59,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:59,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:59,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:59,313 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:54:59,313 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 19:54:59,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 19:54:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 19:54:59,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 380. [2020-02-10 19:54:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:54:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1292 transitions. [2020-02-10 19:54:59,324 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1292 transitions. Word has length 22 [2020-02-10 19:54:59,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:59,324 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1292 transitions. [2020-02-10 19:54:59,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1292 transitions. [2020-02-10 19:54:59,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:59,325 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:59,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 19:54:59,325 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 19:54:59,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:59,325 INFO L82 PathProgramCache]: Analyzing trace with hash -619493148, now seen corresponding path program 1616 times [2020-02-10 19:54:59,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:59,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385490437] [2020-02-10 19:54:59,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:59,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 19:54:59,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385490437] [2020-02-10 19:54:59,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:59,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:59,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448998740] [2020-02-10 19:54:59,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:59,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:59,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:59,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:59,590 INFO L87 Difference]: Start difference. First operand 380 states and 1292 transitions. Second operand 9 states. [2020-02-10 19:54:59,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:59,696 INFO L93 Difference]: Finished difference Result 592 states and 1722 transitions. [2020-02-10 19:54:59,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:54:59,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:54:59,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:59,698 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:54:59,698 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:54:59,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 19:54:59,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:54:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 376. [2020-02-10 19:54:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:54:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1282 transitions. [2020-02-10 19:54:59,708 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1282 transitions. Word has length 22 [2020-02-10 19:54:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:59,708 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1282 transitions. [2020-02-10 19:54:59,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:54:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1282 transitions. [2020-02-10 19:54:59,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:54:59,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:59,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 19:54:59,709 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 19:54:59,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:59,709 INFO L82 PathProgramCache]: Analyzing trace with hash -877196106, now seen corresponding path program 1617 times [2020-02-10 19:54:59,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:59,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458589263] [2020-02-10 19:54:59,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:59,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458589263] [2020-02-10 19:54:59,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:59,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:54:59,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002009052] [2020-02-10 19:54:59,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:54:59,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:59,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:54:59,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:54:59,981 INFO L87 Difference]: Start difference. First operand 376 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:55:00,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:00,070 INFO L93 Difference]: Finished difference Result 593 states and 1727 transitions. [2020-02-10 19:55:00,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:00,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:00,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:00,072 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:55:00,072 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:55:00,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:55:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 382. [2020-02-10 19:55:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:55:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1292 transitions. [2020-02-10 19:55:00,082 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1292 transitions. Word has length 22 [2020-02-10 19:55:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:00,082 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1292 transitions. [2020-02-10 19:55:00,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1292 transitions. [2020-02-10 19:55:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:00,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:00,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 19:55:00,083 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 19:55:00,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1826671162, now seen corresponding path program 1618 times [2020-02-10 19:55:00,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:00,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026967674] [2020-02-10 19:55:00,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:00,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 19:55:00,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026967674] [2020-02-10 19:55:00,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:00,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:00,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538399970] [2020-02-10 19:55:00,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:00,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:00,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:00,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:00,350 INFO L87 Difference]: Start difference. First operand 382 states and 1292 transitions. Second operand 9 states. [2020-02-10 19:55:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:00,458 INFO L93 Difference]: Finished difference Result 581 states and 1708 transitions. [2020-02-10 19:55:00,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:00,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:00,460 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:55:00,460 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:55:00,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 19:55:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:55:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 376. [2020-02-10 19:55:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:55:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1278 transitions. [2020-02-10 19:55:00,470 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1278 transitions. Word has length 22 [2020-02-10 19:55:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:00,471 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1278 transitions. [2020-02-10 19:55:00,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1278 transitions. [2020-02-10 19:55:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:00,471 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:00,471 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:00,471 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 19:55:00,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:00,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2092492520, now seen corresponding path program 1619 times [2020-02-10 19:55:00,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:00,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907050186] [2020-02-10 19:55:00,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:00,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907050186] [2020-02-10 19:55:00,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:00,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:00,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584330549] [2020-02-10 19:55:00,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:00,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:00,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:00,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:00,733 INFO L87 Difference]: Start difference. First operand 376 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:55:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:00,838 INFO L93 Difference]: Finished difference Result 585 states and 1706 transitions. [2020-02-10 19:55:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:00,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:00,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:00,840 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:55:00,840 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:55:00,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 19:55:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:55:00,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 379. [2020-02-10 19:55:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:55:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1283 transitions. [2020-02-10 19:55:00,850 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1283 transitions. Word has length 22 [2020-02-10 19:55:00,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:00,851 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1283 transitions. [2020-02-10 19:55:00,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1283 transitions. [2020-02-10 19:55:00,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:00,851 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:00,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 19:55:00,851 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 19:55:00,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:00,852 INFO L82 PathProgramCache]: Analyzing trace with hash -363445186, now seen corresponding path program 1620 times [2020-02-10 19:55:00,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:00,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871169299] [2020-02-10 19:55:00,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:01,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 19:55:01,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871169299] [2020-02-10 19:55:01,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:01,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:01,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84612793] [2020-02-10 19:55:01,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:01,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:01,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:01,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:01,119 INFO L87 Difference]: Start difference. First operand 379 states and 1283 transitions. Second operand 9 states. [2020-02-10 19:55:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:01,224 INFO L93 Difference]: Finished difference Result 578 states and 1699 transitions. [2020-02-10 19:55:01,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:01,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:01,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:01,225 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:55:01,225 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:55:01,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 19:55:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:55:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 372. [2020-02-10 19:55:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1269 transitions. [2020-02-10 19:55:01,235 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1269 transitions. Word has length 22 [2020-02-10 19:55:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:01,235 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1269 transitions. [2020-02-10 19:55:01,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1269 transitions. [2020-02-10 19:55:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:01,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55: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 19:55:01,236 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 19:55:01,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:01,236 INFO L82 PathProgramCache]: Analyzing trace with hash -621679530, now seen corresponding path program 1621 times [2020-02-10 19:55:01,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:01,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116692475] [2020-02-10 19:55:01,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:01,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 19:55:01,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116692475] [2020-02-10 19:55:01,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:01,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:01,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306554398] [2020-02-10 19:55:01,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:01,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:01,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:01,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:01,523 INFO L87 Difference]: Start difference. First operand 372 states and 1269 transitions. Second operand 9 states. [2020-02-10 19:55:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:01,603 INFO L93 Difference]: Finished difference Result 592 states and 1718 transitions. [2020-02-10 19:55:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:01,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:01,605 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:55:01,605 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:55:01,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 19:55:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:55:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 378. [2020-02-10 19:55:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:55:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1283 transitions. [2020-02-10 19:55:01,614 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1283 transitions. Word has length 22 [2020-02-10 19:55:01,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:01,615 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1283 transitions. [2020-02-10 19:55:01,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1283 transitions. [2020-02-10 19:55:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:01,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:01,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 19:55:01,615 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 19:55:01,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:01,616 INFO L82 PathProgramCache]: Analyzing trace with hash -495043156, now seen corresponding path program 1622 times [2020-02-10 19:55:01,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:01,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167925961] [2020-02-10 19:55:01,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:01,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 19:55:01,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167925961] [2020-02-10 19:55:01,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:01,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:01,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427862901] [2020-02-10 19:55:01,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:01,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:01,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:01,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:01,882 INFO L87 Difference]: Start difference. First operand 378 states and 1283 transitions. Second operand 9 states. [2020-02-10 19:55:01,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:01,984 INFO L93 Difference]: Finished difference Result 586 states and 1704 transitions. [2020-02-10 19:55:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:01,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:01,986 INFO L225 Difference]: With dead ends: 586 [2020-02-10 19:55:01,986 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 19:55:01,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 19:55:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 375. [2020-02-10 19:55:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 19:55:01,997 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 19:55:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:01,997 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 19:55:01,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 19:55:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:01,997 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:01,997 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:01,997 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 19:55:01,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:01,998 INFO L82 PathProgramCache]: Analyzing trace with hash -86449728, now seen corresponding path program 1623 times [2020-02-10 19:55:01,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:01,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801754333] [2020-02-10 19:55:01,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:02,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 19:55:02,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801754333] [2020-02-10 19:55:02,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:02,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:02,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705571233] [2020-02-10 19:55:02,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:02,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:02,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:02,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:02,274 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:55:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:02,356 INFO L93 Difference]: Finished difference Result 590 states and 1716 transitions. [2020-02-10 19:55:02,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:02,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:02,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:02,358 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:55:02,358 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:55:02,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:55:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 381. [2020-02-10 19:55:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:55:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1286 transitions. [2020-02-10 19:55:02,367 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1286 transitions. Word has length 22 [2020-02-10 19:55:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:02,367 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1286 transitions. [2020-02-10 19:55:02,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1286 transitions. [2020-02-10 19:55:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:02,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:02,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 19:55:02,368 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 19:55:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash 659981198, now seen corresponding path program 1624 times [2020-02-10 19:55:02,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:02,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806475200] [2020-02-10 19:55:02,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:02,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 19:55:02,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806475200] [2020-02-10 19:55:02,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:02,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:02,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708980603] [2020-02-10 19:55:02,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:02,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:02,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:02,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:02,634 INFO L87 Difference]: Start difference. First operand 381 states and 1286 transitions. Second operand 9 states. [2020-02-10 19:55:02,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:02,741 INFO L93 Difference]: Finished difference Result 578 states and 1697 transitions. [2020-02-10 19:55:02,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:02,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:02,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:02,742 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:55:02,743 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:55:02,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 19:55:02,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:55:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 375. [2020-02-10 19:55:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1273 transitions. [2020-02-10 19:55:02,751 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1273 transitions. Word has length 22 [2020-02-10 19:55:02,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:02,751 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1273 transitions. [2020-02-10 19:55:02,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1273 transitions. [2020-02-10 19:55:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:02,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:02,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 19:55:02,752 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 19:55:02,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:02,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2105984114, now seen corresponding path program 1625 times [2020-02-10 19:55:02,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:02,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039781779] [2020-02-10 19:55:02,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:03,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039781779] [2020-02-10 19:55:03,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:03,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:03,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567732979] [2020-02-10 19:55:03,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:03,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:03,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:03,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:03,016 INFO L87 Difference]: Start difference. First operand 375 states and 1273 transitions. Second operand 9 states. [2020-02-10 19:55:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:03,126 INFO L93 Difference]: Finished difference Result 580 states and 1691 transitions. [2020-02-10 19:55:03,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:03,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:03,127 INFO L225 Difference]: With dead ends: 580 [2020-02-10 19:55:03,128 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:55:03,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 19:55:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:55:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 377. [2020-02-10 19:55:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:55:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1276 transitions. [2020-02-10 19:55:03,138 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1276 transitions. Word has length 22 [2020-02-10 19:55:03,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:03,138 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1276 transitions. [2020-02-10 19:55:03,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1276 transitions. [2020-02-10 19:55:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:03,139 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:03,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 19:55:03,139 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 19:55:03,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1534529308, now seen corresponding path program 1626 times [2020-02-10 19:55:03,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:03,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449230950] [2020-02-10 19:55:03,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:03,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 19:55:03,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449230950] [2020-02-10 19:55:03,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:03,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:03,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758735005] [2020-02-10 19:55:03,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:03,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:03,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:03,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:03,406 INFO L87 Difference]: Start difference. First operand 377 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:55:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:03,519 INFO L93 Difference]: Finished difference Result 574 states and 1687 transitions. [2020-02-10 19:55:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:03,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:03,521 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:55:03,521 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:55:03,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 19:55:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:55:03,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 372. [2020-02-10 19:55:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1266 transitions. [2020-02-10 19:55:03,531 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1266 transitions. Word has length 22 [2020-02-10 19:55:03,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:03,531 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1266 transitions. [2020-02-10 19:55:03,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:03,531 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1266 transitions. [2020-02-10 19:55:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:03,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:03,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 19:55:03,532 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 19:55:03,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:03,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1815969736, now seen corresponding path program 1627 times [2020-02-10 19:55:03,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:03,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725811086] [2020-02-10 19:55:03,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:03,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 19:55:03,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725811086] [2020-02-10 19:55:03,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:03,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:03,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424551241] [2020-02-10 19:55:03,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:03,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:03,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:03,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:03,801 INFO L87 Difference]: Start difference. First operand 372 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:55:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:03,911 INFO L93 Difference]: Finished difference Result 572 states and 1675 transitions. [2020-02-10 19:55:03,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:03,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:03,912 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:55:03,913 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:55:03,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 19:55:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:55:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 376. [2020-02-10 19:55:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:55:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-02-10 19:55:03,922 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-02-10 19:55:03,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:03,922 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-02-10 19:55:03,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-02-10 19:55:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:03,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:03,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 19:55:03,923 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 19:55:03,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:03,923 INFO L82 PathProgramCache]: Analyzing trace with hash -474036948, now seen corresponding path program 1628 times [2020-02-10 19:55:03,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:03,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567224715] [2020-02-10 19:55:03,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:04,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 19:55:04,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567224715] [2020-02-10 19:55:04,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:04,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:04,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294694824] [2020-02-10 19:55:04,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:04,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:04,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:04,198 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:55:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:04,316 INFO L93 Difference]: Finished difference Result 571 states and 1671 transitions. [2020-02-10 19:55:04,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:04,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:04,318 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:55:04,318 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:55:04,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:04,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:55:04,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 374. [2020-02-10 19:55:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-02-10 19:55:04,328 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-02-10 19:55:04,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:04,328 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-02-10 19:55:04,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-02-10 19:55:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:04,329 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:04,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 19:55:04,329 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 19:55:04,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:04,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1280739934, now seen corresponding path program 1629 times [2020-02-10 19:55:04,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:04,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008363602] [2020-02-10 19:55:04,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:04,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 19:55:04,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008363602] [2020-02-10 19:55:04,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:04,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:04,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760530029] [2020-02-10 19:55:04,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:04,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:04,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:04,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:04,593 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-02-10 19:55:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:04,710 INFO L93 Difference]: Finished difference Result 573 states and 1677 transitions. [2020-02-10 19:55:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:04,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:04,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:04,712 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:55:04,712 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:55:04,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 19:55:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:55:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 377. [2020-02-10 19:55:04,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:55:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1276 transitions. [2020-02-10 19:55:04,721 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1276 transitions. Word has length 22 [2020-02-10 19:55:04,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:04,721 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1276 transitions. [2020-02-10 19:55:04,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:04,721 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1276 transitions. [2020-02-10 19:55:04,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:04,722 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:04,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 19:55:04,722 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 19:55:04,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:04,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1509128942, now seen corresponding path program 1630 times [2020-02-10 19:55:04,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:04,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577530856] [2020-02-10 19:55:04,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:05,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577530856] [2020-02-10 19:55:05,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:05,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:05,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685226648] [2020-02-10 19:55:05,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:05,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:05,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:05,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:05,004 INFO L87 Difference]: Start difference. First operand 377 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:55:05,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:05,113 INFO L93 Difference]: Finished difference Result 566 states and 1670 transitions. [2020-02-10 19:55:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:05,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:05,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:05,115 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:55:05,115 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 19:55:05,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 19:55:05,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 19:55:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 374. [2020-02-10 19:55:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-02-10 19:55:05,123 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-02-10 19:55:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:05,124 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-02-10 19:55:05,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-02-10 19:55:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:05,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:05,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 19:55:05,124 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 19:55:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:05,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1011892526, now seen corresponding path program 1631 times [2020-02-10 19:55:05,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:05,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401279996] [2020-02-10 19:55:05,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:05,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401279996] [2020-02-10 19:55:05,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:05,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:05,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936956086] [2020-02-10 19:55:05,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:05,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:05,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:05,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:05,392 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-02-10 19:55:05,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:05,503 INFO L93 Difference]: Finished difference Result 571 states and 1670 transitions. [2020-02-10 19:55:05,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:05,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:05,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:05,505 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:55:05,505 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:55:05,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:05,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:55:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 376. [2020-02-10 19:55:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:55:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1272 transitions. [2020-02-10 19:55:05,515 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1272 transitions. Word has length 22 [2020-02-10 19:55:05,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:05,515 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1272 transitions. [2020-02-10 19:55:05,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:05,515 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1272 transitions. [2020-02-10 19:55:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:05,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:05,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 19:55:05,516 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 19:55:05,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:05,516 INFO L82 PathProgramCache]: Analyzing trace with hash -440437720, now seen corresponding path program 1632 times [2020-02-10 19:55:05,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:05,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580780985] [2020-02-10 19:55:05,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:05,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580780985] [2020-02-10 19:55:05,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:05,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:05,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20013272] [2020-02-10 19:55:05,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:05,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:05,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:05,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:05,800 INFO L87 Difference]: Start difference. First operand 376 states and 1272 transitions. Second operand 9 states. [2020-02-10 19:55:05,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:05,927 INFO L93 Difference]: Finished difference Result 565 states and 1666 transitions. [2020-02-10 19:55:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:05,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:05,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:05,929 INFO L225 Difference]: With dead ends: 565 [2020-02-10 19:55:05,929 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:55:05,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 19:55:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:55:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 369. [2020-02-10 19:55:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 19:55:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1260 transitions. [2020-02-10 19:55:05,939 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1260 transitions. Word has length 22 [2020-02-10 19:55:05,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:05,939 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1260 transitions. [2020-02-10 19:55:05,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1260 transitions. [2020-02-10 19:55:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:05,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:05,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 19:55:05,940 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 19:55:05,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:05,940 INFO L82 PathProgramCache]: Analyzing trace with hash -817380298, now seen corresponding path program 1633 times [2020-02-10 19:55:05,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:05,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407065454] [2020-02-10 19:55:05,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:06,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 19:55:06,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407065454] [2020-02-10 19:55:06,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:06,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:06,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434560013] [2020-02-10 19:55:06,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:06,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:06,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:06,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:06,222 INFO L87 Difference]: Start difference. First operand 369 states and 1260 transitions. Second operand 9 states. [2020-02-10 19:55:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:06,308 INFO L93 Difference]: Finished difference Result 572 states and 1661 transitions. [2020-02-10 19:55:06,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:06,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:06,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:06,310 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:55:06,310 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:55:06,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 19:55:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:55:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 375. [2020-02-10 19:55:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 19:55:06,319 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 19:55:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:06,319 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 19:55:06,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 19:55:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:06,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:06,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 19:55:06,320 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 19:55:06,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:06,320 INFO L82 PathProgramCache]: Analyzing trace with hash -256311806, now seen corresponding path program 1634 times [2020-02-10 19:55:06,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:06,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482850737] [2020-02-10 19:55:06,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:06,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 19:55:06,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482850737] [2020-02-10 19:55:06,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:06,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:06,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420809412] [2020-02-10 19:55:06,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:06,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:06,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:06,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:06,611 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:55:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:06,692 INFO L93 Difference]: Finished difference Result 565 states and 1646 transitions. [2020-02-10 19:55:06,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:06,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:06,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:06,694 INFO L225 Difference]: With dead ends: 565 [2020-02-10 19:55:06,694 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:55:06,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 19:55:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:55:06,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 373. [2020-02-10 19:55:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 19:55:06,704 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 19:55:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:06,705 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 19:55:06,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 19:55:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:06,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:06,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 19:55:06,705 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 19:55:06,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:06,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1877149144, now seen corresponding path program 1635 times [2020-02-10 19:55:06,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:06,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135291115] [2020-02-10 19:55:06,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:06,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 19:55:06,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135291115] [2020-02-10 19:55:06,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:06,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:06,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994735887] [2020-02-10 19:55:06,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:06,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:06,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:06,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:06,992 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 19:55:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:07,080 INFO L93 Difference]: Finished difference Result 574 states and 1664 transitions. [2020-02-10 19:55:07,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:07,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:07,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:07,082 INFO L225 Difference]: With dead ends: 574 [2020-02-10 19:55:07,082 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:55:07,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 19:55:07,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:55:07,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 376. [2020-02-10 19:55:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:55:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-02-10 19:55:07,092 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-02-10 19:55:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:07,092 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-02-10 19:55:07,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-02-10 19:55:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:07,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:07,093 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:07,093 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 19:55:07,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:07,093 INFO L82 PathProgramCache]: Analyzing trace with hash 914945482, now seen corresponding path program 1636 times [2020-02-10 19:55:07,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:07,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676379057] [2020-02-10 19:55:07,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:07,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 19:55:07,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676379057] [2020-02-10 19:55:07,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:07,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:07,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661051248] [2020-02-10 19:55:07,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:07,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:07,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:07,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:07,373 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:55:07,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:07,481 INFO L93 Difference]: Finished difference Result 568 states and 1650 transitions. [2020-02-10 19:55:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:07,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:07,483 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:55:07,483 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 19:55:07,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 19:55:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 19:55:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 373. [2020-02-10 19:55:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 19:55:07,492 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 19:55:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:07,492 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 19:55:07,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:07,493 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 19:55:07,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:07,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:07,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 19:55:07,493 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 19:55:07,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:07,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1931871370, now seen corresponding path program 1637 times [2020-02-10 19:55:07,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:07,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413229747] [2020-02-10 19:55:07,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:07,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 19:55:07,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413229747] [2020-02-10 19:55:07,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:07,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:07,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411349961] [2020-02-10 19:55:07,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:07,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:07,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:07,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:07,785 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:55:07,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:07,866 INFO L93 Difference]: Finished difference Result 558 states and 1631 transitions. [2020-02-10 19:55:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:07,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:07,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:07,868 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:55:07,868 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 19:55:07,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 19:55:07,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 19:55:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 374. [2020-02-10 19:55:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-02-10 19:55:07,878 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-02-10 19:55:07,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:07,878 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-02-10 19:55:07,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-02-10 19:55:07,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:07,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:07,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 19:55:07,879 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 19:55:07,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:07,879 INFO L82 PathProgramCache]: Analyzing trace with hash -752154968, now seen corresponding path program 1638 times [2020-02-10 19:55:07,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:07,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263580276] [2020-02-10 19:55:07,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:08,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263580276] [2020-02-10 19:55:08,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:08,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:08,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516416055] [2020-02-10 19:55:08,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:08,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:08,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:08,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:08,166 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-02-10 19:55:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:08,272 INFO L93 Difference]: Finished difference Result 559 states and 1632 transitions. [2020-02-10 19:55:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:08,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:08,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:08,274 INFO L225 Difference]: With dead ends: 559 [2020-02-10 19:55:08,274 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:55:08,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 19:55:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:55:08,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 371. [2020-02-10 19:55:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1266 transitions. [2020-02-10 19:55:08,284 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1266 transitions. Word has length 22 [2020-02-10 19:55:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:08,284 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1266 transitions. [2020-02-10 19:55:08,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1266 transitions. [2020-02-10 19:55:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:08,285 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:08,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 19:55:08,285 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 19:55:08,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:08,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1857616096, now seen corresponding path program 1639 times [2020-02-10 19:55:08,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:08,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935832451] [2020-02-10 19:55:08,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:08,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 19:55:08,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935832451] [2020-02-10 19:55:08,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:08,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:08,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89275667] [2020-02-10 19:55:08,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:08,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:08,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:08,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:08,587 INFO L87 Difference]: Start difference. First operand 371 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:55:08,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:08,668 INFO L93 Difference]: Finished difference Result 576 states and 1670 transitions. [2020-02-10 19:55:08,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:08,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:08,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:08,670 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:55:08,670 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:55:08,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:08,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:55:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 375. [2020-02-10 19:55:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-02-10 19:55:08,679 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-02-10 19:55:08,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:08,680 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-02-10 19:55:08,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-02-10 19:55:08,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:08,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:08,680 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:08,680 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 19:55:08,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:08,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1296547604, now seen corresponding path program 1640 times [2020-02-10 19:55:08,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:08,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121992437] [2020-02-10 19:55:08,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:08,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 19:55:08,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121992437] [2020-02-10 19:55:08,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:08,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:08,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542937276] [2020-02-10 19:55:08,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:08,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:08,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:08,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:08,967 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-02-10 19:55:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:09,049 INFO L93 Difference]: Finished difference Result 569 states and 1655 transitions. [2020-02-10 19:55:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:09,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:09,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:09,051 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:55:09,051 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:55:09,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:55:09,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 373. [2020-02-10 19:55:09,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 19:55:09,060 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 19:55:09,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:09,060 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 19:55:09,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:09,060 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 19:55:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:09,061 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:09,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 19:55:09,061 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 19:55:09,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:09,061 INFO L82 PathProgramCache]: Analyzing trace with hash 249168024, now seen corresponding path program 1641 times [2020-02-10 19:55:09,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:09,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618722131] [2020-02-10 19:55:09,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:09,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 19:55:09,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618722131] [2020-02-10 19:55:09,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:09,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:09,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873794682] [2020-02-10 19:55:09,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:09,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:09,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:09,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:09,347 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:55:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:09,425 INFO L93 Difference]: Finished difference Result 576 states and 1674 transitions. [2020-02-10 19:55:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:09,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:09,427 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:55:09,427 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:55:09,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 19:55:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:55:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 379. [2020-02-10 19:55:09,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:55:09,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1280 transitions. [2020-02-10 19:55:09,437 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1280 transitions. Word has length 22 [2020-02-10 19:55:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:09,437 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1280 transitions. [2020-02-10 19:55:09,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1280 transitions. [2020-02-10 19:55:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:09,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:09,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 19:55:09,438 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 19:55:09,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:09,438 INFO L82 PathProgramCache]: Analyzing trace with hash 441988716, now seen corresponding path program 1642 times [2020-02-10 19:55:09,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:09,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688198020] [2020-02-10 19:55:09,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:09,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 19:55:09,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688198020] [2020-02-10 19:55:09,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:09,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:09,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886498190] [2020-02-10 19:55:09,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:09,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:09,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:09,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:09,726 INFO L87 Difference]: Start difference. First operand 379 states and 1280 transitions. Second operand 9 states. [2020-02-10 19:55:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:09,833 INFO L93 Difference]: Finished difference Result 564 states and 1655 transitions. [2020-02-10 19:55:09,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:09,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:09,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:09,835 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:55:09,835 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:55:09,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 19:55:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:55:09,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 373. [2020-02-10 19:55:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 19:55:09,845 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 19:55:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:09,846 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 19:55:09,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 19:55:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:09,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:09,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 19:55:09,846 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 19:55:09,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:09,847 INFO L82 PathProgramCache]: Analyzing trace with hash 303890250, now seen corresponding path program 1643 times [2020-02-10 19:55:09,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:09,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450572311] [2020-02-10 19:55:09,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:10,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450572311] [2020-02-10 19:55:10,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:10,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:10,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406687316] [2020-02-10 19:55:10,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:10,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:10,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:10,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:10,137 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:55:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:10,228 INFO L93 Difference]: Finished difference Result 564 states and 1645 transitions. [2020-02-10 19:55:10,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:10,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:10,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:10,230 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:55:10,230 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 19:55:10,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 19:55:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 19:55:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 374. [2020-02-10 19:55:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-02-10 19:55:10,239 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-02-10 19:55:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:10,239 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-02-10 19:55:10,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-02-10 19:55:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:10,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:10,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 19:55:10,240 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 19:55:10,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:10,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1844906286, now seen corresponding path program 1644 times [2020-02-10 19:55:10,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:10,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64039047] [2020-02-10 19:55:10,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:10,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 19:55:10,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64039047] [2020-02-10 19:55:10,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:10,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:10,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17541098] [2020-02-10 19:55:10,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:10,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:10,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:10,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:10,527 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-02-10 19:55:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:10,636 INFO L93 Difference]: Finished difference Result 559 states and 1644 transitions. [2020-02-10 19:55:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:10,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:10,637 INFO L225 Difference]: With dead ends: 559 [2020-02-10 19:55:10,638 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 19:55:10,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 19:55:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 19:55:10,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 371. [2020-02-10 19:55:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-02-10 19:55:10,647 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-02-10 19:55:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:10,647 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-02-10 19:55:10,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-02-10 19:55:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:10,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:10,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 19:55:10,648 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 19:55:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:10,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1532019872, now seen corresponding path program 1645 times [2020-02-10 19:55:10,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:10,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353317159] [2020-02-10 19:55:10,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:10,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 19:55:10,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353317159] [2020-02-10 19:55:10,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:10,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:10,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992450901] [2020-02-10 19:55:10,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:10,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:10,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:10,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:10,930 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-02-10 19:55:11,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:11,016 INFO L93 Difference]: Finished difference Result 581 states and 1682 transitions. [2020-02-10 19:55:11,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:11,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:11,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:11,018 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:55:11,018 INFO L226 Difference]: Without dead ends: 565 [2020-02-10 19:55:11,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 19:55:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-02-10 19:55:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 377. [2020-02-10 19:55:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:55:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1278 transitions. [2020-02-10 19:55:11,028 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1278 transitions. Word has length 22 [2020-02-10 19:55:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:11,028 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1278 transitions. [2020-02-10 19:55:11,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1278 transitions. [2020-02-10 19:55:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:11,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:11,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 19:55:11,029 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 19:55:11,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:11,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1800743762, now seen corresponding path program 1646 times [2020-02-10 19:55:11,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:11,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610102145] [2020-02-10 19:55:11,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:11,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 19:55:11,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610102145] [2020-02-10 19:55:11,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:11,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:11,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632013240] [2020-02-10 19:55:11,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:11,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:11,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:11,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:11,315 INFO L87 Difference]: Start difference. First operand 377 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:55:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:11,428 INFO L93 Difference]: Finished difference Result 575 states and 1668 transitions. [2020-02-10 19:55:11,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:11,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:11,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:11,430 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:55:11,430 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:55:11,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 19:55:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:55:11,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 374. [2020-02-10 19:55:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-02-10 19:55:11,440 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-02-10 19:55:11,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:11,440 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-02-10 19:55:11,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-02-10 19:55:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:11,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:11,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 19:55:11,441 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 19:55:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2119765194, now seen corresponding path program 1647 times [2020-02-10 19:55:11,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:11,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072936409] [2020-02-10 19:55:11,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:11,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 19:55:11,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072936409] [2020-02-10 19:55:11,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:11,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:11,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49851898] [2020-02-10 19:55:11,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:11,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:11,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:11,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:11,730 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-02-10 19:55:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:11,844 INFO L93 Difference]: Finished difference Result 579 states and 1680 transitions. [2020-02-10 19:55:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:11,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:11,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:11,846 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:55:11,846 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:55:11,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:11,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:55:11,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 380. [2020-02-10 19:55:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:55:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1281 transitions. [2020-02-10 19:55:11,855 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1281 transitions. Word has length 22 [2020-02-10 19:55:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:11,855 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1281 transitions. [2020-02-10 19:55:11,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1281 transitions. [2020-02-10 19:55:11,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:11,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:11,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 19:55:11,856 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 19:55:11,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:11,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1926944502, now seen corresponding path program 1648 times [2020-02-10 19:55:11,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:11,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918984881] [2020-02-10 19:55:11,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:12,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 19:55:12,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918984881] [2020-02-10 19:55:12,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:12,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:12,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965836029] [2020-02-10 19:55:12,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:12,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:12,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:12,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:12,147 INFO L87 Difference]: Start difference. First operand 380 states and 1281 transitions. Second operand 9 states. [2020-02-10 19:55:12,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:12,260 INFO L93 Difference]: Finished difference Result 567 states and 1661 transitions. [2020-02-10 19:55:12,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:12,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:12,261 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:55:12,262 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:55:12,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 19:55:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:55:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 374. [2020-02-10 19:55:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1268 transitions. [2020-02-10 19:55:12,271 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1268 transitions. Word has length 22 [2020-02-10 19:55:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:12,271 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1268 transitions. [2020-02-10 19:55:12,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1268 transitions. [2020-02-10 19:55:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:12,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:12,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 19:55:12,272 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 19:55:12,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:12,272 INFO L82 PathProgramCache]: Analyzing trace with hash 207754734, now seen corresponding path program 1649 times [2020-02-10 19:55:12,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:12,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360528310] [2020-02-10 19:55:12,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:12,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360528310] [2020-02-10 19:55:12,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:12,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:12,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117989354] [2020-02-10 19:55:12,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:12,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:12,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:12,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:12,550 INFO L87 Difference]: Start difference. First operand 374 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:55:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:12,663 INFO L93 Difference]: Finished difference Result 569 states and 1655 transitions. [2020-02-10 19:55:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:12,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:12,664 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:55:12,665 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:55:12,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 19:55:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:55:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 376. [2020-02-10 19:55:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:55:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1271 transitions. [2020-02-10 19:55:12,674 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1271 transitions. Word has length 22 [2020-02-10 19:55:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:12,674 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1271 transitions. [2020-02-10 19:55:12,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1271 transitions. [2020-02-10 19:55:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:12,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:12,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:12,675 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 19:55:12,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:12,675 INFO L82 PathProgramCache]: Analyzing trace with hash 779209540, now seen corresponding path program 1650 times [2020-02-10 19:55:12,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:12,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175304605] [2020-02-10 19:55:12,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:12,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 19:55:12,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175304605] [2020-02-10 19:55:12,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:12,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:12,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852751053] [2020-02-10 19:55:12,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:12,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:12,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:12,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:12,948 INFO L87 Difference]: Start difference. First operand 376 states and 1271 transitions. Second operand 9 states. [2020-02-10 19:55:13,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:13,061 INFO L93 Difference]: Finished difference Result 563 states and 1651 transitions. [2020-02-10 19:55:13,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:13,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:13,063 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:55:13,063 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:55:13,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 19:55:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:55:13,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 371. [2020-02-10 19:55:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-02-10 19:55:13,071 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-02-10 19:55:13,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:13,072 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-02-10 19:55:13,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-02-10 19:55:13,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:13,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:13,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 19:55:13,072 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 19:55:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:13,072 INFO L82 PathProgramCache]: Analyzing trace with hash 5837292, now seen corresponding path program 1651 times [2020-02-10 19:55:13,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:13,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234826729] [2020-02-10 19:55:13,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:13,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 19:55:13,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234826729] [2020-02-10 19:55:13,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:13,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:13,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276946347] [2020-02-10 19:55:13,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:13,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:13,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:13,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:13,371 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-02-10 19:55:13,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:13,464 INFO L93 Difference]: Finished difference Result 551 states and 1615 transitions. [2020-02-10 19:55:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:13,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:13,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:13,466 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:55:13,466 INFO L226 Difference]: Without dead ends: 542 [2020-02-10 19:55:13,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 19:55:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-02-10 19:55:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 373. [2020-02-10 19:55:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-02-10 19:55:13,476 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-02-10 19:55:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:13,476 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-02-10 19:55:13,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-02-10 19:55:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:13,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:13,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 19:55:13,477 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 19:55:13,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:13,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1616778250, now seen corresponding path program 1652 times [2020-02-10 19:55:13,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:13,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789780900] [2020-02-10 19:55:13,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:13,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 19:55:13,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789780900] [2020-02-10 19:55:13,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:13,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:13,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471317800] [2020-02-10 19:55:13,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:13,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:13,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:13,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:13,772 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:55:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:13,889 INFO L93 Difference]: Finished difference Result 552 states and 1616 transitions. [2020-02-10 19:55:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:13,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:13,891 INFO L225 Difference]: With dead ends: 552 [2020-02-10 19:55:13,891 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:55:13,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:55:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 372. [2020-02-10 19:55:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1264 transitions. [2020-02-10 19:55:13,899 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1264 transitions. Word has length 22 [2020-02-10 19:55:13,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:13,899 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1264 transitions. [2020-02-10 19:55:13,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:13,899 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1264 transitions. [2020-02-10 19:55:13,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:13,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:13,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 19:55:13,900 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 19:55:13,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:13,900 INFO L82 PathProgramCache]: Analyzing trace with hash -581908030, now seen corresponding path program 1653 times [2020-02-10 19:55:13,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:13,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779282545] [2020-02-10 19:55:13,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:14,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 19:55:14,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779282545] [2020-02-10 19:55:14,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:14,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:14,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745979521] [2020-02-10 19:55:14,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:14,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:14,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:14,195 INFO L87 Difference]: Start difference. First operand 372 states and 1264 transitions. Second operand 9 states. [2020-02-10 19:55:14,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:14,287 INFO L93 Difference]: Finished difference Result 553 states and 1619 transitions. [2020-02-10 19:55:14,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:14,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:14,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:14,289 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:55:14,289 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:55: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 19:55:14,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:55:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 373. [2020-02-10 19:55:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1265 transitions. [2020-02-10 19:55:14,298 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1265 transitions. Word has length 22 [2020-02-10 19:55:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:14,298 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1265 transitions. [2020-02-10 19:55:14,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1265 transitions. [2020-02-10 19:55:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:14,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:14,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 19:55:14,299 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 19:55:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:14,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1564262730, now seen corresponding path program 1654 times [2020-02-10 19:55:14,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:14,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660133653] [2020-02-10 19:55:14,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:14,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 19:55:14,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660133653] [2020-02-10 19:55:14,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:14,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:14,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096923653] [2020-02-10 19:55:14,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:14,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:14,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:14,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:14,582 INFO L87 Difference]: Start difference. First operand 373 states and 1265 transitions. Second operand 9 states. [2020-02-10 19:55:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:14,724 INFO L93 Difference]: Finished difference Result 548 states and 1618 transitions. [2020-02-10 19:55:14,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:14,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:14,726 INFO L225 Difference]: With dead ends: 548 [2020-02-10 19:55:14,726 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 19:55:14,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 19:55:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 19:55:14,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 372. [2020-02-10 19:55:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-02-10 19:55:14,736 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-02-10 19:55:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:14,736 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-02-10 19:55:14,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-02-10 19:55:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:14,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:14,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 19:55:14,737 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 19:55:14,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:14,737 INFO L82 PathProgramCache]: Analyzing trace with hash -571404926, now seen corresponding path program 1655 times [2020-02-10 19:55:14,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:14,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726721432] [2020-02-10 19:55:14,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:15,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 19:55:15,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726721432] [2020-02-10 19:55:15,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:15,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:15,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899446967] [2020-02-10 19:55:15,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:15,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:15,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:15,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:15,024 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-02-10 19:55:15,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:15,138 INFO L93 Difference]: Finished difference Result 555 states and 1623 transitions. [2020-02-10 19:55:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:15,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:15,140 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:55:15,140 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:55:15,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 19:55:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:55:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 374. [2020-02-10 19:55:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1266 transitions. [2020-02-10 19:55:15,150 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1266 transitions. Word has length 22 [2020-02-10 19:55:15,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:15,150 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1266 transitions. [2020-02-10 19:55:15,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1266 transitions. [2020-02-10 19:55:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:15,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:15,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 19:55:15,151 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 19:55:15,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:15,151 INFO L82 PathProgramCache]: Analyzing trace with hash -36175124, now seen corresponding path program 1656 times [2020-02-10 19:55:15,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:15,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432929485] [2020-02-10 19:55:15,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:15,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 19:55:15,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432929485] [2020-02-10 19:55:15,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:15,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:15,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090104888] [2020-02-10 19:55:15,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:15,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:15,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:15,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:15,435 INFO L87 Difference]: Start difference. First operand 374 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:55:15,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:15,556 INFO L93 Difference]: Finished difference Result 549 states and 1619 transitions. [2020-02-10 19:55:15,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:15,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:15,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:15,558 INFO L225 Difference]: With dead ends: 549 [2020-02-10 19:55:15,558 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:55:15,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:55:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 369. [2020-02-10 19:55:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 19:55:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1258 transitions. [2020-02-10 19:55:15,568 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1258 transitions. Word has length 22 [2020-02-10 19:55:15,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:15,568 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1258 transitions. [2020-02-10 19:55:15,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1258 transitions. [2020-02-10 19:55:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:15,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:15,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 19:55:15,569 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 19:55:15,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:15,569 INFO L82 PathProgramCache]: Analyzing trace with hash 995426200, now seen corresponding path program 1657 times [2020-02-10 19:55:15,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:15,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53868530] [2020-02-10 19:55:15,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:15,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 19:55:15,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53868530] [2020-02-10 19:55:15,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:15,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:15,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898682688] [2020-02-10 19:55:15,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:15,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:15,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:15,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:15,883 INFO L87 Difference]: Start difference. First operand 369 states and 1258 transitions. Second operand 9 states. [2020-02-10 19:55:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:15,997 INFO L93 Difference]: Finished difference Result 540 states and 1592 transitions. [2020-02-10 19:55:15,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:15,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:15,998 INFO L225 Difference]: With dead ends: 540 [2020-02-10 19:55:15,999 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 19:55:15,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 19:55:16,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 19:55:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 372. [2020-02-10 19:55:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1266 transitions. [2020-02-10 19:55:16,008 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1266 transitions. Word has length 22 [2020-02-10 19:55:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:16,008 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1266 transitions. [2020-02-10 19:55:16,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1266 transitions. [2020-02-10 19:55:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:16,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:16,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 19:55:16,009 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 19:55:16,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:16,009 INFO L82 PathProgramCache]: Analyzing trace with hash -450090810, now seen corresponding path program 1658 times [2020-02-10 19:55:16,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:16,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981259439] [2020-02-10 19:55:16,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:16,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 19:55:16,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981259439] [2020-02-10 19:55:16,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:16,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:16,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110196482] [2020-02-10 19:55:16,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:16,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:16,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:16,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:16,311 INFO L87 Difference]: Start difference. First operand 372 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:55:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:16,407 INFO L93 Difference]: Finished difference Result 538 states and 1587 transitions. [2020-02-10 19:55:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:16,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:16,409 INFO L225 Difference]: With dead ends: 538 [2020-02-10 19:55:16,409 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 19:55:16,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 19:55:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 371. [2020-02-10 19:55:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-02-10 19:55:16,418 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-02-10 19:55:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:16,419 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-02-10 19:55:16,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-02-10 19:55:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:16,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:16,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 19:55:16,419 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 19:55:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:16,420 INFO L82 PathProgramCache]: Analyzing trace with hash -605011654, now seen corresponding path program 1659 times [2020-02-10 19:55:16,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:16,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281559649] [2020-02-10 19:55:16,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:16,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 19:55:16,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281559649] [2020-02-10 19:55:16,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:16,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:16,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221494867] [2020-02-10 19:55:16,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:16,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:16,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:16,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:16,717 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-02-10 19:55:16,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:16,834 INFO L93 Difference]: Finished difference Result 542 states and 1596 transitions. [2020-02-10 19:55:16,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:16,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:16,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:16,835 INFO L225 Difference]: With dead ends: 542 [2020-02-10 19:55:16,836 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:55:16,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 19:55:16,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:55:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 373. [2020-02-10 19:55:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1267 transitions. [2020-02-10 19:55:16,846 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1267 transitions. Word has length 22 [2020-02-10 19:55:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:16,846 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1267 transitions. [2020-02-10 19:55:16,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1267 transitions. [2020-02-10 19:55:16,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:16,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:16,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 19:55:16,847 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 19:55:16,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:16,847 INFO L82 PathProgramCache]: Analyzing trace with hash -351918902, now seen corresponding path program 1660 times [2020-02-10 19:55:16,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:16,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430903736] [2020-02-10 19:55:16,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:17,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 19:55:17,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430903736] [2020-02-10 19:55:17,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:17,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:17,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790607851] [2020-02-10 19:55:17,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:17,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:17,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:17,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:17,145 INFO L87 Difference]: Start difference. First operand 373 states and 1267 transitions. Second operand 9 states. [2020-02-10 19:55:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:17,268 INFO L93 Difference]: Finished difference Result 541 states and 1592 transitions. [2020-02-10 19:55:17,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:17,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:17,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:17,270 INFO L225 Difference]: With dead ends: 541 [2020-02-10 19:55:17,270 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 19:55:17,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 19:55:17,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 19:55:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 371. [2020-02-10 19:55:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1263 transitions. [2020-02-10 19:55:17,279 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1263 transitions. Word has length 22 [2020-02-10 19:55:17,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:17,279 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1263 transitions. [2020-02-10 19:55:17,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1263 transitions. [2020-02-10 19:55:17,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:17,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:17,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 19:55:17,280 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 19:55:17,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:17,280 INFO L82 PathProgramCache]: Analyzing trace with hash 644000778, now seen corresponding path program 1661 times [2020-02-10 19:55:17,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:17,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789781272] [2020-02-10 19:55:17,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:17,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 19:55:17,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789781272] [2020-02-10 19:55:17,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:17,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:17,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194328714] [2020-02-10 19:55:17,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:17,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:17,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:17,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:17,589 INFO L87 Difference]: Start difference. First operand 371 states and 1263 transitions. Second operand 9 states. [2020-02-10 19:55:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:17,683 INFO L93 Difference]: Finished difference Result 537 states and 1584 transitions. [2020-02-10 19:55:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:17,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:17,685 INFO L225 Difference]: With dead ends: 537 [2020-02-10 19:55:17,685 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 19:55:17,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 19:55:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 372. [2020-02-10 19:55:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1264 transitions. [2020-02-10 19:55:17,695 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1264 transitions. Word has length 22 [2020-02-10 19:55:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:17,695 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1264 transitions. [2020-02-10 19:55:17,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1264 transitions. [2020-02-10 19:55:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:17,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:17,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 19:55:17,696 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 19:55:17,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:17,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2040025560, now seen corresponding path program 1662 times [2020-02-10 19:55:17,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:17,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869149026] [2020-02-10 19:55:17,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:17,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 19:55:17,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869149026] [2020-02-10 19:55:17,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:17,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:17,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988117679] [2020-02-10 19:55:17,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:17,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:17,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:17,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:17,994 INFO L87 Difference]: Start difference. First operand 372 states and 1264 transitions. Second operand 9 states. [2020-02-10 19:55:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:18,112 INFO L93 Difference]: Finished difference Result 538 states and 1585 transitions. [2020-02-10 19:55:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:18,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:18,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:18,114 INFO L225 Difference]: With dead ends: 538 [2020-02-10 19:55:18,114 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 19:55:18,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 19:55:18,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 19:55:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 370. [2020-02-10 19:55:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 19:55:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1261 transitions. [2020-02-10 19:55:18,124 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1261 transitions. Word has length 22 [2020-02-10 19:55:18,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:18,124 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1261 transitions. [2020-02-10 19:55:18,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1261 transitions. [2020-02-10 19:55:18,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:18,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:18,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 19:55:18,125 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 19:55:18,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:18,125 INFO L82 PathProgramCache]: Analyzing trace with hash -44809598, now seen corresponding path program 1663 times [2020-02-10 19:55:18,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:18,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233940309] [2020-02-10 19:55:18,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:18,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 19:55:18,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233940309] [2020-02-10 19:55:18,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:18,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:18,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693582918] [2020-02-10 19:55:18,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:18,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:18,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:18,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:18,413 INFO L87 Difference]: Start difference. First operand 370 states and 1261 transitions. Second operand 9 states. [2020-02-10 19:55:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:18,528 INFO L93 Difference]: Finished difference Result 543 states and 1598 transitions. [2020-02-10 19:55:18,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:18,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:18,530 INFO L225 Difference]: With dead ends: 543 [2020-02-10 19:55:18,530 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 19:55:18,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 19:55:18,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 19:55:18,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 372. [2020-02-10 19:55:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1265 transitions. [2020-02-10 19:55:18,538 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1265 transitions. Word has length 22 [2020-02-10 19:55:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:18,539 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1265 transitions. [2020-02-10 19:55:18,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1265 transitions. [2020-02-10 19:55:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:18,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:18,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 19:55:18,539 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 19:55:18,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:18,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1490326608, now seen corresponding path program 1664 times [2020-02-10 19:55:18,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:18,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771491368] [2020-02-10 19:55:18,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:18,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771491368] [2020-02-10 19:55:18,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:18,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:18,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378817591] [2020-02-10 19:55:18,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:18,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:18,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:18,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:18,828 INFO L87 Difference]: Start difference. First operand 372 states and 1265 transitions. Second operand 9 states. [2020-02-10 19:55:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:18,937 INFO L93 Difference]: Finished difference Result 541 states and 1593 transitions. [2020-02-10 19:55:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:18,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:18,939 INFO L225 Difference]: With dead ends: 541 [2020-02-10 19:55:18,939 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:55:18,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 19:55:18,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:55:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 371. [2020-02-10 19:55:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1263 transitions. [2020-02-10 19:55:18,948 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1263 transitions. Word has length 22 [2020-02-10 19:55:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:18,949 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1263 transitions. [2020-02-10 19:55:18,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1263 transitions. [2020-02-10 19:55:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:18,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:18,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 19:55:18,949 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 19:55:18,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:18,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2061974522, now seen corresponding path program 1665 times [2020-02-10 19:55:18,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:18,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697329594] [2020-02-10 19:55:18,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:19,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 19:55:19,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697329594] [2020-02-10 19:55:19,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:19,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:19,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682092984] [2020-02-10 19:55:19,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:19,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:19,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:19,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:19,232 INFO L87 Difference]: Start difference. First operand 371 states and 1263 transitions. Second operand 9 states. [2020-02-10 19:55:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:19,345 INFO L93 Difference]: Finished difference Result 546 states and 1606 transitions. [2020-02-10 19:55:19,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:19,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:19,347 INFO L225 Difference]: With dead ends: 546 [2020-02-10 19:55:19,347 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:55:19,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 19:55:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:55:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 374. [2020-02-10 19:55:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1268 transitions. [2020-02-10 19:55:19,357 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1268 transitions. Word has length 22 [2020-02-10 19:55:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:19,357 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1268 transitions. [2020-02-10 19:55:19,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1268 transitions. [2020-02-10 19:55:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:19,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:19,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 19:55:19,358 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 19:55:19,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:19,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1279975280, now seen corresponding path program 1666 times [2020-02-10 19:55:19,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:19,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230051401] [2020-02-10 19:55:19,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:19,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 19:55:19,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230051401] [2020-02-10 19:55:19,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:19,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:19,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772713275] [2020-02-10 19:55:19,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:19,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:19,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:19,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:19,649 INFO L87 Difference]: Start difference. First operand 374 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:55:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:19,768 INFO L93 Difference]: Finished difference Result 539 states and 1599 transitions. [2020-02-10 19:55:19,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:19,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:19,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:19,770 INFO L225 Difference]: With dead ends: 539 [2020-02-10 19:55:19,770 INFO L226 Difference]: Without dead ends: 523 [2020-02-10 19:55:19,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 19:55:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-02-10 19:55:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 371. [2020-02-10 19:55:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-02-10 19:55:19,780 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-02-10 19:55:19,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:19,780 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-02-10 19:55:19,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-02-10 19:55:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:19,781 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:19,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 19:55:19,781 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 19:55:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:19,781 INFO L82 PathProgramCache]: Analyzing trace with hash -983980342, now seen corresponding path program 1667 times [2020-02-10 19:55:19,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:19,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606210422] [2020-02-10 19:55:19,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:20,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606210422] [2020-02-10 19:55:20,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:20,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:20,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918704701] [2020-02-10 19:55:20,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:20,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:20,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:20,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:20,068 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-02-10 19:55:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:20,183 INFO L93 Difference]: Finished difference Result 542 states and 1595 transitions. [2020-02-10 19:55:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:20,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:20,185 INFO L225 Difference]: With dead ends: 542 [2020-02-10 19:55:20,185 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:55:20,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 19:55:20,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:55:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 372. [2020-02-10 19:55:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-02-10 19:55:20,195 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-02-10 19:55:20,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:20,195 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-02-10 19:55:20,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-02-10 19:55:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:20,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:20,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 19:55:20,196 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 19:55:20,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:20,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1162190418, now seen corresponding path program 1668 times [2020-02-10 19:55:20,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:20,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076232524] [2020-02-10 19:55:20,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:20,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 19:55:20,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076232524] [2020-02-10 19:55:20,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:20,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:20,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199162800] [2020-02-10 19:55:20,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:20,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:20,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:20,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:20,472 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-02-10 19:55:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:20,594 INFO L93 Difference]: Finished difference Result 537 states and 1594 transitions. [2020-02-10 19:55:20,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:20,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:20,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:20,596 INFO L225 Difference]: With dead ends: 537 [2020-02-10 19:55:20,596 INFO L226 Difference]: Without dead ends: 522 [2020-02-10 19:55:20,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 19:55:20,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-02-10 19:55:20,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 370. [2020-02-10 19:55:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 19:55:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1260 transitions. [2020-02-10 19:55:20,606 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1260 transitions. Word has length 22 [2020-02-10 19:55:20,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:20,606 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1260 transitions. [2020-02-10 19:55:20,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1260 transitions. [2020-02-10 19:55:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:20,607 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:20,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 19:55:20,607 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 19:55:20,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:20,607 INFO L82 PathProgramCache]: Analyzing trace with hash 280786626, now seen corresponding path program 1669 times [2020-02-10 19:55:20,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:20,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876268699] [2020-02-10 19:55:20,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:20,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 19:55:20,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876268699] [2020-02-10 19:55:20,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:20,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:20,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042024733] [2020-02-10 19:55:20,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:20,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:20,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:20,897 INFO L87 Difference]: Start difference. First operand 370 states and 1260 transitions. Second operand 9 states. [2020-02-10 19:55:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:21,015 INFO L93 Difference]: Finished difference Result 548 states and 1611 transitions. [2020-02-10 19:55:21,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:21,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:21,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:21,017 INFO L225 Difference]: With dead ends: 548 [2020-02-10 19:55:21,017 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:55:21,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 19:55:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:55:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 374. [2020-02-10 19:55:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1270 transitions. [2020-02-10 19:55:21,026 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1270 transitions. Word has length 22 [2020-02-10 19:55:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:21,026 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1270 transitions. [2020-02-10 19:55:21,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1270 transitions. [2020-02-10 19:55:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:21,027 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:21,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 19:55:21,027 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 19:55:21,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:21,027 INFO L82 PathProgramCache]: Analyzing trace with hash 533879378, now seen corresponding path program 1670 times [2020-02-10 19:55:21,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:21,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249080050] [2020-02-10 19:55:21,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:21,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 19:55:21,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249080050] [2020-02-10 19:55:21,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:21,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:21,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126083146] [2020-02-10 19:55:21,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:21,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:21,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:21,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:21,308 INFO L87 Difference]: Start difference. First operand 374 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:55:21,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:21,428 INFO L93 Difference]: Finished difference Result 547 states and 1607 transitions. [2020-02-10 19:55:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:21,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:21,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:21,429 INFO L225 Difference]: With dead ends: 547 [2020-02-10 19:55:21,430 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:55:21,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 19:55:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:55:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 372. [2020-02-10 19:55:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1265 transitions. [2020-02-10 19:55:21,440 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1265 transitions. Word has length 22 [2020-02-10 19:55:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:21,440 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1265 transitions. [2020-02-10 19:55:21,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1265 transitions. [2020-02-10 19:55:21,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:21,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:21,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 19:55:21,441 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 19:55:21,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:21,441 INFO L82 PathProgramCache]: Analyzing trace with hash -306958696, now seen corresponding path program 1671 times [2020-02-10 19:55:21,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:21,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402184125] [2020-02-10 19:55:21,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:21,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402184125] [2020-02-10 19:55:21,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:21,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:21,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511450989] [2020-02-10 19:55:21,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:21,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:21,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:21,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:21,722 INFO L87 Difference]: Start difference. First operand 372 states and 1265 transitions. Second operand 9 states. [2020-02-10 19:55:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:21,837 INFO L93 Difference]: Finished difference Result 549 states and 1613 transitions. [2020-02-10 19:55:21,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:21,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:21,839 INFO L225 Difference]: With dead ends: 549 [2020-02-10 19:55:21,839 INFO L226 Difference]: Without dead ends: 538 [2020-02-10 19:55:21,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-02-10 19:55:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 375. [2020-02-10 19:55:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1270 transitions. [2020-02-10 19:55:21,848 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1270 transitions. Word has length 22 [2020-02-10 19:55:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:21,848 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1270 transitions. [2020-02-10 19:55:21,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1270 transitions. [2020-02-10 19:55:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:21,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:21,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 19:55:21,849 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 19:55:21,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:21,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1088957938, now seen corresponding path program 1672 times [2020-02-10 19:55:21,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:21,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996566048] [2020-02-10 19:55:21,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:22,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996566048] [2020-02-10 19:55:22,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:22,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:22,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693125106] [2020-02-10 19:55:22,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:22,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:22,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:22,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:22,129 INFO L87 Difference]: Start difference. First operand 375 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:55:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:22,246 INFO L93 Difference]: Finished difference Result 542 states and 1606 transitions. [2020-02-10 19:55:22,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:22,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:22,247 INFO L225 Difference]: With dead ends: 542 [2020-02-10 19:55:22,248 INFO L226 Difference]: Without dead ends: 526 [2020-02-10 19:55:22,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 19:55:22,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-02-10 19:55:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 372. [2020-02-10 19:55:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-02-10 19:55:22,257 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-02-10 19:55:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:22,257 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-02-10 19:55:22,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-02-10 19:55:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:22,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:22,258 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:22,258 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 19:55:22,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:22,258 INFO L82 PathProgramCache]: Analyzing trace with hash 13975730, now seen corresponding path program 1673 times [2020-02-10 19:55:22,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:22,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634370228] [2020-02-10 19:55:22,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:22,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 19:55:22,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634370228] [2020-02-10 19:55:22,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:22,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:22,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826711673] [2020-02-10 19:55:22,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:22,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:22,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:22,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:22,538 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-02-10 19:55:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:22,653 INFO L93 Difference]: Finished difference Result 547 states and 1606 transitions. [2020-02-10 19:55:22,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:22,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:22,655 INFO L225 Difference]: With dead ends: 547 [2020-02-10 19:55:22,655 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:55:22,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 19:55:22,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:55:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 374. [2020-02-10 19:55:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1266 transitions. [2020-02-10 19:55:22,664 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1266 transitions. Word has length 22 [2020-02-10 19:55:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:22,664 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1266 transitions. [2020-02-10 19:55:22,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1266 transitions. [2020-02-10 19:55:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:22,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:22,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 19:55:22,665 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 19:55:22,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:22,665 INFO L82 PathProgramCache]: Analyzing trace with hash 585430536, now seen corresponding path program 1674 times [2020-02-10 19:55:22,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:22,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965425473] [2020-02-10 19:55:22,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:22,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 19:55:22,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965425473] [2020-02-10 19:55:22,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:22,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:22,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362669069] [2020-02-10 19:55:22,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:22,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:22,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:22,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:22,945 INFO L87 Difference]: Start difference. First operand 374 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:55:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:23,060 INFO L93 Difference]: Finished difference Result 541 states and 1602 transitions. [2020-02-10 19:55:23,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:23,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:23,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:23,062 INFO L225 Difference]: With dead ends: 541 [2020-02-10 19:55:23,063 INFO L226 Difference]: Without dead ends: 524 [2020-02-10 19:55:23,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 19:55:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-02-10 19:55:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 370. [2020-02-10 19:55:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 19:55:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1259 transitions. [2020-02-10 19:55:23,072 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1259 transitions. Word has length 22 [2020-02-10 19:55:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:23,072 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1259 transitions. [2020-02-10 19:55:23,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1259 transitions. [2020-02-10 19:55:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:23,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:23,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 19:55:23,073 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 19:55:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash -839134160, now seen corresponding path program 1675 times [2020-02-10 19:55:23,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:23,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557999325] [2020-02-10 19:55:23,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:23,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 19:55:23,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557999325] [2020-02-10 19:55:23,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:23,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:23,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158345457] [2020-02-10 19:55:23,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:23,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:23,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:23,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:23,386 INFO L87 Difference]: Start difference. First operand 370 states and 1259 transitions. Second operand 9 states. [2020-02-10 19:55:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:23,501 INFO L93 Difference]: Finished difference Result 538 states and 1585 transitions. [2020-02-10 19:55:23,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:23,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:23,503 INFO L225 Difference]: With dead ends: 538 [2020-02-10 19:55:23,503 INFO L226 Difference]: Without dead ends: 529 [2020-02-10 19:55:23,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 19:55:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-02-10 19:55:23,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 372. [2020-02-10 19:55:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-02-10 19:55:23,512 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-02-10 19:55:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:23,512 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-02-10 19:55:23,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-02-10 19:55:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:23,513 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:23,513 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:23,513 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 19:55:23,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:23,513 INFO L82 PathProgramCache]: Analyzing trace with hash 771806798, now seen corresponding path program 1676 times [2020-02-10 19:55:23,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:23,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506870067] [2020-02-10 19:55:23,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:23,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 19:55:23,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506870067] [2020-02-10 19:55:23,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:23,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:23,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130593949] [2020-02-10 19:55:23,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:23,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:23,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:23,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:23,808 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-02-10 19:55:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:23,924 INFO L93 Difference]: Finished difference Result 539 states and 1586 transitions. [2020-02-10 19:55:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:23,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:23,926 INFO L225 Difference]: With dead ends: 539 [2020-02-10 19:55:23,926 INFO L226 Difference]: Without dead ends: 528 [2020-02-10 19:55:23,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 19:55:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-02-10 19:55:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 371. [2020-02-10 19:55:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1261 transitions. [2020-02-10 19:55:23,935 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1261 transitions. Word has length 22 [2020-02-10 19:55:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:23,935 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1261 transitions. [2020-02-10 19:55:23,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1261 transitions. [2020-02-10 19:55:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:23,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:23,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 19:55:23,936 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 19:55:23,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:23,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1426879482, now seen corresponding path program 1677 times [2020-02-10 19:55:23,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:23,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803738598] [2020-02-10 19:55:23,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:24,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 19:55:24,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803738598] [2020-02-10 19:55:24,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:24,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:24,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204883975] [2020-02-10 19:55:24,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:24,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:24,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:24,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:24,227 INFO L87 Difference]: Start difference. First operand 371 states and 1261 transitions. Second operand 9 states. [2020-02-10 19:55:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:24,315 INFO L93 Difference]: Finished difference Result 540 states and 1589 transitions. [2020-02-10 19:55:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:24,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:24,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:24,317 INFO L225 Difference]: With dead ends: 540 [2020-02-10 19:55:24,317 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:55:24,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 19:55:24,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:55:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 372. [2020-02-10 19:55:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1262 transitions. [2020-02-10 19:55:24,328 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1262 transitions. Word has length 22 [2020-02-10 19:55:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:24,328 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1262 transitions. [2020-02-10 19:55:24,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1262 transitions. [2020-02-10 19:55:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:24,328 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:24,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 19:55:24,328 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 19:55:24,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:24,329 INFO L82 PathProgramCache]: Analyzing trace with hash 719291278, now seen corresponding path program 1678 times [2020-02-10 19:55:24,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:24,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865935882] [2020-02-10 19:55:24,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:24,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 19:55:24,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865935882] [2020-02-10 19:55:24,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:24,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:24,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571104412] [2020-02-10 19:55:24,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:24,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:24,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:24,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:24,614 INFO L87 Difference]: Start difference. First operand 372 states and 1262 transitions. Second operand 9 states. [2020-02-10 19:55:24,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:24,724 INFO L93 Difference]: Finished difference Result 535 states and 1588 transitions. [2020-02-10 19:55:24,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:24,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:24,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:24,726 INFO L225 Difference]: With dead ends: 535 [2020-02-10 19:55:24,726 INFO L226 Difference]: Without dead ends: 521 [2020-02-10 19:55:24,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 19:55:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-02-10 19:55:24,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 371. [2020-02-10 19:55:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1260 transitions. [2020-02-10 19:55:24,735 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1260 transitions. Word has length 22 [2020-02-10 19:55:24,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:24,736 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1260 transitions. [2020-02-10 19:55:24,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1260 transitions. [2020-02-10 19:55:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:24,736 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:24,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 19:55:24,736 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 19:55:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1416376378, now seen corresponding path program 1679 times [2020-02-10 19:55:24,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:24,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125407212] [2020-02-10 19:55:24,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:25,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 19:55:25,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125407212] [2020-02-10 19:55:25,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:25,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:25,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895989445] [2020-02-10 19:55:25,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:25,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:25,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:25,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:25,028 INFO L87 Difference]: Start difference. First operand 371 states and 1260 transitions. Second operand 9 states. [2020-02-10 19:55:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:25,167 INFO L93 Difference]: Finished difference Result 542 states and 1593 transitions. [2020-02-10 19:55:25,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:25,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:25,169 INFO L225 Difference]: With dead ends: 542 [2020-02-10 19:55:25,169 INFO L226 Difference]: Without dead ends: 532 [2020-02-10 19:55:25,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 19:55:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-02-10 19:55:25,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 373. [2020-02-10 19:55:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1263 transitions. [2020-02-10 19:55:25,179 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1263 transitions. Word has length 22 [2020-02-10 19:55:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:25,179 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1263 transitions. [2020-02-10 19:55:25,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1263 transitions. [2020-02-10 19:55:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:25,180 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:25,180 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:25,180 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 19:55:25,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:25,180 INFO L82 PathProgramCache]: Analyzing trace with hash -881146576, now seen corresponding path program 1680 times [2020-02-10 19:55:25,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:25,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385103184] [2020-02-10 19:55:25,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:25,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 19:55:25,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385103184] [2020-02-10 19:55:25,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:25,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:25,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524824794] [2020-02-10 19:55:25,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:25,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:25,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:25,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:25,465 INFO L87 Difference]: Start difference. First operand 373 states and 1263 transitions. Second operand 9 states. [2020-02-10 19:55:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:25,584 INFO L93 Difference]: Finished difference Result 536 states and 1589 transitions. [2020-02-10 19:55:25,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:25,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:25,585 INFO L225 Difference]: With dead ends: 536 [2020-02-10 19:55:25,586 INFO L226 Difference]: Without dead ends: 517 [2020-02-10 19:55:25,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 19:55:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-02-10 19:55:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 367. [2020-02-10 19:55:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2020-02-10 19:55:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1254 transitions. [2020-02-10 19:55:25,595 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1254 transitions. Word has length 22 [2020-02-10 19:55:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:25,595 INFO L479 AbstractCegarLoop]: Abstraction has 367 states and 1254 transitions. [2020-02-10 19:55:25,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1254 transitions. [2020-02-10 19:55:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:25,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:25,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 19:55:25,596 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 19:55:25,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1625815878, now seen corresponding path program 1681 times [2020-02-10 19:55:25,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:25,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486319471] [2020-02-10 19:55:25,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:25,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 19:55:25,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486319471] [2020-02-10 19:55:25,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:25,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:25,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739200533] [2020-02-10 19:55:25,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:25,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:25,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:25,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:25,884 INFO L87 Difference]: Start difference. First operand 367 states and 1254 transitions. Second operand 9 states. [2020-02-10 19:55:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:25,972 INFO L93 Difference]: Finished difference Result 592 states and 1727 transitions. [2020-02-10 19:55:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:25,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:25,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:25,974 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:55:25,974 INFO L226 Difference]: Without dead ends: 576 [2020-02-10 19:55:25,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:25,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-02-10 19:55:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 377. [2020-02-10 19:55:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:55:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-02-10 19:55:25,984 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-02-10 19:55:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:25,984 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-02-10 19:55:25,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-02-10 19:55:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:25,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:25,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 19:55:25,985 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 19:55:25,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:25,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1078885532, now seen corresponding path program 1682 times [2020-02-10 19:55:25,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:25,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467703539] [2020-02-10 19:55:25,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:26,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467703539] [2020-02-10 19:55:26,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:26,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:26,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895832476] [2020-02-10 19:55:26,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:26,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:26,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:26,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:26,277 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-02-10 19:55:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:26,415 INFO L93 Difference]: Finished difference Result 587 states and 1714 transitions. [2020-02-10 19:55:26,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:26,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:26,417 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:55:26,417 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:55:26,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 19:55:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:55:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 373. [2020-02-10 19:55:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1276 transitions. [2020-02-10 19:55:26,426 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1276 transitions. Word has length 22 [2020-02-10 19:55:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:26,426 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1276 transitions. [2020-02-10 19:55:26,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1276 transitions. [2020-02-10 19:55:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:26,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:26,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 19:55:26,427 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 19:55:26,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:26,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1316601098, now seen corresponding path program 1683 times [2020-02-10 19:55:26,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:26,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325061859] [2020-02-10 19:55:26,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:26,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 19:55:26,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325061859] [2020-02-10 19:55:26,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:26,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:26,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954424298] [2020-02-10 19:55:26,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:26,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:26,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:26,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:26,719 INFO L87 Difference]: Start difference. First operand 373 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:55:26,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:26,831 INFO L93 Difference]: Finished difference Result 588 states and 1715 transitions. [2020-02-10 19:55:26,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:26,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:26,833 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:55:26,833 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:55:26,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:55:26,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 375. [2020-02-10 19:55:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1278 transitions. [2020-02-10 19:55:26,842 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1278 transitions. Word has length 22 [2020-02-10 19:55:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:26,842 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1278 transitions. [2020-02-10 19:55:26,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1278 transitions. [2020-02-10 19:55:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:26,842 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:26,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 19:55:26,843 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 19:55:26,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:26,843 INFO L82 PathProgramCache]: Analyzing trace with hash -755532606, now seen corresponding path program 1684 times [2020-02-10 19:55:26,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:26,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839787496] [2020-02-10 19:55:26,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:27,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839787496] [2020-02-10 19:55:27,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:27,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:27,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308094717] [2020-02-10 19:55:27,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:27,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:27,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:27,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:27,136 INFO L87 Difference]: Start difference. First operand 375 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:55:27,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:27,227 INFO L93 Difference]: Finished difference Result 581 states and 1700 transitions. [2020-02-10 19:55:27,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:27,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:27,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:27,228 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:55:27,229 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:55:27,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:27,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:55:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 373. [2020-02-10 19:55:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-02-10 19:55:27,238 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-02-10 19:55:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:27,238 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-02-10 19:55:27,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-02-10 19:55:27,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:27,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:27,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 19:55:27,239 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 19:55:27,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:27,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1784075992, now seen corresponding path program 1685 times [2020-02-10 19:55:27,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:27,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315631898] [2020-02-10 19:55:27,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:27,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 19:55:27,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315631898] [2020-02-10 19:55:27,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:27,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:27,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330214189] [2020-02-10 19:55:27,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:27,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:27,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:27,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:27,527 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-02-10 19:55:27,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:27,662 INFO L93 Difference]: Finished difference Result 577 states and 1693 transitions. [2020-02-10 19:55:27,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:27,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:27,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:27,664 INFO L225 Difference]: With dead ends: 577 [2020-02-10 19:55:27,664 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:55:27,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 19:55:27,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:55:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 374. [2020-02-10 19:55:27,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1275 transitions. [2020-02-10 19:55:27,674 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1275 transitions. Word has length 22 [2020-02-10 19:55:27,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:27,674 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1275 transitions. [2020-02-10 19:55:27,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1275 transitions. [2020-02-10 19:55:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:27,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:27,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:27,675 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 19:55:27,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:27,675 INFO L82 PathProgramCache]: Analyzing trace with hash 338558982, now seen corresponding path program 1686 times [2020-02-10 19:55:27,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:27,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490348152] [2020-02-10 19:55:27,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:27,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 19:55:27,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490348152] [2020-02-10 19:55:27,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:27,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:27,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417621867] [2020-02-10 19:55:27,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:27,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:27,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:27,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:27,962 INFO L87 Difference]: Start difference. First operand 374 states and 1275 transitions. Second operand 9 states. [2020-02-10 19:55:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:28,053 INFO L93 Difference]: Finished difference Result 575 states and 1688 transitions. [2020-02-10 19:55:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:28,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:28,055 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:55:28,055 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:55:28,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 19:55:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:55:28,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 371. [2020-02-10 19:55:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1270 transitions. [2020-02-10 19:55:28,065 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1270 transitions. Word has length 22 [2020-02-10 19:55:28,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:28,065 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1270 transitions. [2020-02-10 19:55:28,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1270 transitions. [2020-02-10 19:55:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:28,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:28,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 19:55:28,066 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 19:55:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:28,066 INFO L82 PathProgramCache]: Analyzing trace with hash -556722788, now seen corresponding path program 1687 times [2020-02-10 19:55:28,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:28,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905195068] [2020-02-10 19:55:28,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:28,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 19:55:28,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905195068] [2020-02-10 19:55:28,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:28,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:28,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469116594] [2020-02-10 19:55:28,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:28,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:28,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:28,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:28,363 INFO L87 Difference]: Start difference. First operand 371 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:55:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:28,451 INFO L93 Difference]: Finished difference Result 602 states and 1754 transitions. [2020-02-10 19:55:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:28,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:28,453 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:55:28,453 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:55:28,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:28,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:55:28,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 379. [2020-02-10 19:55:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:55:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1290 transitions. [2020-02-10 19:55:28,463 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1290 transitions. Word has length 22 [2020-02-10 19:55:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:28,463 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1290 transitions. [2020-02-10 19:55:28,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1290 transitions. [2020-02-10 19:55:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:28,463 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:28,464 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:28,464 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 19:55:28,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:28,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1033543098, now seen corresponding path program 1688 times [2020-02-10 19:55:28,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:28,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748800746] [2020-02-10 19:55:28,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:28,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:28,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748800746] [2020-02-10 19:55:28,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:28,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:28,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616537927] [2020-02-10 19:55:28,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:28,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:28,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:28,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:28,755 INFO L87 Difference]: Start difference. First operand 379 states and 1290 transitions. Second operand 9 states. [2020-02-10 19:55:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:28,868 INFO L93 Difference]: Finished difference Result 597 states and 1741 transitions. [2020-02-10 19:55:28,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:28,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:28,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:28,870 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:55:28,870 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:55:28,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 19:55:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:55:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 375. [2020-02-10 19:55:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1280 transitions. [2020-02-10 19:55:28,879 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1280 transitions. Word has length 22 [2020-02-10 19:55:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:28,879 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1280 transitions. [2020-02-10 19:55:28,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1280 transitions. [2020-02-10 19:55:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:28,880 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:28,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 19:55:28,880 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 19:55:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:28,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1905399540, now seen corresponding path program 1689 times [2020-02-10 19:55:28,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:28,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795883908] [2020-02-10 19:55:28,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:29,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 19:55:29,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795883908] [2020-02-10 19:55:29,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:29,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:29,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859631486] [2020-02-10 19:55:29,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:29,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:29,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:29,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:29,177 INFO L87 Difference]: Start difference. First operand 375 states and 1280 transitions. Second operand 9 states. [2020-02-10 19:55:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:29,292 INFO L93 Difference]: Finished difference Result 604 states and 1755 transitions. [2020-02-10 19:55:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:29,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:29,294 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:55:29,294 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:55:29,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 19:55:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:55:29,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 380. [2020-02-10 19:55:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:55:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1288 transitions. [2020-02-10 19:55:29,304 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1288 transitions. Word has length 22 [2020-02-10 19:55:29,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:29,304 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1288 transitions. [2020-02-10 19:55:29,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1288 transitions. [2020-02-10 19:55:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:29,305 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:29,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 19:55:29,305 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 19:55:29,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:29,305 INFO L82 PathProgramCache]: Analyzing trace with hash 688239854, now seen corresponding path program 1690 times [2020-02-10 19:55:29,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:29,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689937277] [2020-02-10 19:55:29,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:29,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 19:55:29,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689937277] [2020-02-10 19:55:29,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:29,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:29,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413158808] [2020-02-10 19:55:29,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:29,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:29,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:29,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:29,597 INFO L87 Difference]: Start difference. First operand 380 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:55:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:29,736 INFO L93 Difference]: Finished difference Result 600 states and 1743 transitions. [2020-02-10 19:55:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:29,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:29,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:29,738 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:55:29,738 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:55:29,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:55:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 375. [2020-02-10 19:55:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 19:55:29,748 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 19:55:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:29,748 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 19:55:29,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 19:55:29,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:29,748 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:29,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:29,749 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 19:55:29,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:29,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1174271342, now seen corresponding path program 1691 times [2020-02-10 19:55:29,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:29,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420049820] [2020-02-10 19:55:29,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:30,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 19:55:30,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420049820] [2020-02-10 19:55:30,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:30,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:30,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898048658] [2020-02-10 19:55:30,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:30,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:30,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:30,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:30,042 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:55:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:30,179 INFO L93 Difference]: Finished difference Result 592 states and 1728 transitions. [2020-02-10 19:55:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:30,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:30,181 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:55:30,181 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 19:55:30,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 19:55:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 19:55:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 378. [2020-02-10 19:55:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:55:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1281 transitions. [2020-02-10 19:55:30,191 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1281 transitions. Word has length 22 [2020-02-10 19:55:30,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:30,191 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1281 transitions. [2020-02-10 19:55:30,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1281 transitions. [2020-02-10 19:55:30,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:30,192 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:30,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 19:55:30,192 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 19:55:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:30,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2048012022, now seen corresponding path program 1692 times [2020-02-10 19:55:30,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:30,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377600302] [2020-02-10 19:55:30,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:30,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 19:55:30,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377600302] [2020-02-10 19:55:30,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:30,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:30,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026262692] [2020-02-10 19:55:30,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:30,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:30,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:30,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:30,485 INFO L87 Difference]: Start difference. First operand 378 states and 1281 transitions. Second operand 9 states. [2020-02-10 19:55:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:30,591 INFO L93 Difference]: Finished difference Result 593 states and 1727 transitions. [2020-02-10 19:55:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:30,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:30,593 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:55:30,593 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:55:30,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:30,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:55:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 371. [2020-02-10 19:55:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1268 transitions. [2020-02-10 19:55:30,602 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1268 transitions. Word has length 22 [2020-02-10 19:55:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:30,602 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1268 transitions. [2020-02-10 19:55:30,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1268 transitions. [2020-02-10 19:55:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:30,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:30,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:30,603 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 19:55:30,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:30,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1766544522, now seen corresponding path program 1693 times [2020-02-10 19:55:30,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:30,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022061149] [2020-02-10 19:55:30,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:30,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 19:55:30,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022061149] [2020-02-10 19:55:30,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:30,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:30,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552444205] [2020-02-10 19:55:30,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:30,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:30,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:30,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:30,887 INFO L87 Difference]: Start difference. First operand 371 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:55:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:30,987 INFO L93 Difference]: Finished difference Result 590 states and 1718 transitions. [2020-02-10 19:55:30,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:30,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:30,988 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:55:30,989 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:55:30,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:30,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:55:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 375. [2020-02-10 19:55:30,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 19:55:30,998 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 19:55:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:30,999 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 19:55:30,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 19:55:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:30,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:30,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 19:55:30,999 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 19:55:30,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:31,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1205476030, now seen corresponding path program 1694 times [2020-02-10 19:55:31,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:31,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868759297] [2020-02-10 19:55:31,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:31,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868759297] [2020-02-10 19:55:31,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:31,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:31,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418127849] [2020-02-10 19:55:31,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:31,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:31,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:31,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:31,283 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:55:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:31,361 INFO L93 Difference]: Finished difference Result 583 states and 1703 transitions. [2020-02-10 19:55:31,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:31,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:31,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:31,363 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:55:31,363 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:55:31,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:55:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 373. [2020-02-10 19:55:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 19:55:31,373 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 19:55:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:31,373 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 19:55:31,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 19:55:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:31,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:31,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 19:55:31,374 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 19:55:31,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:31,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1940677452, now seen corresponding path program 1695 times [2020-02-10 19:55:31,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:31,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293368995] [2020-02-10 19:55:31,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:31,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 19:55:31,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293368995] [2020-02-10 19:55:31,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:31,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:31,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875723369] [2020-02-10 19:55:31,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:31,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:31,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:31,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:31,674 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 19:55:31,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:31,753 INFO L93 Difference]: Finished difference Result 596 states and 1731 transitions. [2020-02-10 19:55:31,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:31,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:31,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:31,755 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:55:31,755 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:55:31,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 19:55:31,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:55:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 378. [2020-02-10 19:55:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:55:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1280 transitions. [2020-02-10 19:55:31,764 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1280 transitions. Word has length 22 [2020-02-10 19:55:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:31,764 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1280 transitions. [2020-02-10 19:55:31,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1280 transitions. [2020-02-10 19:55:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:31,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:31,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 19:55:31,765 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 19:55:31,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:31,765 INFO L82 PathProgramCache]: Analyzing trace with hash -332373186, now seen corresponding path program 1696 times [2020-02-10 19:55:31,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:31,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125363812] [2020-02-10 19:55:31,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:32,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 19:55:32,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125363812] [2020-02-10 19:55:32,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:32,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:32,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714186881] [2020-02-10 19:55:32,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:32,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:32,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:32,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:32,086 INFO L87 Difference]: Start difference. First operand 378 states and 1280 transitions. Second operand 9 states. [2020-02-10 19:55:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:32,189 INFO L93 Difference]: Finished difference Result 592 states and 1719 transitions. [2020-02-10 19:55:32,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:32,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:32,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:32,191 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:55:32,191 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:55:32,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 19:55:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:55:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 373. [2020-02-10 19:55:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 19:55:32,201 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 19:55:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:32,201 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 19:55:32,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 19:55:32,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:32,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55: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 19:55:32,202 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 19:55:32,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:32,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1995399678, now seen corresponding path program 1697 times [2020-02-10 19:55:32,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:32,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351969057] [2020-02-10 19:55:32,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:32,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351969057] [2020-02-10 19:55:32,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:32,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:32,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333593498] [2020-02-10 19:55:32,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:32,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:32,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:32,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:32,491 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:55:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:32,573 INFO L93 Difference]: Finished difference Result 578 states and 1692 transitions. [2020-02-10 19:55:32,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:32,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:32,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:32,575 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:55:32,576 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 19:55:32,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 19:55:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 19:55:32,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 374. [2020-02-10 19:55:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-02-10 19:55:32,585 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-02-10 19:55:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:32,585 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-02-10 19:55:32,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-02-10 19:55:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:32,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:32,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 19:55:32,586 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 19:55:32,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:32,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1764337816, now seen corresponding path program 1698 times [2020-02-10 19:55:32,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:32,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554125632] [2020-02-10 19:55:32,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:32,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 19:55:32,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554125632] [2020-02-10 19:55:32,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:32,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:32,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147005703] [2020-02-10 19:55:32,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:32,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:32,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:32,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:32,866 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-02-10 19:55:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:32,975 INFO L93 Difference]: Finished difference Result 581 states and 1697 transitions. [2020-02-10 19:55:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:32,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:32,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:32,977 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:55:32,977 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:55:32,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 19:55:32,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:55:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 371. [2020-02-10 19:55:32,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1266 transitions. [2020-02-10 19:55:32,987 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1266 transitions. Word has length 22 [2020-02-10 19:55:32,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:32,987 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1266 transitions. [2020-02-10 19:55:32,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1266 transitions. [2020-02-10 19:55:32,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:32,988 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:32,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 19:55:32,988 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 19:55:32,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:32,988 INFO L82 PathProgramCache]: Analyzing trace with hash 891233428, now seen corresponding path program 1699 times [2020-02-10 19:55:32,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:32,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804708436] [2020-02-10 19:55:32,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:33,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804708436] [2020-02-10 19:55:33,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:33,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:33,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715300391] [2020-02-10 19:55:33,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:33,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:33,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:33,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:33,284 INFO L87 Difference]: Start difference. First operand 371 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:55:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:33,395 INFO L93 Difference]: Finished difference Result 570 states and 1677 transitions. [2020-02-10 19:55:33,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:33,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:33,397 INFO L225 Difference]: With dead ends: 570 [2020-02-10 19:55:33,397 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:55:33,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 19:55:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:55:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 373. [2020-02-10 19:55:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 19:55:33,407 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 19:55:33,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:33,407 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 19:55:33,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 19:55:33,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:33,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:33,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 19:55:33,408 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 19:55:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:33,408 INFO L82 PathProgramCache]: Analyzing trace with hash -554283582, now seen corresponding path program 1700 times [2020-02-10 19:55:33,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:33,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105839702] [2020-02-10 19:55:33,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:33,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 19:55:33,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105839702] [2020-02-10 19:55:33,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:33,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:33,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145386517] [2020-02-10 19:55:33,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:33,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:33,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:33,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:33,703 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:55:33,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:33,791 INFO L93 Difference]: Finished difference Result 568 states and 1672 transitions. [2020-02-10 19:55:33,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:33,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:33,793 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:55:33,794 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:55:33,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 19:55:33,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:55:33,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 372. [2020-02-10 19:55:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1268 transitions. [2020-02-10 19:55:33,804 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1268 transitions. Word has length 22 [2020-02-10 19:55:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:33,804 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1268 transitions. [2020-02-10 19:55:33,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1268 transitions. [2020-02-10 19:55:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:33,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:33,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 19:55:33,805 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 19:55:33,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:33,805 INFO L82 PathProgramCache]: Analyzing trace with hash 303488106, now seen corresponding path program 1701 times [2020-02-10 19:55:33,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:33,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306657364] [2020-02-10 19:55:33,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:34,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 19:55:34,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306657364] [2020-02-10 19:55:34,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:34,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:34,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324695161] [2020-02-10 19:55:34,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:34,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:34,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:34,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:34,098 INFO L87 Difference]: Start difference. First operand 372 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:55:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:34,201 INFO L93 Difference]: Finished difference Result 575 states and 1688 transitions. [2020-02-10 19:55:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:34,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:34,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:34,203 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:55:34,203 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:55:34,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:34,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:55:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 375. [2020-02-10 19:55:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1273 transitions. [2020-02-10 19:55:34,214 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1273 transitions. Word has length 22 [2020-02-10 19:55:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:34,214 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1273 transitions. [2020-02-10 19:55:34,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1273 transitions. [2020-02-10 19:55:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:34,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:34,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 19:55:34,215 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 19:55:34,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:34,215 INFO L82 PathProgramCache]: Analyzing trace with hash 605506050, now seen corresponding path program 1702 times [2020-02-10 19:55:34,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:34,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194465906] [2020-02-10 19:55:34,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:34,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 19:55:34,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194465906] [2020-02-10 19:55:34,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:34,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:34,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372292413] [2020-02-10 19:55:34,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:34,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:34,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:34,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:34,503 INFO L87 Difference]: Start difference. First operand 375 states and 1273 transitions. Second operand 9 states. [2020-02-10 19:55:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:34,626 INFO L93 Difference]: Finished difference Result 576 states and 1687 transitions. [2020-02-10 19:55:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:34,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:34,627 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:55:34,628 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:55:34,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 19:55:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:55:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 372. [2020-02-10 19:55:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1267 transitions. [2020-02-10 19:55:34,638 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1267 transitions. Word has length 22 [2020-02-10 19:55:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:34,638 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1267 transitions. [2020-02-10 19:55:34,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1267 transitions. [2020-02-10 19:55:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:34,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:34,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 19:55:34,639 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 19:55:34,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:34,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1552500538, now seen corresponding path program 1703 times [2020-02-10 19:55:34,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:34,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177030154] [2020-02-10 19:55:34,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:34,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 19:55:34,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177030154] [2020-02-10 19:55:34,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:34,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:34,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673979094] [2020-02-10 19:55:34,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:34,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:34,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:34,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:34,930 INFO L87 Difference]: Start difference. First operand 372 states and 1267 transitions. Second operand 9 states. [2020-02-10 19:55:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:35,009 INFO L93 Difference]: Finished difference Result 569 states and 1673 transitions. [2020-02-10 19:55:35,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:35,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:35,010 INFO L225 Difference]: With dead ends: 569 [2020-02-10 19:55:35,011 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:55:35,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 19:55:35,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:55:35,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 373. [2020-02-10 19:55:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 19:55:35,019 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 19:55:35,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:35,019 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 19:55:35,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 19:55:35,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:35,020 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:35,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 19:55:35,020 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 19:55:35,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:35,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2087730340, now seen corresponding path program 1704 times [2020-02-10 19:55:35,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:35,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519025934] [2020-02-10 19:55:35,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55: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 19:55:35,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519025934] [2020-02-10 19:55:35,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:35,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:35,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990726847] [2020-02-10 19:55:35,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:35,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:35,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:35,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:35,307 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:55:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:35,423 INFO L93 Difference]: Finished difference Result 572 states and 1678 transitions. [2020-02-10 19:55:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:35,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:35,425 INFO L225 Difference]: With dead ends: 572 [2020-02-10 19:55:35,425 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:55:35,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 19:55:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:55:35,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 369. [2020-02-10 19:55:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 19:55:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1262 transitions. [2020-02-10 19:55:35,434 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1262 transitions. Word has length 22 [2020-02-10 19:55:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:35,434 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1262 transitions. [2020-02-10 19:55:35,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:35,435 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1262 transitions. [2020-02-10 19:55:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:35,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:35,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 19:55:35,435 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 19:55:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:35,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1413660260, now seen corresponding path program 1705 times [2020-02-10 19:55:35,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:35,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415039890] [2020-02-10 19:55:35,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:35,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 19:55:35,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415039890] [2020-02-10 19:55:35,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:35,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:35,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913052992] [2020-02-10 19:55:35,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:35,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:35,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:35,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:35,702 INFO L87 Difference]: Start difference. First operand 369 states and 1262 transitions. Second operand 9 states. [2020-02-10 19:55:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:35,784 INFO L93 Difference]: Finished difference Result 590 states and 1716 transitions. [2020-02-10 19:55:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:35,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:35,785 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:55:35,786 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:55:35,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:55:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 377. [2020-02-10 19:55:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:55:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1282 transitions. [2020-02-10 19:55:35,795 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1282 transitions. Word has length 22 [2020-02-10 19:55:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:35,795 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1282 transitions. [2020-02-10 19:55:35,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1282 transitions. [2020-02-10 19:55:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:35,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:35,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 19:55:35,796 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 19:55:35,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:35,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1291041150, now seen corresponding path program 1706 times [2020-02-10 19:55:35,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:35,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487484610] [2020-02-10 19:55:35,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:36,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 19:55:36,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487484610] [2020-02-10 19:55:36,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:36,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:36,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160306689] [2020-02-10 19:55:36,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:36,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:36,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:36,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:36,061 INFO L87 Difference]: Start difference. First operand 377 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:55:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:36,175 INFO L93 Difference]: Finished difference Result 585 states and 1703 transitions. [2020-02-10 19:55:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:36,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:36,177 INFO L225 Difference]: With dead ends: 585 [2020-02-10 19:55:36,177 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:55:36,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:55:36,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 373. [2020-02-10 19:55:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-02-10 19:55:36,187 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-02-10 19:55:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:36,187 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-02-10 19:55:36,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-02-10 19:55:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:36,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:36,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:36,188 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 19:55:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:36,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1528756716, now seen corresponding path program 1707 times [2020-02-10 19:55:36,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:36,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200863609] [2020-02-10 19:55:36,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:36,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 19:55:36,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200863609] [2020-02-10 19:55:36,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:36,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:36,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485166817] [2020-02-10 19:55:36,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:36,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:36,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:36,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:36,452 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-02-10 19:55:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:36,532 INFO L93 Difference]: Finished difference Result 586 states and 1704 transitions. [2020-02-10 19:55:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:36,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:36,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:36,534 INFO L225 Difference]: With dead ends: 586 [2020-02-10 19:55:36,534 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:55:36,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 19:55:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:55:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 375. [2020-02-10 19:55:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-02-10 19:55:36,543 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-02-10 19:55:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:36,543 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-02-10 19:55:36,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:36,543 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-02-10 19:55:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:36,544 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:36,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 19:55:36,544 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 19:55:36,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:36,544 INFO L82 PathProgramCache]: Analyzing trace with hash -967688224, now seen corresponding path program 1708 times [2020-02-10 19:55:36,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:36,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136337024] [2020-02-10 19:55:36,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:36,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 19:55:36,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136337024] [2020-02-10 19:55:36,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:36,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:36,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467647965] [2020-02-10 19:55:36,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:36,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:36,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:36,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:36,803 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:55:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:36,885 INFO L93 Difference]: Finished difference Result 579 states and 1689 transitions. [2020-02-10 19:55:36,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:36,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:36,887 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:55:36,887 INFO L226 Difference]: Without dead ends: 568 [2020-02-10 19:55:36,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:36,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-02-10 19:55:36,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 373. [2020-02-10 19:55:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 19:55:36,897 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 19:55:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:36,898 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 19:55:36,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 19:55:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:36,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:36,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 19:55:36,898 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 19:55:36,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:36,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1571920374, now seen corresponding path program 1709 times [2020-02-10 19:55:36,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:36,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544290224] [2020-02-10 19:55:36,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:37,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 19:55:37,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544290224] [2020-02-10 19:55:37,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:37,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:37,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929284220] [2020-02-10 19:55:37,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:37,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:37,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:37,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:37,173 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 19:55:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:37,281 INFO L93 Difference]: Finished difference Result 575 states and 1682 transitions. [2020-02-10 19:55:37,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:37,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:37,283 INFO L225 Difference]: With dead ends: 575 [2020-02-10 19:55:37,283 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:55:37,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 19:55:37,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:55:37,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 374. [2020-02-10 19:55:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1273 transitions. [2020-02-10 19:55:37,293 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1273 transitions. Word has length 22 [2020-02-10 19:55:37,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:37,293 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1273 transitions. [2020-02-10 19:55:37,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1273 transitions. [2020-02-10 19:55:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:37,294 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:37,294 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:37,294 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 19:55:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:37,294 INFO L82 PathProgramCache]: Analyzing trace with hash 126403364, now seen corresponding path program 1710 times [2020-02-10 19:55:37,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:37,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308725059] [2020-02-10 19:55:37,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:37,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 19:55:37,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308725059] [2020-02-10 19:55:37,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:37,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:37,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740216103] [2020-02-10 19:55:37,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:37,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:37,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:37,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:37,568 INFO L87 Difference]: Start difference. First operand 374 states and 1273 transitions. Second operand 9 states. [2020-02-10 19:55:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:37,667 INFO L93 Difference]: Finished difference Result 573 states and 1677 transitions. [2020-02-10 19:55:37,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:37,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:37,669 INFO L225 Difference]: With dead ends: 573 [2020-02-10 19:55:37,669 INFO L226 Difference]: Without dead ends: 561 [2020-02-10 19:55:37,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:37,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-02-10 19:55:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 371. [2020-02-10 19:55:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1268 transitions. [2020-02-10 19:55:37,678 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1268 transitions. Word has length 22 [2020-02-10 19:55:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:37,678 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1268 transitions. [2020-02-10 19:55:37,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1268 transitions. [2020-02-10 19:55:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:37,679 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:37,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:37,679 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 19:55:37,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:37,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1191364132, now seen corresponding path program 1711 times [2020-02-10 19:55:37,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:37,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896094325] [2020-02-10 19:55:37,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55: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 19:55:37,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896094325] [2020-02-10 19:55:37,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:37,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:37,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940881284] [2020-02-10 19:55:37,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:37,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:37,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:37,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:37,948 INFO L87 Difference]: Start difference. First operand 371 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:55:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:38,031 INFO L93 Difference]: Finished difference Result 598 states and 1738 transitions. [2020-02-10 19:55:38,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:38,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:38,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:38,032 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:55:38,033 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:55:38,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 19:55:38,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:55:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 379. [2020-02-10 19:55:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:55:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1288 transitions. [2020-02-10 19:55:38,042 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1288 transitions. Word has length 22 [2020-02-10 19:55:38,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:38,042 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1288 transitions. [2020-02-10 19:55:38,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:38,042 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1288 transitions. [2020-02-10 19:55:38,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:38,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55: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 19:55:38,043 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 19:55:38,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:38,043 INFO L82 PathProgramCache]: Analyzing trace with hash 398901754, now seen corresponding path program 1712 times [2020-02-10 19:55:38,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:38,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355945774] [2020-02-10 19:55:38,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:38,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 19:55:38,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355945774] [2020-02-10 19:55:38,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:38,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:38,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986113387] [2020-02-10 19:55:38,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:38,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:38,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:38,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:38,308 INFO L87 Difference]: Start difference. First operand 379 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:55:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:38,412 INFO L93 Difference]: Finished difference Result 593 states and 1725 transitions. [2020-02-10 19:55:38,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:38,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:38,414 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:55:38,414 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:55: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 19:55:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:55:38,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 375. [2020-02-10 19:55:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:38,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1278 transitions. [2020-02-10 19:55:38,423 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1278 transitions. Word has length 22 [2020-02-10 19:55:38,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:38,423 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1278 transitions. [2020-02-10 19:55:38,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1278 transitions. [2020-02-10 19:55:38,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:38,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55: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 19:55:38,424 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 19:55:38,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:38,424 INFO L82 PathProgramCache]: Analyzing trace with hash 141198796, now seen corresponding path program 1713 times [2020-02-10 19:55:38,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:38,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390678276] [2020-02-10 19:55:38,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:38,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 19:55:38,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390678276] [2020-02-10 19:55:38,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:38,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:38,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756150618] [2020-02-10 19:55:38,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:38,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:38,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:38,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:38,718 INFO L87 Difference]: Start difference. First operand 375 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:55:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:38,801 INFO L93 Difference]: Finished difference Result 594 states and 1730 transitions. [2020-02-10 19:55:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:38,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:38,803 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:55:38,803 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:55:38,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 19:55:38,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:55:38,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 381. [2020-02-10 19:55:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:55:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1288 transitions. [2020-02-10 19:55:38,813 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1288 transitions. Word has length 22 [2020-02-10 19:55:38,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:38,813 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1288 transitions. [2020-02-10 19:55:38,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:38,813 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1288 transitions. [2020-02-10 19:55:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:38,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:38,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 19:55:38,814 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 19:55:38,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:38,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1449901232, now seen corresponding path program 1714 times [2020-02-10 19:55:38,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:38,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356827485] [2020-02-10 19:55:38,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:39,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 19:55:39,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356827485] [2020-02-10 19:55:39,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:39,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:39,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164252104] [2020-02-10 19:55:39,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:39,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:39,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:39,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:39,084 INFO L87 Difference]: Start difference. First operand 381 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:55:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:39,188 INFO L93 Difference]: Finished difference Result 582 states and 1711 transitions. [2020-02-10 19:55:39,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:39,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:39,190 INFO L225 Difference]: With dead ends: 582 [2020-02-10 19:55:39,190 INFO L226 Difference]: Without dead ends: 563 [2020-02-10 19:55:39,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 19:55:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-02-10 19:55:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 375. [2020-02-10 19:55:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-02-10 19:55:39,200 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-02-10 19:55:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:39,200 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-02-10 19:55:39,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-02-10 19:55:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:39,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:39,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 19:55:39,201 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 19:55:39,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:39,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1074097618, now seen corresponding path program 1715 times [2020-02-10 19:55:39,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:39,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528660766] [2020-02-10 19:55:39,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:39,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 19:55:39,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528660766] [2020-02-10 19:55:39,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:39,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:39,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628923291] [2020-02-10 19:55:39,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:39,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:39,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:39,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:39,464 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-02-10 19:55:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:39,567 INFO L93 Difference]: Finished difference Result 586 states and 1709 transitions. [2020-02-10 19:55:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:39,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:39,569 INFO L225 Difference]: With dead ends: 586 [2020-02-10 19:55:39,570 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:55:39,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 19:55:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:55:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 378. [2020-02-10 19:55:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:55:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1279 transitions. [2020-02-10 19:55:39,580 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1279 transitions. Word has length 22 [2020-02-10 19:55:39,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:39,580 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1279 transitions. [2020-02-10 19:55:39,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1279 transitions. [2020-02-10 19:55:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:39,580 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:39,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 19:55:39,580 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 19:55:39,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:39,581 INFO L82 PathProgramCache]: Analyzing trace with hash 654949716, now seen corresponding path program 1716 times [2020-02-10 19:55:39,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:39,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090684524] [2020-02-10 19:55:39,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:39,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 19:55:39,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090684524] [2020-02-10 19:55:39,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:39,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:39,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921379492] [2020-02-10 19:55:39,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:39,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:39,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:39,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:39,848 INFO L87 Difference]: Start difference. First operand 378 states and 1279 transitions. Second operand 9 states. [2020-02-10 19:55:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:39,958 INFO L93 Difference]: Finished difference Result 579 states and 1702 transitions. [2020-02-10 19:55:39,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:39,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:39,960 INFO L225 Difference]: With dead ends: 579 [2020-02-10 19:55:39,960 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:55:39,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 19:55:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:55:39,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 371. [2020-02-10 19:55:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1266 transitions. [2020-02-10 19:55:39,970 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1266 transitions. Word has length 22 [2020-02-10 19:55:39,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:39,970 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1266 transitions. [2020-02-10 19:55:39,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1266 transitions. [2020-02-10 19:55:39,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:39,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:39,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 19:55:39,971 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 19:55:39,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:39,971 INFO L82 PathProgramCache]: Analyzing trace with hash -475151788, now seen corresponding path program 1717 times [2020-02-10 19:55:39,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:39,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106171614] [2020-02-10 19:55:39,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:40,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 19:55:40,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106171614] [2020-02-10 19:55:40,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:40,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:40,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964080328] [2020-02-10 19:55:40,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:40,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:40,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:40,231 INFO L87 Difference]: Start difference. First operand 371 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:55:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:40,310 INFO L93 Difference]: Finished difference Result 588 states and 1708 transitions. [2020-02-10 19:55:40,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:40,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:40,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:40,312 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:55:40,312 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:55:40,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 19:55:40,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:55:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 375. [2020-02-10 19:55:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-02-10 19:55:40,322 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-02-10 19:55:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:40,322 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-02-10 19:55:40,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-02-10 19:55:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:40,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55: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 19:55:40,323 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 19:55:40,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:40,323 INFO L82 PathProgramCache]: Analyzing trace with hash 85916704, now seen corresponding path program 1718 times [2020-02-10 19:55:40,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:40,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602291790] [2020-02-10 19:55:40,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:40,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 19:55:40,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602291790] [2020-02-10 19:55:40,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:40,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:40,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029765827] [2020-02-10 19:55:40,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:40,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:40,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:40,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:40,586 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-02-10 19:55:40,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:40,665 INFO L93 Difference]: Finished difference Result 581 states and 1693 transitions. [2020-02-10 19:55:40,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:40,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:40,667 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:55:40,667 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:55:40,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 19:55:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:55:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 373. [2020-02-10 19:55:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 19:55:40,677 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 19:55:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:40,677 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 19:55:40,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 19:55:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:40,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:40,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 19:55:40,678 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 19:55:40,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:40,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1631632332, now seen corresponding path program 1719 times [2020-02-10 19:55:40,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:40,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663930114] [2020-02-10 19:55:40,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:40,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 19:55:40,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663930114] [2020-02-10 19:55:40,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:40,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:40,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680894653] [2020-02-10 19:55:40,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:40,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:40,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:40,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:40,950 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:55:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:41,039 INFO L93 Difference]: Finished difference Result 588 states and 1712 transitions. [2020-02-10 19:55:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:41,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:41,041 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:55:41,041 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:55:41,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 19:55:41,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:55:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 379. [2020-02-10 19:55:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:55:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1280 transitions. [2020-02-10 19:55:41,051 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1280 transitions. Word has length 22 [2020-02-10 19:55:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:41,052 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1280 transitions. [2020-02-10 19:55:41,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1280 transitions. [2020-02-10 19:55:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:41,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:41,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 19:55:41,052 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 19:55:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:41,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1824453024, now seen corresponding path program 1720 times [2020-02-10 19:55:41,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:41,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961697620] [2020-02-10 19:55:41,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:41,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 19:55:41,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961697620] [2020-02-10 19:55:41,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:41,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:41,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982482416] [2020-02-10 19:55:41,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:41,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:41,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:41,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:41,320 INFO L87 Difference]: Start difference. First operand 379 states and 1280 transitions. Second operand 9 states. [2020-02-10 19:55:41,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:41,428 INFO L93 Difference]: Finished difference Result 576 states and 1693 transitions. [2020-02-10 19:55:41,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:41,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:41,430 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:55:41,430 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:55:41,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 19:55:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:55:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 373. [2020-02-10 19:55:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 19:55:41,439 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 19:55:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:41,439 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 19:55:41,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 19:55:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:41,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:41,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 19:55:41,440 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 19:55:41,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:41,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1686354558, now seen corresponding path program 1721 times [2020-02-10 19:55:41,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:41,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437899960] [2020-02-10 19:55:41,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:41,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 19:55:41,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437899960] [2020-02-10 19:55:41,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:41,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:41,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563205612] [2020-02-10 19:55:41,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:41,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:41,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:41,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:41,713 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:55:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:41,793 INFO L93 Difference]: Finished difference Result 576 states and 1683 transitions. [2020-02-10 19:55:41,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:41,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:41,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:41,795 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:55:41,795 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:55:41,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 19:55:41,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:55:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 374. [2020-02-10 19:55:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-02-10 19:55:41,804 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-02-10 19:55:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:41,804 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-02-10 19:55:41,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:41,804 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-02-10 19:55:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:41,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:41,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 19:55:41,805 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 19:55:41,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:41,805 INFO L82 PathProgramCache]: Analyzing trace with hash -462441978, now seen corresponding path program 1722 times [2020-02-10 19:55:41,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:41,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345379696] [2020-02-10 19:55:41,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:42,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345379696] [2020-02-10 19:55:42,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:42,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:42,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183775989] [2020-02-10 19:55:42,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:42,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:42,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:42,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:42,069 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-02-10 19:55:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:42,174 INFO L93 Difference]: Finished difference Result 571 states and 1682 transitions. [2020-02-10 19:55:42,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:42,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:42,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:42,176 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:55:42,176 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 19:55:42,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 19:55:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 371. [2020-02-10 19:55:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-02-10 19:55:42,186 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-02-10 19:55:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:42,187 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-02-10 19:55:42,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-02-10 19:55:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:42,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:42,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:42,187 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 19:55:42,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:42,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2112341134, now seen corresponding path program 1723 times [2020-02-10 19:55:42,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:42,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417625359] [2020-02-10 19:55:42,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:42,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 19:55:42,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417625359] [2020-02-10 19:55:42,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:42,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:42,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132807396] [2020-02-10 19:55:42,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:42,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:42,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:42,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:42,464 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-02-10 19:55:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:42,572 INFO L93 Difference]: Finished difference Result 568 states and 1666 transitions. [2020-02-10 19:55:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:42,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:42,574 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:55:42,574 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:55:42,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 19:55:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:55:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 373. [2020-02-10 19:55:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 19:55:42,584 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 19:55:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:42,584 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 19:55:42,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 19:55:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:42,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:42,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 19:55:42,585 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 19:55:42,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash 737109152, now seen corresponding path program 1724 times [2020-02-10 19:55:42,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:42,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132802780] [2020-02-10 19:55:42,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:42,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132802780] [2020-02-10 19:55:42,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:42,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:42,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539057005] [2020-02-10 19:55:42,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:42,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:42,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:42,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:42,860 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:55:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:42,942 INFO L93 Difference]: Finished difference Result 566 states and 1661 transitions. [2020-02-10 19:55:42,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:42,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:42,944 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:55:42,944 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:55:42,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:55:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 372. [2020-02-10 19:55:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1266 transitions. [2020-02-10 19:55:42,954 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1266 transitions. Word has length 22 [2020-02-10 19:55:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:42,954 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1266 transitions. [2020-02-10 19:55:42,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:42,954 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1266 transitions. [2020-02-10 19:55:42,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:42,955 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:42,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 19:55:42,955 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 19:55:42,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:42,955 INFO L82 PathProgramCache]: Analyzing trace with hash -5557014, now seen corresponding path program 1725 times [2020-02-10 19:55:42,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:42,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885659170] [2020-02-10 19:55:42,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:43,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 19:55:43,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885659170] [2020-02-10 19:55:43,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:43,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:43,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671623691] [2020-02-10 19:55:43,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:43,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:43,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:43,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:43,222 INFO L87 Difference]: Start difference. First operand 372 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:55:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:43,341 INFO L93 Difference]: Finished difference Result 571 states and 1674 transitions. [2020-02-10 19:55:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:43,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:43,343 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:55:43,343 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:55:43,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:55:43,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 375. [2020-02-10 19:55:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1271 transitions. [2020-02-10 19:55:43,353 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1271 transitions. Word has length 22 [2020-02-10 19:55:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:43,353 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1271 transitions. [2020-02-10 19:55:43,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1271 transitions. [2020-02-10 19:55:43,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:43,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:43,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 19:55:43,354 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 19:55:43,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:43,354 INFO L82 PathProgramCache]: Analyzing trace with hash -787556256, now seen corresponding path program 1726 times [2020-02-10 19:55:43,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:43,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361228922] [2020-02-10 19:55:43,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:43,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 19:55:43,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361228922] [2020-02-10 19:55:43,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:43,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:43,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956303732] [2020-02-10 19:55:43,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:43,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:43,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:43,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:43,605 INFO L87 Difference]: Start difference. First operand 375 states and 1271 transitions. Second operand 9 states. [2020-02-10 19:55:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:43,725 INFO L93 Difference]: Finished difference Result 564 states and 1667 transitions. [2020-02-10 19:55:43,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:43,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:43,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:43,727 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:55:43,727 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:55:43,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 19:55:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:55:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 372. [2020-02-10 19:55:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:55:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1265 transitions. [2020-02-10 19:55:43,737 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1265 transitions. Word has length 22 [2020-02-10 19:55:43,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:43,737 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1265 transitions. [2020-02-10 19:55:43,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:43,737 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1265 transitions. [2020-02-10 19:55:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:43,738 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:43,738 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:43,738 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 19:55:43,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:43,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1243455418, now seen corresponding path program 1727 times [2020-02-10 19:55:43,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:43,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483667682] [2020-02-10 19:55:43,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:44,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483667682] [2020-02-10 19:55:44,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:44,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:44,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189872340] [2020-02-10 19:55:44,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:44,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:44,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:44,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:44,004 INFO L87 Difference]: Start difference. First operand 372 states and 1265 transitions. Second operand 9 states. [2020-02-10 19:55:44,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:44,083 INFO L93 Difference]: Finished difference Result 567 states and 1663 transitions. [2020-02-10 19:55:44,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:44,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:44,085 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:55:44,085 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:55:44,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:44,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:55:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 373. [2020-02-10 19:55:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-02-10 19:55:44,094 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-02-10 19:55:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:44,094 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-02-10 19:55:44,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-02-10 19:55:44,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:44,095 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:44,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 19:55:44,095 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 19:55:44,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:44,095 INFO L82 PathProgramCache]: Analyzing trace with hash -905341118, now seen corresponding path program 1728 times [2020-02-10 19:55:44,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:44,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970389276] [2020-02-10 19:55:44,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:44,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 19:55:44,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970389276] [2020-02-10 19:55:44,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:44,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:44,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542285216] [2020-02-10 19:55:44,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:44,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:44,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:44,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:44,364 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:55:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:44,472 INFO L93 Difference]: Finished difference Result 562 states and 1662 transitions. [2020-02-10 19:55:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:44,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:44,473 INFO L225 Difference]: With dead ends: 562 [2020-02-10 19:55:44,474 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:55:44,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 19:55:44,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:55:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 369. [2020-02-10 19:55:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 19:55:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1260 transitions. [2020-02-10 19:55:44,483 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1260 transitions. Word has length 22 [2020-02-10 19:55:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:44,483 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1260 transitions. [2020-02-10 19:55:44,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1260 transitions. [2020-02-10 19:55:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:44,484 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:44,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:44,484 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 19:55:44,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:44,484 INFO L82 PathProgramCache]: Analyzing trace with hash 291899684, now seen corresponding path program 1729 times [2020-02-10 19:55:44,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:44,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67436323] [2020-02-10 19:55:44,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:44,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 19:55:44,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67436323] [2020-02-10 19:55:44,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:44,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:44,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559139195] [2020-02-10 19:55:44,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:44,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:44,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:44,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:44,775 INFO L87 Difference]: Start difference. First operand 369 states and 1260 transitions. Second operand 9 states. [2020-02-10 19:55:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:44,862 INFO L93 Difference]: Finished difference Result 614 states and 1793 transitions. [2020-02-10 19:55:44,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:44,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:44,864 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:55:44,864 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:55:44,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 19:55:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:55:44,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 381. [2020-02-10 19:55:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:55:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1298 transitions. [2020-02-10 19:55:44,874 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1298 transitions. Word has length 22 [2020-02-10 19:55:44,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:44,874 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1298 transitions. [2020-02-10 19:55:44,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1298 transitions. [2020-02-10 19:55:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:44,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:44,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 19:55:44,875 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 19:55:44,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:44,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1882165570, now seen corresponding path program 1730 times [2020-02-10 19:55:44,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:44,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593497519] [2020-02-10 19:55:44,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:45,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 19:55:45,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593497519] [2020-02-10 19:55:45,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:45,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:45,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076260203] [2020-02-10 19:55:45,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:45,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:45,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:45,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:45,156 INFO L87 Difference]: Start difference. First operand 381 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:55:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:45,270 INFO L93 Difference]: Finished difference Result 609 states and 1780 transitions. [2020-02-10 19:55:45,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:45,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:45,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:45,272 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:55:45,273 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:55:45,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:55:45,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 377. [2020-02-10 19:55:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:55:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1288 transitions. [2020-02-10 19:55:45,282 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1288 transitions. Word has length 22 [2020-02-10 19:55:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:45,282 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1288 transitions. [2020-02-10 19:55:45,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1288 transitions. [2020-02-10 19:55:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:45,283 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:45,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:45,283 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 19:55:45,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1056777068, now seen corresponding path program 1731 times [2020-02-10 19:55:45,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:45,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532329790] [2020-02-10 19:55:45,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:45,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 19:55:45,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532329790] [2020-02-10 19:55:45,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:45,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:45,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175457530] [2020-02-10 19:55:45,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:45,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:45,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:45,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:45,574 INFO L87 Difference]: Start difference. First operand 377 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:55:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:45,656 INFO L93 Difference]: Finished difference Result 616 states and 1794 transitions. [2020-02-10 19:55:45,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:45,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:45,658 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:55:45,658 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:55:45,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 19:55:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:55:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 382. [2020-02-10 19:55:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:55:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1296 transitions. [2020-02-10 19:55:45,668 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1296 transitions. Word has length 22 [2020-02-10 19:55:45,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:45,668 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1296 transitions. [2020-02-10 19:55:45,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:45,668 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1296 transitions. [2020-02-10 19:55:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:45,669 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:45,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 19:55:45,669 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 19:55:45,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:45,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1536862326, now seen corresponding path program 1732 times [2020-02-10 19:55:45,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:45,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287783228] [2020-02-10 19:55:45,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:45,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 19:55:45,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287783228] [2020-02-10 19:55:45,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:45,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:45,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347123096] [2020-02-10 19:55:45,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:45,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:45,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:45,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:45,959 INFO L87 Difference]: Start difference. First operand 382 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:55:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:46,073 INFO L93 Difference]: Finished difference Result 612 states and 1782 transitions. [2020-02-10 19:55:46,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:46,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:46,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:46,075 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:55:46,075 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 19:55:46,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 19:55:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 377. [2020-02-10 19:55:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:55:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-02-10 19:55:46,084 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-02-10 19:55:46,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:46,084 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-02-10 19:55:46,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:46,084 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-02-10 19:55:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:46,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:46,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 19:55:46,084 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 19:55:46,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:46,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2022893814, now seen corresponding path program 1733 times [2020-02-10 19:55:46,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:46,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626257287] [2020-02-10 19:55:46,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:46,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 19:55:46,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626257287] [2020-02-10 19:55:46,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:46,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:46,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898008752] [2020-02-10 19:55:46,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:46,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:46,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:46,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:46,376 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-02-10 19:55:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:46,493 INFO L93 Difference]: Finished difference Result 604 states and 1767 transitions. [2020-02-10 19:55:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:46,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:46,495 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:55:46,495 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:55:46,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 19:55:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:55:46,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 380. [2020-02-10 19:55:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:55:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1289 transitions. [2020-02-10 19:55:46,504 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1289 transitions. Word has length 22 [2020-02-10 19:55:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:46,504 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1289 transitions. [2020-02-10 19:55:46,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1289 transitions. [2020-02-10 19:55:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:46,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:46,505 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:46,505 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 19:55:46,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:46,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1398332802, now seen corresponding path program 1734 times [2020-02-10 19:55:46,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:46,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549267819] [2020-02-10 19:55:46,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:46,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 19:55:46,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549267819] [2020-02-10 19:55:46,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:46,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:46,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122474034] [2020-02-10 19:55:46,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:46,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:46,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:46,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:46,793 INFO L87 Difference]: Start difference. First operand 380 states and 1289 transitions. Second operand 9 states. [2020-02-10 19:55:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:46,905 INFO L93 Difference]: Finished difference Result 605 states and 1766 transitions. [2020-02-10 19:55:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:46,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:46,907 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:55:46,907 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:55:46,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 19:55:46,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:55:46,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 373. [2020-02-10 19:55:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-02-10 19:55:46,916 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-02-10 19:55:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:46,917 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-02-10 19:55:46,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-02-10 19:55:46,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:46,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:46,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 19:55:46,917 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 19:55:46,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:46,918 INFO L82 PathProgramCache]: Analyzing trace with hash -130586042, now seen corresponding path program 1735 times [2020-02-10 19:55:46,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:46,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789800004] [2020-02-10 19:55:46,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:47,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 19:55:47,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789800004] [2020-02-10 19:55:47,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:47,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:47,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367605640] [2020-02-10 19:55:47,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:47,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:47,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:47,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:47,207 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-02-10 19:55:47,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:47,302 INFO L93 Difference]: Finished difference Result 608 states and 1770 transitions. [2020-02-10 19:55:47,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:47,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:47,304 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:55:47,304 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:55:47,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:55:47,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 381. [2020-02-10 19:55:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:55:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1294 transitions. [2020-02-10 19:55:47,314 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1294 transitions. Word has length 22 [2020-02-10 19:55:47,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:47,314 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1294 transitions. [2020-02-10 19:55:47,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:47,315 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1294 transitions. [2020-02-10 19:55:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:47,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:47,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 19:55:47,315 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 19:55:47,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:47,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1459679844, now seen corresponding path program 1736 times [2020-02-10 19:55:47,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:47,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528393793] [2020-02-10 19:55:47,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:47,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 19:55:47,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528393793] [2020-02-10 19:55:47,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:47,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:47,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004421777] [2020-02-10 19:55:47,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:47,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:47,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:47,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:47,593 INFO L87 Difference]: Start difference. First operand 381 states and 1294 transitions. Second operand 9 states. [2020-02-10 19:55:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:47,703 INFO L93 Difference]: Finished difference Result 603 states and 1757 transitions. [2020-02-10 19:55:47,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:47,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:47,705 INFO L225 Difference]: With dead ends: 603 [2020-02-10 19:55:47,705 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:55:47,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:55:47,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 377. [2020-02-10 19:55:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:55:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-02-10 19:55:47,714 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-02-10 19:55:47,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:47,715 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-02-10 19:55:47,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-02-10 19:55:47,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:47,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:47,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 19:55:47,715 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 19:55:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:47,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1201976886, now seen corresponding path program 1737 times [2020-02-10 19:55:47,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:47,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975506076] [2020-02-10 19:55:47,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:48,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 19:55:48,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975506076] [2020-02-10 19:55:48,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:48,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:48,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313457105] [2020-02-10 19:55:48,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:48,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:48,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:48,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:48,010 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-02-10 19:55:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:48,097 INFO L93 Difference]: Finished difference Result 604 states and 1762 transitions. [2020-02-10 19:55:48,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:48,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:48,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:48,099 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:55:48,100 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:55:48,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:55:48,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 383. [2020-02-10 19:55:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:55:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1294 transitions. [2020-02-10 19:55:48,109 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1294 transitions. Word has length 22 [2020-02-10 19:55:48,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:48,110 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1294 transitions. [2020-02-10 19:55:48,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1294 transitions. [2020-02-10 19:55:48,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:48,110 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:48,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 19:55:48,110 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 19:55:48,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:48,111 INFO L82 PathProgramCache]: Analyzing trace with hash -389123142, now seen corresponding path program 1738 times [2020-02-10 19:55:48,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:48,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49973258] [2020-02-10 19:55:48,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:48,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49973258] [2020-02-10 19:55:48,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:48,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:48,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331310319] [2020-02-10 19:55:48,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:48,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:48,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:48,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:48,393 INFO L87 Difference]: Start difference. First operand 383 states and 1294 transitions. Second operand 9 states. [2020-02-10 19:55:48,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:48,503 INFO L93 Difference]: Finished difference Result 592 states and 1743 transitions. [2020-02-10 19:55:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:48,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:48,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:48,505 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:55:48,505 INFO L226 Difference]: Without dead ends: 573 [2020-02-10 19:55:48,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:48,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-02-10 19:55:48,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 377. [2020-02-10 19:55:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:55:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1280 transitions. [2020-02-10 19:55:48,515 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1280 transitions. Word has length 22 [2020-02-10 19:55:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:48,515 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1280 transitions. [2020-02-10 19:55:48,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1280 transitions. [2020-02-10 19:55:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:48,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:48,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 19:55:48,516 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 19:55:48,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:48,517 INFO L82 PathProgramCache]: Analyzing trace with hash -13319528, now seen corresponding path program 1739 times [2020-02-10 19:55:48,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:48,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585051185] [2020-02-10 19:55:48,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:48,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 19:55:48,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585051185] [2020-02-10 19:55:48,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:48,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:48,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858808380] [2020-02-10 19:55:48,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:48,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:48,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:48,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:48,796 INFO L87 Difference]: Start difference. First operand 377 states and 1280 transitions. Second operand 9 states. [2020-02-10 19:55:48,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:48,899 INFO L93 Difference]: Finished difference Result 596 states and 1741 transitions. [2020-02-10 19:55:48,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:48,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:48,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:48,901 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:55:48,901 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:55:48,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:48,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:55:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 380. [2020-02-10 19:55:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:55:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1285 transitions. [2020-02-10 19:55:48,909 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1285 transitions. Word has length 22 [2020-02-10 19:55:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:48,910 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1285 transitions. [2020-02-10 19:55:48,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1285 transitions. [2020-02-10 19:55:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:48,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:48,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 19:55:48,910 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 19:55:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:48,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1715727806, now seen corresponding path program 1740 times [2020-02-10 19:55:48,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:48,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960908366] [2020-02-10 19:55:48,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:49,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 19:55:49,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960908366] [2020-02-10 19:55:49,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:49,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:49,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761678361] [2020-02-10 19:55:49,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:49,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:49,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:49,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:49,190 INFO L87 Difference]: Start difference. First operand 380 states and 1285 transitions. Second operand 9 states. [2020-02-10 19:55:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:49,299 INFO L93 Difference]: Finished difference Result 589 states and 1734 transitions. [2020-02-10 19:55:49,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:49,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:49,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:49,301 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:55:49,301 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 19:55:49,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 19:55:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 19:55:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 373. [2020-02-10 19:55:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 19:55:49,310 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 19:55:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:49,310 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 19:55:49,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 19:55:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:49,311 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:49,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:49,311 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 19:55:49,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:49,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1597968036, now seen corresponding path program 1741 times [2020-02-10 19:55:49,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:49,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122434027] [2020-02-10 19:55:49,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:49,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 19:55:49,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122434027] [2020-02-10 19:55:49,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:49,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:49,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486594231] [2020-02-10 19:55:49,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:49,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:49,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:49,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:49,603 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:55:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:49,689 INFO L93 Difference]: Finished difference Result 605 states and 1766 transitions. [2020-02-10 19:55:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:49,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:49,691 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:55:49,691 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 19:55:49,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 19:55:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 19:55:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 383. [2020-02-10 19:55:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:55:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1296 transitions. [2020-02-10 19:55:49,700 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1296 transitions. Word has length 22 [2020-02-10 19:55:49,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:49,700 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1296 transitions. [2020-02-10 19:55:49,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1296 transitions. [2020-02-10 19:55:49,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:49,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:49,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 19:55:49,701 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 19:55:49,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:49,701 INFO L82 PathProgramCache]: Analyzing trace with hash -103359866, now seen corresponding path program 1742 times [2020-02-10 19:55:49,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:49,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835573295] [2020-02-10 19:55:49,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:49,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 19:55:49,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835573295] [2020-02-10 19:55:49,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:49,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:49,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750012230] [2020-02-10 19:55:49,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:49,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:49,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:49,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:49,995 INFO L87 Difference]: Start difference. First operand 383 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:55:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:50,117 INFO L93 Difference]: Finished difference Result 601 states and 1754 transitions. [2020-02-10 19:55:50,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:50,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:50,119 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:55:50,119 INFO L226 Difference]: Without dead ends: 584 [2020-02-10 19:55:50,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-02-10 19:55:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 378. [2020-02-10 19:55:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:55:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1283 transitions. [2020-02-10 19:55:50,129 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1283 transitions. Word has length 22 [2020-02-10 19:55:50,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:50,129 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1283 transitions. [2020-02-10 19:55:50,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1283 transitions. [2020-02-10 19:55:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:50,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:50,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 19:55:50,130 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 19:55:50,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:50,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1952296762, now seen corresponding path program 1743 times [2020-02-10 19:55:50,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:50,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627692087] [2020-02-10 19:55:50,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:50,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627692087] [2020-02-10 19:55:50,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:50,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:50,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140154148] [2020-02-10 19:55:50,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:50,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:50,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:50,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:50,431 INFO L87 Difference]: Start difference. First operand 378 states and 1283 transitions. Second operand 9 states. [2020-02-10 19:55:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:50,529 INFO L93 Difference]: Finished difference Result 593 states and 1736 transitions. [2020-02-10 19:55:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:50,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:50,531 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:55:50,531 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:55:50,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:55:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 384. [2020-02-10 19:55:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-02-10 19:55:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1293 transitions. [2020-02-10 19:55:50,541 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1293 transitions. Word has length 22 [2020-02-10 19:55:50,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:50,541 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 1293 transitions. [2020-02-10 19:55:50,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:50,541 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1293 transitions. [2020-02-10 19:55:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:50,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:50,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 19:55:50,542 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 19:55:50,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:50,542 INFO L82 PathProgramCache]: Analyzing trace with hash 751570506, now seen corresponding path program 1744 times [2020-02-10 19:55:50,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:50,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861302578] [2020-02-10 19:55:50,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:50,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861302578] [2020-02-10 19:55:50,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:50,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:50,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509977114] [2020-02-10 19:55:50,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:50,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:50,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:50,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:50,833 INFO L87 Difference]: Start difference. First operand 384 states and 1293 transitions. Second operand 9 states. [2020-02-10 19:55:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:50,958 INFO L93 Difference]: Finished difference Result 581 states and 1717 transitions. [2020-02-10 19:55:50,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:50,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:50,960 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:55:50,960 INFO L226 Difference]: Without dead ends: 562 [2020-02-10 19:55:50,960 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-02-10 19:55:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 378. [2020-02-10 19:55:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:55:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1278 transitions. [2020-02-10 19:55:50,970 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1278 transitions. Word has length 22 [2020-02-10 19:55:50,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:50,970 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1278 transitions. [2020-02-10 19:55:50,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:50,970 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1278 transitions. [2020-02-10 19:55:50,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:50,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:50,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 19:55:50,971 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 19:55:50,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:50,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1253450174, now seen corresponding path program 1745 times [2020-02-10 19:55:50,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:50,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298669322] [2020-02-10 19:55:50,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:51,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 19:55:51,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298669322] [2020-02-10 19:55:51,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:51,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:51,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35504694] [2020-02-10 19:55:51,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:51,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:51,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:51,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:51,256 INFO L87 Difference]: Start difference. First operand 378 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:55:51,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:51,374 INFO L93 Difference]: Finished difference Result 578 states and 1711 transitions. [2020-02-10 19:55:51,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:51,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:51,376 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:55:51,376 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:55:51,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 19:55:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:55:51,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 382. [2020-02-10 19:55:51,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:55:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1285 transitions. [2020-02-10 19:55:51,386 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1285 transitions. Word has length 22 [2020-02-10 19:55:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:51,386 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1285 transitions. [2020-02-10 19:55:51,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1285 transitions. [2020-02-10 19:55:51,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:51,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:51,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 19:55:51,387 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 19:55:51,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:51,387 INFO L82 PathProgramCache]: Analyzing trace with hash -394575644, now seen corresponding path program 1746 times [2020-02-10 19:55:51,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:51,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793183074] [2020-02-10 19:55:51,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:51,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 19:55:51,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793183074] [2020-02-10 19:55:51,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:51,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:51,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122337301] [2020-02-10 19:55:51,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:51,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:51,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:51,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:51,682 INFO L87 Difference]: Start difference. First operand 382 states and 1285 transitions. Second operand 9 states. [2020-02-10 19:55:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:51,795 INFO L93 Difference]: Finished difference Result 565 states and 1692 transitions. [2020-02-10 19:55:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:51,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:51,797 INFO L225 Difference]: With dead ends: 565 [2020-02-10 19:55:51,797 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 19:55:51,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 19:55:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 19:55:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 373. [2020-02-10 19:55:51,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-02-10 19:55:51,806 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-02-10 19:55:51,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:51,806 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-02-10 19:55:51,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:51,806 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-02-10 19:55:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:51,807 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:51,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 19:55:51,807 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 19:55:51,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:51,807 INFO L82 PathProgramCache]: Analyzing trace with hash -690413758, now seen corresponding path program 1747 times [2020-02-10 19:55:51,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:51,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514283871] [2020-02-10 19:55:51,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:52,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:52,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514283871] [2020-02-10 19:55:52,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:52,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:52,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146454641] [2020-02-10 19:55:52,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:52,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:52,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:52,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:52,114 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:55:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:52,220 INFO L93 Difference]: Finished difference Result 588 states and 1724 transitions. [2020-02-10 19:55:52,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:52,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:52,222 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:55:52,222 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:55:52,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 19:55:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:55:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-02-10 19:55:52,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:55:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1282 transitions. [2020-02-10 19:55:52,232 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1282 transitions. Word has length 22 [2020-02-10 19:55:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:52,232 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1282 transitions. [2020-02-10 19:55:52,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1282 transitions. [2020-02-10 19:55:52,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:52,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:52,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:52,232 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 19:55:52,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:52,233 INFO L82 PathProgramCache]: Analyzing trace with hash 183326922, now seen corresponding path program 1748 times [2020-02-10 19:55:52,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:52,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636509258] [2020-02-10 19:55:52,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:52,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 19:55:52,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636509258] [2020-02-10 19:55:52,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:52,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:52,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405240418] [2020-02-10 19:55:52,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:52,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:52,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:52,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:52,530 INFO L87 Difference]: Start difference. First operand 379 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:55:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:52,654 INFO L93 Difference]: Finished difference Result 589 states and 1723 transitions. [2020-02-10 19:55:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:52,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:52,656 INFO L225 Difference]: With dead ends: 589 [2020-02-10 19:55:52,656 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:55:52,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 19:55:52,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:55:52,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 376. [2020-02-10 19:55:52,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:55:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1274 transitions. [2020-02-10 19:55:52,664 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1274 transitions. Word has length 22 [2020-02-10 19:55:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:52,665 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1274 transitions. [2020-02-10 19:55:52,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1274 transitions. [2020-02-10 19:55:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:52,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:52,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 19:55:52,665 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 19:55:52,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:52,666 INFO L82 PathProgramCache]: Analyzing trace with hash 54288740, now seen corresponding path program 1749 times [2020-02-10 19:55:52,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:52,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022200464] [2020-02-10 19:55:52,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:52,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 19:55:52,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022200464] [2020-02-10 19:55:52,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:52,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:52,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263208782] [2020-02-10 19:55:52,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:52,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:52,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:52,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:52,950 INFO L87 Difference]: Start difference. First operand 376 states and 1274 transitions. Second operand 9 states. [2020-02-10 19:55:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:53,070 INFO L93 Difference]: Finished difference Result 583 states and 1710 transitions. [2020-02-10 19:55:53,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:53,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:53,072 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:55:53,072 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:55:53,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:55:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 379. [2020-02-10 19:55:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:55:53,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1279 transitions. [2020-02-10 19:55:53,082 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1279 transitions. Word has length 22 [2020-02-10 19:55:53,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:53,082 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1279 transitions. [2020-02-10 19:55:53,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1279 transitions. [2020-02-10 19:55:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:53,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:53,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 19:55:53,083 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 19:55:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:53,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1783336074, now seen corresponding path program 1750 times [2020-02-10 19:55:53,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:53,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427799689] [2020-02-10 19:55:53,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55: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 19:55:53,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427799689] [2020-02-10 19:55:53,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:53,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:53,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810288554] [2020-02-10 19:55:53,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:53,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:53,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:53,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:53,372 INFO L87 Difference]: Start difference. First operand 379 states and 1279 transitions. Second operand 9 states. [2020-02-10 19:55:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:53,495 INFO L93 Difference]: Finished difference Result 576 states and 1703 transitions. [2020-02-10 19:55:53,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:53,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:53,497 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:55:53,497 INFO L226 Difference]: Without dead ends: 560 [2020-02-10 19:55:53,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 19:55:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-02-10 19:55:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 376. [2020-02-10 19:55:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:55:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1271 transitions. [2020-02-10 19:55:53,507 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1271 transitions. Word has length 22 [2020-02-10 19:55:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:53,507 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1271 transitions. [2020-02-10 19:55:53,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1271 transitions. [2020-02-10 19:55:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:53,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:53,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 19:55:53,508 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 19:55:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:53,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2050780572, now seen corresponding path program 1751 times [2020-02-10 19:55:53,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:53,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604759360] [2020-02-10 19:55:53,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:53,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 19:55:53,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604759360] [2020-02-10 19:55:53,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:53,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:53,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819669297] [2020-02-10 19:55:53,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:53,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:53,798 INFO L87 Difference]: Start difference. First operand 376 states and 1271 transitions. Second operand 9 states. [2020-02-10 19:55:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:53,928 INFO L93 Difference]: Finished difference Result 576 states and 1704 transitions. [2020-02-10 19:55:53,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:53,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:53,930 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:55:53,930 INFO L226 Difference]: Without dead ends: 564 [2020-02-10 19:55:53,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 19:55:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-02-10 19:55:53,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 380. [2020-02-10 19:55:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:55:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1278 transitions. [2020-02-10 19:55:53,940 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1278 transitions. Word has length 22 [2020-02-10 19:55:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:53,940 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1278 transitions. [2020-02-10 19:55:53,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1278 transitions. [2020-02-10 19:55:53,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:53,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:53,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 19:55:53,941 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 19:55:53,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:53,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1195473918, now seen corresponding path program 1752 times [2020-02-10 19:55:53,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:53,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56427879] [2020-02-10 19:55:53,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:54,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 19:55:54,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56427879] [2020-02-10 19:55:54,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:54,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:54,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594863812] [2020-02-10 19:55:54,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:54,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:54,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:54,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:54,229 INFO L87 Difference]: Start difference. First operand 380 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:55:54,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:54,349 INFO L93 Difference]: Finished difference Result 563 states and 1685 transitions. [2020-02-10 19:55:54,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:54,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:54,351 INFO L225 Difference]: With dead ends: 563 [2020-02-10 19:55:54,351 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 19:55:54,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 19:55:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 19:55:54,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 369. [2020-02-10 19:55:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 19:55:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1258 transitions. [2020-02-10 19:55:54,360 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1258 transitions. Word has length 22 [2020-02-10 19:55:54,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:54,360 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1258 transitions. [2020-02-10 19:55:54,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1258 transitions. [2020-02-10 19:55:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:54,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:54,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 19:55:54,361 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 19:55:54,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:54,361 INFO L82 PathProgramCache]: Analyzing trace with hash 830437174, now seen corresponding path program 1753 times [2020-02-10 19:55:54,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:54,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499638886] [2020-02-10 19:55:54,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:54,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 19:55:54,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499638886] [2020-02-10 19:55:54,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:54,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:54,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562371064] [2020-02-10 19:55:54,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:54,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:54,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:54,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:54,658 INFO L87 Difference]: Start difference. First operand 369 states and 1258 transitions. Second operand 9 states. [2020-02-10 19:55:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:54,755 INFO L93 Difference]: Finished difference Result 590 states and 1715 transitions. [2020-02-10 19:55:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:54,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:54,757 INFO L225 Difference]: With dead ends: 590 [2020-02-10 19:55:54,757 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:55:54,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 19:55:54,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:55:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 375. [2020-02-10 19:55:54,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-02-10 19:55:54,767 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-02-10 19:55:54,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:54,767 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-02-10 19:55:54,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-02-10 19:55:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:54,768 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:54,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 19:55:54,768 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 19:55:54,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:54,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1391505666, now seen corresponding path program 1754 times [2020-02-10 19:55:54,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:54,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182913868] [2020-02-10 19:55:54,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:55,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 19:55:55,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182913868] [2020-02-10 19:55:55,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:55,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:55,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857773877] [2020-02-10 19:55:55,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:55,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:55,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:55,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:55,043 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-02-10 19:55:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:55,132 INFO L93 Difference]: Finished difference Result 583 states and 1700 transitions. [2020-02-10 19:55:55,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:55,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:55,134 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:55:55,134 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:55:55,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:55,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:55:55,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 373. [2020-02-10 19:55:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-02-10 19:55:55,144 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-02-10 19:55:55,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:55,144 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-02-10 19:55:55,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-02-10 19:55:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:55,145 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:55,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 19:55:55,145 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 19:55:55,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash 242691852, now seen corresponding path program 1755 times [2020-02-10 19:55:55,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:55,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962990091] [2020-02-10 19:55:55,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:55,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962990091] [2020-02-10 19:55:55,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:55,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:55,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776789921] [2020-02-10 19:55:55,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:55,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:55,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:55,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:55,437 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:55:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:55,524 INFO L93 Difference]: Finished difference Result 596 states and 1728 transitions. [2020-02-10 19:55:55,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:55,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:55,526 INFO L225 Difference]: With dead ends: 596 [2020-02-10 19:55:55,526 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:55:55,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:55:55,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 378. [2020-02-10 19:55:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:55:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1278 transitions. [2020-02-10 19:55:55,536 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1278 transitions. Word has length 22 [2020-02-10 19:55:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:55,536 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1278 transitions. [2020-02-10 19:55:55,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1278 transitions. [2020-02-10 19:55:55,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:55,537 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:55,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:55,537 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 19:55:55,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:55,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2030358786, now seen corresponding path program 1756 times [2020-02-10 19:55:55,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:55,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643720693] [2020-02-10 19:55:55,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:55,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 19:55:55,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643720693] [2020-02-10 19:55:55,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:55,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:55,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633033791] [2020-02-10 19:55:55,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:55,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:55,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:55,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:55,818 INFO L87 Difference]: Start difference. First operand 378 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:55:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:55,923 INFO L93 Difference]: Finished difference Result 592 states and 1716 transitions. [2020-02-10 19:55:55,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:55,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:55,925 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:55:55,925 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:55:55,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 19:55:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:55:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 373. [2020-02-10 19:55:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 19:55:55,935 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 19:55:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:55,936 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 19:55:55,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 19:55:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:55,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:55,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 19:55:55,936 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 19:55:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:55,937 INFO L82 PathProgramCache]: Analyzing trace with hash 297414078, now seen corresponding path program 1757 times [2020-02-10 19:55:55,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:55,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062071778] [2020-02-10 19:55:55,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:56,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 19:55:56,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062071778] [2020-02-10 19:55:56,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:56,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:56,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494871354] [2020-02-10 19:55:56,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:56,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:56,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:56,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:56,227 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:55:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:56,313 INFO L93 Difference]: Finished difference Result 578 states and 1689 transitions. [2020-02-10 19:55:56,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:56,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:56,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:56,315 INFO L225 Difference]: With dead ends: 578 [2020-02-10 19:55:56,315 INFO L226 Difference]: Without dead ends: 569 [2020-02-10 19:55:56,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 19:55:56,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-02-10 19:55:56,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 374. [2020-02-10 19:55:56,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-02-10 19:55:56,325 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-02-10 19:55:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:56,325 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-02-10 19:55:56,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-02-10 19:55:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:56,326 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:56,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 19:55:56,326 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 19:55:56,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:56,326 INFO L82 PathProgramCache]: Analyzing trace with hash 832643880, now seen corresponding path program 1758 times [2020-02-10 19:55:56,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:56,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783528222] [2020-02-10 19:55:56,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:56,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 19:55:56,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783528222] [2020-02-10 19:55:56,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:56,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:56,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145817011] [2020-02-10 19:55:56,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:56,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:56,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:56,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:56,606 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-02-10 19:55:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:56,714 INFO L93 Difference]: Finished difference Result 581 states and 1694 transitions. [2020-02-10 19:55:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:56,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:56,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:56,716 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:55:56,716 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:55:56,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 19:55:56,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:55:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 371. [2020-02-10 19:55:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-02-10 19:55:56,725 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-02-10 19:55:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:56,725 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-02-10 19:55:56,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-02-10 19:55:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:56,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:56,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 19:55:56,726 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 19:55:56,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:56,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1538496044, now seen corresponding path program 1759 times [2020-02-10 19:55:56,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:56,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146309848] [2020-02-10 19:55:56,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:56,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146309848] [2020-02-10 19:55:56,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:56,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:56,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802308091] [2020-02-10 19:55:56,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:56,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:56,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:56,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:56,978 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-02-10 19:55:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:57,075 INFO L93 Difference]: Finished difference Result 588 states and 1708 transitions. [2020-02-10 19:55:57,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:57,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:57,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:57,077 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:55:57,077 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:55:57,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:55:57,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 375. [2020-02-10 19:55:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:55:57,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1272 transitions. [2020-02-10 19:55:57,088 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1272 transitions. Word has length 22 [2020-02-10 19:55:57,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:57,088 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1272 transitions. [2020-02-10 19:55:57,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1272 transitions. [2020-02-10 19:55:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:57,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:57,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 19:55:57,089 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 19:55:57,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:57,089 INFO L82 PathProgramCache]: Analyzing trace with hash -977427552, now seen corresponding path program 1760 times [2020-02-10 19:55:57,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:57,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713960366] [2020-02-10 19:55:57,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:57,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713960366] [2020-02-10 19:55:57,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:57,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:57,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925632299] [2020-02-10 19:55:57,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:57,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:57,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:57,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:57,348 INFO L87 Difference]: Start difference. First operand 375 states and 1272 transitions. Second operand 9 states. [2020-02-10 19:55:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:57,434 INFO L93 Difference]: Finished difference Result 581 states and 1693 transitions. [2020-02-10 19:55:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:57,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:57,435 INFO L225 Difference]: With dead ends: 581 [2020-02-10 19:55:57,436 INFO L226 Difference]: Without dead ends: 570 [2020-02-10 19:55:57,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-02-10 19:55:57,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 373. [2020-02-10 19:55:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-02-10 19:55:57,445 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-02-10 19:55:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:57,445 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-02-10 19:55:57,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-02-10 19:55:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:57,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:57,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 19:55:57,446 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 19:55:57,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:57,446 INFO L82 PathProgramCache]: Analyzing trace with hash 568288076, now seen corresponding path program 1761 times [2020-02-10 19:55:57,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:57,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515856930] [2020-02-10 19:55:57,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:57,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515856930] [2020-02-10 19:55:57,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:57,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:57,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778798154] [2020-02-10 19:55:57,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:57,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:57,708 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:55:57,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:57,806 INFO L93 Difference]: Finished difference Result 588 states and 1712 transitions. [2020-02-10 19:55:57,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:57,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:57,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:57,808 INFO L225 Difference]: With dead ends: 588 [2020-02-10 19:55:57,808 INFO L226 Difference]: Without dead ends: 572 [2020-02-10 19:55:57,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 19:55:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-02-10 19:55:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 379. [2020-02-10 19:55:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:55:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1278 transitions. [2020-02-10 19:55:57,817 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1278 transitions. Word has length 22 [2020-02-10 19:55:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:57,818 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1278 transitions. [2020-02-10 19:55:57,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1278 transitions. [2020-02-10 19:55:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:57,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:57,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 19:55:57,818 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 19:55:57,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:57,819 INFO L82 PathProgramCache]: Analyzing trace with hash 761108768, now seen corresponding path program 1762 times [2020-02-10 19:55:57,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:57,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404366849] [2020-02-10 19:55:57,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:58,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 19:55:58,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404366849] [2020-02-10 19:55:58,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:58,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:58,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442134460] [2020-02-10 19:55:58,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:58,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:58,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:58,081 INFO L87 Difference]: Start difference. First operand 379 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:55:58,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:58,182 INFO L93 Difference]: Finished difference Result 576 states and 1693 transitions. [2020-02-10 19:55:58,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:58,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:58,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:58,184 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:55:58,184 INFO L226 Difference]: Without dead ends: 557 [2020-02-10 19:55:58,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 19:55:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-02-10 19:55:58,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 373. [2020-02-10 19:55:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:55:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-02-10 19:55:58,193 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-02-10 19:55:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:58,193 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-02-10 19:55:58,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-02-10 19:55:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:58,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:58,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 19:55:58,194 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 19:55:58,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:58,194 INFO L82 PathProgramCache]: Analyzing trace with hash 623010302, now seen corresponding path program 1763 times [2020-02-10 19:55:58,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:58,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422110338] [2020-02-10 19:55:58,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:58,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 19:55:58,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422110338] [2020-02-10 19:55:58,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:58,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:58,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602013447] [2020-02-10 19:55:58,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:58,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:58,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:58,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:58,451 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:55:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:58,542 INFO L93 Difference]: Finished difference Result 576 states and 1683 transitions. [2020-02-10 19:55:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:58,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:58,544 INFO L225 Difference]: With dead ends: 576 [2020-02-10 19:55:58,544 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:55:58,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 19:55:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:55:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 374. [2020-02-10 19:55:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:55:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1267 transitions. [2020-02-10 19:55:58,553 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1267 transitions. Word has length 22 [2020-02-10 19:55:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:58,554 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1267 transitions. [2020-02-10 19:55:58,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1267 transitions. [2020-02-10 19:55:58,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:58,554 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:58,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 19:55:58,554 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 19:55:58,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:58,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1525786234, now seen corresponding path program 1764 times [2020-02-10 19:55:58,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:58,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405933152] [2020-02-10 19:55:58,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:58,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 19:55:58,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405933152] [2020-02-10 19:55:58,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:58,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:58,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87833187] [2020-02-10 19:55:58,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:58,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:58,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:58,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:58,807 INFO L87 Difference]: Start difference. First operand 374 states and 1267 transitions. Second operand 9 states. [2020-02-10 19:55:58,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:58,917 INFO L93 Difference]: Finished difference Result 571 states and 1682 transitions. [2020-02-10 19:55:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:58,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:58,918 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:55:58,918 INFO L226 Difference]: Without dead ends: 555 [2020-02-10 19:55:58,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:58,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-02-10 19:55:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 371. [2020-02-10 19:55:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:55:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-02-10 19:55:58,927 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-02-10 19:55:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:58,927 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-02-10 19:55:58,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-02-10 19:55:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:58,928 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:58,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 19:55:58,928 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 19:55:58,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:58,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1128490132, now seen corresponding path program 1765 times [2020-02-10 19:55:58,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:58,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744478534] [2020-02-10 19:55:58,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:59,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 19:55:59,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744478534] [2020-02-10 19:55:59,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:59,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:59,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635276333] [2020-02-10 19:55:59,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:59,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:59,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:59,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:59,207 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-02-10 19:55:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:59,299 INFO L93 Difference]: Finished difference Result 595 states and 1734 transitions. [2020-02-10 19:55:59,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:59,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:59,300 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:55:59,301 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:55:59,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 19:55:59,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:55:59,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 381. [2020-02-10 19:55:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:55:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1288 transitions. [2020-02-10 19:55:59,310 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1288 transitions. Word has length 22 [2020-02-10 19:55:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:59,310 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1288 transitions. [2020-02-10 19:55:59,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1288 transitions. [2020-02-10 19:55:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:59,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:59,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:59,311 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 19:55:59,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:59,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1144560506, now seen corresponding path program 1766 times [2020-02-10 19:55:59,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:59,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228651313] [2020-02-10 19:55:59,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55: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 19:55:59,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228651313] [2020-02-10 19:55:59,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:59,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:59,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428593391] [2020-02-10 19:55:59,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:59,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:59,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:59,581 INFO L87 Difference]: Start difference. First operand 381 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:55:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:59,682 INFO L93 Difference]: Finished difference Result 591 states and 1722 transitions. [2020-02-10 19:55:59,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:55:59,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:55:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:59,684 INFO L225 Difference]: With dead ends: 591 [2020-02-10 19:55:59,684 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:55:59,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:55:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 376. [2020-02-10 19:55:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:55:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1275 transitions. [2020-02-10 19:55:59,694 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1275 transitions. Word has length 22 [2020-02-10 19:55:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:59,694 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1275 transitions. [2020-02-10 19:55:59,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:55:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1275 transitions. [2020-02-10 19:55:59,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:55:59,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:59,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 19:55:59,695 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 19:55:59,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:59,695 INFO L82 PathProgramCache]: Analyzing trace with hash -471947722, now seen corresponding path program 1767 times [2020-02-10 19:55:59,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:59,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310592227] [2020-02-10 19:55:59,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:59,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 19:55:59,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310592227] [2020-02-10 19:55:59,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:59,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:55:59,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574712428] [2020-02-10 19:55:59,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:55:59,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:59,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:55:59,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:55:59,972 INFO L87 Difference]: Start difference. First operand 376 states and 1275 transitions. Second operand 9 states. [2020-02-10 19:56:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:00,062 INFO L93 Difference]: Finished difference Result 583 states and 1704 transitions. [2020-02-10 19:56:00,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:00,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:00,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:00,063 INFO L225 Difference]: With dead ends: 583 [2020-02-10 19:56:00,063 INFO L226 Difference]: Without dead ends: 567 [2020-02-10 19:56:00,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 19:56:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-02-10 19:56:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 382. [2020-02-10 19:56:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:56:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1285 transitions. [2020-02-10 19:56:00,072 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1285 transitions. Word has length 22 [2020-02-10 19:56:00,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:00,072 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1285 transitions. [2020-02-10 19:56:00,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1285 transitions. [2020-02-10 19:56:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:00,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:00,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 19:56:00,073 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 19:56:00,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:00,073 INFO L82 PathProgramCache]: Analyzing trace with hash -279127030, now seen corresponding path program 1768 times [2020-02-10 19:56:00,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:00,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061189807] [2020-02-10 19:56:00,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:00,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061189807] [2020-02-10 19:56:00,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:00,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:00,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792945042] [2020-02-10 19:56:00,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:00,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:00,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:00,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:00,339 INFO L87 Difference]: Start difference. First operand 382 states and 1285 transitions. Second operand 9 states. [2020-02-10 19:56:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:00,453 INFO L93 Difference]: Finished difference Result 571 states and 1685 transitions. [2020-02-10 19:56:00,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:00,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:00,455 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:56:00,455 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:56:00,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 19:56:00,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:56:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 376. [2020-02-10 19:56:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:56:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1270 transitions. [2020-02-10 19:56:00,464 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1270 transitions. Word has length 22 [2020-02-10 19:56:00,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:00,464 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1270 transitions. [2020-02-10 19:56:00,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1270 transitions. [2020-02-10 19:56:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:00,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:00,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 19:56:00,465 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 19:56:00,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:00,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1467283954, now seen corresponding path program 1769 times [2020-02-10 19:56:00,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:00,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856390965] [2020-02-10 19:56:00,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:00,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 19:56:00,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856390965] [2020-02-10 19:56:00,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:00,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:00,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357822410] [2020-02-10 19:56:00,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:00,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:00,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:00,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:00,732 INFO L87 Difference]: Start difference. First operand 376 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:56:00,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:00,830 INFO L93 Difference]: Finished difference Result 568 states and 1679 transitions. [2020-02-10 19:56:00,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:00,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:00,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:00,832 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:56:00,832 INFO L226 Difference]: Without dead ends: 556 [2020-02-10 19:56:00,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-02-10 19:56:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 380. [2020-02-10 19:56:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:56:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1277 transitions. [2020-02-10 19:56:00,841 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1277 transitions. Word has length 22 [2020-02-10 19:56:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:00,841 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1277 transitions. [2020-02-10 19:56:00,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1277 transitions. [2020-02-10 19:56:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:00,842 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:00,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 19:56:00,842 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 19:56:00,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:00,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1968808812, now seen corresponding path program 1770 times [2020-02-10 19:56:00,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:00,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593231840] [2020-02-10 19:56:00,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:01,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 19:56:01,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593231840] [2020-02-10 19:56:01,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:01,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:01,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664601188] [2020-02-10 19:56:01,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:01,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:01,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:01,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:01,106 INFO L87 Difference]: Start difference. First operand 380 states and 1277 transitions. Second operand 9 states. [2020-02-10 19:56:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:01,214 INFO L93 Difference]: Finished difference Result 555 states and 1660 transitions. [2020-02-10 19:56:01,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:01,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:01,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:01,215 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:56:01,216 INFO L226 Difference]: Without dead ends: 533 [2020-02-10 19:56:01,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 19:56:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-02-10 19:56:01,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 371. [2020-02-10 19:56:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:56:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1260 transitions. [2020-02-10 19:56:01,224 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1260 transitions. Word has length 22 [2020-02-10 19:56:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:01,224 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1260 transitions. [2020-02-10 19:56:01,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1260 transitions. [2020-02-10 19:56:01,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:01,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:01,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 19:56:01,225 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 19:56:01,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:01,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1628620000, now seen corresponding path program 1771 times [2020-02-10 19:56:01,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:01,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929916669] [2020-02-10 19:56:01,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:01,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 19:56:01,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929916669] [2020-02-10 19:56:01,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:01,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:01,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829234314] [2020-02-10 19:56:01,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:01,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:01,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:01,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:01,496 INFO L87 Difference]: Start difference. First operand 371 states and 1260 transitions. Second operand 9 states. [2020-02-10 19:56:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:01,584 INFO L93 Difference]: Finished difference Result 568 states and 1666 transitions. [2020-02-10 19:56:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:01,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:01,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:01,586 INFO L225 Difference]: With dead ends: 568 [2020-02-10 19:56:01,586 INFO L226 Difference]: Without dead ends: 559 [2020-02-10 19:56:01,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-02-10 19:56:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 373. [2020-02-10 19:56:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:56:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1264 transitions. [2020-02-10 19:56:01,596 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1264 transitions. Word has length 22 [2020-02-10 19:56:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:01,596 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1264 transitions. [2020-02-10 19:56:01,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1264 transitions. [2020-02-10 19:56:01,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:01,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:01,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 19:56:01,597 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 19:56:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:01,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1093390198, now seen corresponding path program 1772 times [2020-02-10 19:56:01,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:01,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585000461] [2020-02-10 19:56:01,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:01,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585000461] [2020-02-10 19:56:01,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:01,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:01,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713398050] [2020-02-10 19:56:01,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:01,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:01,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:01,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:01,860 INFO L87 Difference]: Start difference. First operand 373 states and 1264 transitions. Second operand 9 states. [2020-02-10 19:56:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:01,974 INFO L93 Difference]: Finished difference Result 571 states and 1671 transitions. [2020-02-10 19:56:01,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:01,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:01,975 INFO L225 Difference]: With dead ends: 571 [2020-02-10 19:56:01,975 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:56:01,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 19:56:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:56:01,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 372. [2020-02-10 19:56:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:56:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1262 transitions. [2020-02-10 19:56:01,984 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1262 transitions. Word has length 22 [2020-02-10 19:56:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:01,985 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1262 transitions. [2020-02-10 19:56:01,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1262 transitions. [2020-02-10 19:56:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:01,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:01,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 19:56:01,985 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 19:56:01,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:01,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1065909442, now seen corresponding path program 1773 times [2020-02-10 19:56:01,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:01,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710862622] [2020-02-10 19:56:01,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:02,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 19:56:02,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710862622] [2020-02-10 19:56:02,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:02,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:02,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396102518] [2020-02-10 19:56:02,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:02,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:02,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:02,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:02,247 INFO L87 Difference]: Start difference. First operand 372 states and 1262 transitions. Second operand 9 states. [2020-02-10 19:56:02,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:02,325 INFO L93 Difference]: Finished difference Result 567 states and 1664 transitions. [2020-02-10 19:56:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:02,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:02,327 INFO L225 Difference]: With dead ends: 567 [2020-02-10 19:56:02,327 INFO L226 Difference]: Without dead ends: 558 [2020-02-10 19:56:02,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:02,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-02-10 19:56:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 373. [2020-02-10 19:56:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:56:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1263 transitions. [2020-02-10 19:56:02,335 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1263 transitions. Word has length 22 [2020-02-10 19:56:02,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:02,336 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1263 transitions. [2020-02-10 19:56:02,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1263 transitions. [2020-02-10 19:56:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:02,336 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:02,336 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:02,337 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 19:56:02,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:02,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1082887094, now seen corresponding path program 1774 times [2020-02-10 19:56:02,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:02,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446521908] [2020-02-10 19:56:02,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:02,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 19:56:02,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446521908] [2020-02-10 19:56:02,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:02,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:02,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688366335] [2020-02-10 19:56:02,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:02,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:02,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:02,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:02,614 INFO L87 Difference]: Start difference. First operand 373 states and 1263 transitions. Second operand 9 states. [2020-02-10 19:56:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:02,727 INFO L93 Difference]: Finished difference Result 562 states and 1663 transitions. [2020-02-10 19:56:02,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:02,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:02,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:02,729 INFO L225 Difference]: With dead ends: 562 [2020-02-10 19:56:02,729 INFO L226 Difference]: Without dead ends: 548 [2020-02-10 19:56:02,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 19:56:02,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-02-10 19:56:02,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 372. [2020-02-10 19:56:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:56:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1261 transitions. [2020-02-10 19:56:02,738 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1261 transitions. Word has length 22 [2020-02-10 19:56:02,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:02,738 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1261 transitions. [2020-02-10 19:56:02,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:02,738 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1261 transitions. [2020-02-10 19:56:02,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:02,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:02,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 19:56:02,739 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 19:56:02,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:02,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1013393922, now seen corresponding path program 1775 times [2020-02-10 19:56:02,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:02,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068360865] [2020-02-10 19:56:02,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:03,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 19:56:03,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068360865] [2020-02-10 19:56:03,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:03,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:03,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543494265] [2020-02-10 19:56:03,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:03,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:03,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:03,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:03,007 INFO L87 Difference]: Start difference. First operand 372 states and 1261 transitions. Second operand 9 states. [2020-02-10 19:56:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:03,107 INFO L93 Difference]: Finished difference Result 564 states and 1670 transitions. [2020-02-10 19:56:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:03,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:03,109 INFO L225 Difference]: With dead ends: 564 [2020-02-10 19:56:03,109 INFO L226 Difference]: Without dead ends: 552 [2020-02-10 19:56:03,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-02-10 19:56:03,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 376. [2020-02-10 19:56:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:56:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1268 transitions. [2020-02-10 19:56:03,117 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1268 transitions. Word has length 22 [2020-02-10 19:56:03,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:03,117 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1268 transitions. [2020-02-10 19:56:03,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1268 transitions. [2020-02-10 19:56:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:03,118 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:03,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:03,118 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 19:56:03,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:03,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1670632416, now seen corresponding path program 1776 times [2020-02-10 19:56:03,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:03,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633442742] [2020-02-10 19:56:03,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56: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 19:56:03,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633442742] [2020-02-10 19:56:03,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:03,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:03,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999019796] [2020-02-10 19:56:03,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:03,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:03,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:03,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:03,387 INFO L87 Difference]: Start difference. First operand 376 states and 1268 transitions. Second operand 9 states. [2020-02-10 19:56:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:03,484 INFO L93 Difference]: Finished difference Result 551 states and 1651 transitions. [2020-02-10 19:56:03,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:03,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:03,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:03,486 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:56:03,486 INFO L226 Difference]: Without dead ends: 531 [2020-02-10 19:56:03,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 19:56:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-02-10 19:56:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 369. [2020-02-10 19:56:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-02-10 19:56:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1256 transitions. [2020-02-10 19:56:03,495 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1256 transitions. Word has length 22 [2020-02-10 19:56:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:03,495 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1256 transitions. [2020-02-10 19:56:03,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1256 transitions. [2020-02-10 19:56:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:03,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:03,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 19:56:03,496 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 19:56:03,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:03,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1651723624, now seen corresponding path program 1777 times [2020-02-10 19:56:03,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:03,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822712624] [2020-02-10 19:56:03,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:03,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 19:56:03,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822712624] [2020-02-10 19:56:03,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:03,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:03,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139404472] [2020-02-10 19:56:03,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:03,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:03,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:03,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:03,771 INFO L87 Difference]: Start difference. First operand 369 states and 1256 transitions. Second operand 9 states. [2020-02-10 19:56:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:03,886 INFO L93 Difference]: Finished difference Result 556 states and 1638 transitions. [2020-02-10 19:56:03,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:03,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:03,888 INFO L225 Difference]: With dead ends: 556 [2020-02-10 19:56:03,888 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:56:03,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 19:56:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:56:03,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 372. [2020-02-10 19:56:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:56:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1264 transitions. [2020-02-10 19:56:03,897 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1264 transitions. Word has length 22 [2020-02-10 19:56:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:03,897 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1264 transitions. [2020-02-10 19:56:03,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1264 transitions. [2020-02-10 19:56:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:03,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:03,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 19:56:03,898 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 19:56:03,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:03,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1197726662, now seen corresponding path program 1778 times [2020-02-10 19:56:03,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:03,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080105441] [2020-02-10 19:56:03,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:04,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 19:56:04,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080105441] [2020-02-10 19:56:04,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:04,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:04,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907625369] [2020-02-10 19:56:04,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:04,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:04,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:04,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:04,174 INFO L87 Difference]: Start difference. First operand 372 states and 1264 transitions. Second operand 9 states. [2020-02-10 19:56:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:04,280 INFO L93 Difference]: Finished difference Result 554 states and 1633 transitions. [2020-02-10 19:56:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:04,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:04,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:04,282 INFO L225 Difference]: With dead ends: 554 [2020-02-10 19:56:04,282 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:56:04,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:04,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:56:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 371. [2020-02-10 19:56:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:56:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-02-10 19:56:04,292 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-02-10 19:56:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:04,292 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-02-10 19:56:04,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-02-10 19:56:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:04,292 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:04,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 19:56:04,293 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 19:56:04,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:04,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2055498350, now seen corresponding path program 1779 times [2020-02-10 19:56:04,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:04,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498273416] [2020-02-10 19:56:04,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:04,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 19:56:04,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498273416] [2020-02-10 19:56:04,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:04,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:04,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94012022] [2020-02-10 19:56:04,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:04,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:04,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:04,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:04,571 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-02-10 19:56:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:04,675 INFO L93 Difference]: Finished difference Result 561 states and 1649 transitions. [2020-02-10 19:56:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:04,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:04,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:04,676 INFO L225 Difference]: With dead ends: 561 [2020-02-10 19:56:04,677 INFO L226 Difference]: Without dead ends: 550 [2020-02-10 19:56:04,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 19:56:04,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-02-10 19:56:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 374. [2020-02-10 19:56:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:56:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1267 transitions. [2020-02-10 19:56:04,685 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1267 transitions. Word has length 22 [2020-02-10 19:56:04,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:04,685 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1267 transitions. [2020-02-10 19:56:04,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1267 transitions. [2020-02-10 19:56:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:04,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:04,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 19:56:04,686 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 19:56:04,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:04,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1937451002, now seen corresponding path program 1780 times [2020-02-10 19:56:04,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:04,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078188671] [2020-02-10 19:56:04,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:04,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 19:56:04,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078188671] [2020-02-10 19:56:04,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:04,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:04,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325124630] [2020-02-10 19:56:04,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:04,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:04,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:04,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:04,960 INFO L87 Difference]: Start difference. First operand 374 states and 1267 transitions. Second operand 9 states. [2020-02-10 19:56:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:05,081 INFO L93 Difference]: Finished difference Result 562 states and 1648 transitions. [2020-02-10 19:56:05,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:05,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:05,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:05,083 INFO L225 Difference]: With dead ends: 562 [2020-02-10 19:56:05,083 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:56:05,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:05,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:56:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 371. [2020-02-10 19:56:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:56:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1261 transitions. [2020-02-10 19:56:05,092 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1261 transitions. Word has length 22 [2020-02-10 19:56:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:05,092 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1261 transitions. [2020-02-10 19:56:05,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1261 transitions. [2020-02-10 19:56:05,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:05,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:05,093 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:05,093 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 19:56:05,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:05,093 INFO L82 PathProgramCache]: Analyzing trace with hash -990456514, now seen corresponding path program 1781 times [2020-02-10 19:56:05,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:05,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263734306] [2020-02-10 19:56:05,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:05,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 19:56:05,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263734306] [2020-02-10 19:56:05,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:05,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:05,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802550715] [2020-02-10 19:56:05,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:05,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:05,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:05,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:05,369 INFO L87 Difference]: Start difference. First operand 371 states and 1261 transitions. Second operand 9 states. [2020-02-10 19:56:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:05,455 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-02-10 19:56:05,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:05,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:05,457 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:56:05,457 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:56:05,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:56:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 372. [2020-02-10 19:56:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:56:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1262 transitions. [2020-02-10 19:56:05,467 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1262 transitions. Word has length 22 [2020-02-10 19:56:05,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:05,467 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1262 transitions. [2020-02-10 19:56:05,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1262 transitions. [2020-02-10 19:56:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:05,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:05,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 19:56:05,468 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 19:56:05,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:05,468 INFO L82 PathProgramCache]: Analyzing trace with hash -455226712, now seen corresponding path program 1782 times [2020-02-10 19:56:05,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:05,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789194059] [2020-02-10 19:56:05,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:05,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 19:56:05,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789194059] [2020-02-10 19:56:05,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:05,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:05,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093373008] [2020-02-10 19:56:05,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:05,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:05,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:05,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:05,743 INFO L87 Difference]: Start difference. First operand 372 states and 1262 transitions. Second operand 9 states. [2020-02-10 19:56:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:05,871 INFO L93 Difference]: Finished difference Result 558 states and 1639 transitions. [2020-02-10 19:56:05,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:05,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:05,873 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:56:05,873 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:56:05,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 19:56:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:56:05,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 370. [2020-02-10 19:56:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 19:56:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1259 transitions. [2020-02-10 19:56:05,882 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1259 transitions. Word has length 22 [2020-02-10 19:56:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:05,882 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1259 transitions. [2020-02-10 19:56:05,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1259 transitions. [2020-02-10 19:56:05,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:05,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:05,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 19:56:05,883 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 19:56:05,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:05,883 INFO L82 PathProgramCache]: Analyzing trace with hash 274310454, now seen corresponding path program 1783 times [2020-02-10 19:56:05,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:05,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960489764] [2020-02-10 19:56:05,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:06,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960489764] [2020-02-10 19:56:06,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:06,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:06,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415187075] [2020-02-10 19:56:06,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:06,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:06,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:06,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:06,159 INFO L87 Difference]: Start difference. First operand 370 states and 1259 transitions. Second operand 9 states. [2020-02-10 19:56:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:06,272 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-02-10 19:56:06,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:06,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:06,274 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:56:06,274 INFO L226 Difference]: Without dead ends: 544 [2020-02-10 19:56:06,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 19:56:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-02-10 19:56:06,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 372. [2020-02-10 19:56:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:56:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-02-10 19:56:06,283 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-02-10 19:56:06,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:06,283 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-02-10 19:56:06,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-02-10 19:56:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:06,283 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:06,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:06,284 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 19:56:06,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:06,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1171206556, now seen corresponding path program 1784 times [2020-02-10 19:56:06,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:06,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147731302] [2020-02-10 19:56:06,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:06,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 19:56:06,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147731302] [2020-02-10 19:56:06,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:06,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:06,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851275689] [2020-02-10 19:56:06,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:06,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:06,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:06,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:06,562 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-02-10 19:56:06,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:06,652 INFO L93 Difference]: Finished difference Result 553 states and 1629 transitions. [2020-02-10 19:56:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:06,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:06,654 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:56:06,654 INFO L226 Difference]: Without dead ends: 543 [2020-02-10 19:56:06,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 19:56:06,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-02-10 19:56:06,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 371. [2020-02-10 19:56:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:56:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1261 transitions. [2020-02-10 19:56:06,663 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1261 transitions. Word has length 22 [2020-02-10 19:56:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:06,663 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1261 transitions. [2020-02-10 19:56:06,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1261 transitions. [2020-02-10 19:56:06,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:06,664 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:06,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 19:56:06,664 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 19:56:06,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:06,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1913872722, now seen corresponding path program 1785 times [2020-02-10 19:56:06,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:06,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206563870] [2020-02-10 19:56:06,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:06,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 19:56:06,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206563870] [2020-02-10 19:56:06,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:06,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:06,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207212543] [2020-02-10 19:56:06,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:06,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:06,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:06,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:06,928 INFO L87 Difference]: Start difference. First operand 371 states and 1261 transitions. Second operand 9 states. [2020-02-10 19:56:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:07,041 INFO L93 Difference]: Finished difference Result 558 states and 1642 transitions. [2020-02-10 19:56:07,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:07,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:07,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:07,042 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:56:07,042 INFO L226 Difference]: Without dead ends: 547 [2020-02-10 19:56:07,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 19:56:07,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-02-10 19:56:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 374. [2020-02-10 19:56:07,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-02-10 19:56:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1266 transitions. [2020-02-10 19:56:07,051 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1266 transitions. Word has length 22 [2020-02-10 19:56:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:07,051 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1266 transitions. [2020-02-10 19:56:07,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:07,052 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1266 transitions. [2020-02-10 19:56:07,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:07,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:07,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 19:56:07,052 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 19:56:07,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:07,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1599095332, now seen corresponding path program 1786 times [2020-02-10 19:56:07,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:07,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188773728] [2020-02-10 19:56:07,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:07,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 19:56:07,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188773728] [2020-02-10 19:56:07,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:07,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:07,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159020549] [2020-02-10 19:56:07,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:07,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:07,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:07,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:07,317 INFO L87 Difference]: Start difference. First operand 374 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:56:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:07,427 INFO L93 Difference]: Finished difference Result 551 states and 1635 transitions. [2020-02-10 19:56:07,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:07,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:07,429 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:56:07,429 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:56:07,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 19:56:07,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:56:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 371. [2020-02-10 19:56:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:56:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1260 transitions. [2020-02-10 19:56:07,438 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1260 transitions. Word has length 22 [2020-02-10 19:56:07,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:07,438 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1260 transitions. [2020-02-10 19:56:07,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1260 transitions. [2020-02-10 19:56:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:07,439 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:07,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 19:56:07,439 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 19:56:07,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:07,440 INFO L82 PathProgramCache]: Analyzing trace with hash -664860290, now seen corresponding path program 1787 times [2020-02-10 19:56:07,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:07,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088079177] [2020-02-10 19:56:07,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:07,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 19:56:07,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088079177] [2020-02-10 19:56:07,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:07,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:07,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649310470] [2020-02-10 19:56:07,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:07,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:07,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:07,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:07,706 INFO L87 Difference]: Start difference. First operand 371 states and 1260 transitions. Second operand 9 states. [2020-02-10 19:56:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:07,789 INFO L93 Difference]: Finished difference Result 554 states and 1631 transitions. [2020-02-10 19:56:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:07,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:07,791 INFO L225 Difference]: With dead ends: 554 [2020-02-10 19:56:07,791 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:56:07,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:07,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:56:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 372. [2020-02-10 19:56:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:56:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1261 transitions. [2020-02-10 19:56:07,801 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1261 transitions. Word has length 22 [2020-02-10 19:56:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:07,801 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1261 transitions. [2020-02-10 19:56:07,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1261 transitions. [2020-02-10 19:56:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:07,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:07,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 19:56:07,802 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 19:56:07,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:07,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1481310470, now seen corresponding path program 1788 times [2020-02-10 19:56:07,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:07,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868504265] [2020-02-10 19:56:07,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:08,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 19:56:08,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868504265] [2020-02-10 19:56:08,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:08,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:08,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566138321] [2020-02-10 19:56:08,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:08,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:08,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:08,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:08,063 INFO L87 Difference]: Start difference. First operand 372 states and 1261 transitions. Second operand 9 states. [2020-02-10 19:56:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:08,180 INFO L93 Difference]: Finished difference Result 549 states and 1630 transitions. [2020-02-10 19:56:08,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:08,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:08,181 INFO L225 Difference]: With dead ends: 549 [2020-02-10 19:56:08,181 INFO L226 Difference]: Without dead ends: 534 [2020-02-10 19:56:08,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-02-10 19:56:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 370. [2020-02-10 19:56:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 19:56:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1258 transitions. [2020-02-10 19:56:08,191 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1258 transitions. Word has length 22 [2020-02-10 19:56:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:08,191 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1258 transitions. [2020-02-10 19:56:08,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1258 transitions. [2020-02-10 19:56:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:08,192 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:08,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 19:56:08,192 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 19:56:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1353670666, now seen corresponding path program 1789 times [2020-02-10 19:56:08,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:08,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076459576] [2020-02-10 19:56:08,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:08,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 19:56:08,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076459576] [2020-02-10 19:56:08,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:08,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:08,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381739694] [2020-02-10 19:56:08,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:08,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:08,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:08,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:08,465 INFO L87 Difference]: Start difference. First operand 370 states and 1258 transitions. Second operand 9 states. [2020-02-10 19:56:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:08,582 INFO L93 Difference]: Finished difference Result 565 states and 1663 transitions. [2020-02-10 19:56:08,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:08,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:08,584 INFO L225 Difference]: With dead ends: 565 [2020-02-10 19:56:08,584 INFO L226 Difference]: Without dead ends: 554 [2020-02-10 19:56:08,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 19:56:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-02-10 19:56:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 376. [2020-02-10 19:56:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:56:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1274 transitions. [2020-02-10 19:56:08,594 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1274 transitions. Word has length 22 [2020-02-10 19:56:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:08,594 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1274 transitions. [2020-02-10 19:56:08,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1274 transitions. [2020-02-10 19:56:08,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:08,595 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:08,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 19:56:08,595 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 19:56:08,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:08,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1051652722, now seen corresponding path program 1790 times [2020-02-10 19:56:08,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:08,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064937733] [2020-02-10 19:56:08,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:08,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 19:56:08,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064937733] [2020-02-10 19:56:08,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:08,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:08,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932473494] [2020-02-10 19:56:08,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:08,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:08,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:08,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:08,869 INFO L87 Difference]: Start difference. First operand 376 states and 1274 transitions. Second operand 9 states. [2020-02-10 19:56:08,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:08,988 INFO L93 Difference]: Finished difference Result 566 states and 1662 transitions. [2020-02-10 19:56:08,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:08,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:08,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:08,990 INFO L225 Difference]: With dead ends: 566 [2020-02-10 19:56:08,990 INFO L226 Difference]: Without dead ends: 551 [2020-02-10 19:56:08,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 19:56:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-02-10 19:56:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 373. [2020-02-10 19:56:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:56:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-02-10 19:56:08,999 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-02-10 19:56:08,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:09,000 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-02-10 19:56:09,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-02-10 19:56:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:09,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:09,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 19:56:09,000 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 19:56:09,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:09,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1340858776, now seen corresponding path program 1791 times [2020-02-10 19:56:09,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:09,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309023622] [2020-02-10 19:56:09,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:09,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 19:56:09,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309023622] [2020-02-10 19:56:09,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:09,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:09,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594965542] [2020-02-10 19:56:09,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:09,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:09,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:09,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:09,274 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-02-10 19:56:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:09,381 INFO L93 Difference]: Finished difference Result 560 states and 1649 transitions. [2020-02-10 19:56:09,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:09,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:09,383 INFO L225 Difference]: With dead ends: 560 [2020-02-10 19:56:09,383 INFO L226 Difference]: Without dead ends: 549 [2020-02-10 19:56:09,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-02-10 19:56:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 376. [2020-02-10 19:56:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:56:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1271 transitions. [2020-02-10 19:56:09,392 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1271 transitions. Word has length 22 [2020-02-10 19:56:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:09,392 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1271 transitions. [2020-02-10 19:56:09,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1271 transitions. [2020-02-10 19:56:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:09,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:09,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 19:56:09,393 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 19:56:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:09,393 INFO L82 PathProgramCache]: Analyzing trace with hash 558859534, now seen corresponding path program 1792 times [2020-02-10 19:56:09,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:09,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982577596] [2020-02-10 19:56:09,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:09,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 19:56:09,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982577596] [2020-02-10 19:56:09,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:09,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:09,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217811478] [2020-02-10 19:56:09,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:09,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:09,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:09,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:09,661 INFO L87 Difference]: Start difference. First operand 376 states and 1271 transitions. Second operand 9 states. [2020-02-10 19:56:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:09,761 INFO L93 Difference]: Finished difference Result 553 states and 1642 transitions. [2020-02-10 19:56:09,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:09,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:09,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:09,763 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:56:09,763 INFO L226 Difference]: Without dead ends: 537 [2020-02-10 19:56:09,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 19:56:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-02-10 19:56:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 373. [2020-02-10 19:56:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:56:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1263 transitions. [2020-02-10 19:56:09,773 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1263 transitions. Word has length 22 [2020-02-10 19:56:09,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:09,773 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1263 transitions. [2020-02-10 19:56:09,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:09,773 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1263 transitions. [2020-02-10 19:56:09,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:09,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:09,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 19:56:09,774 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 19:56:09,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:09,774 INFO L82 PathProgramCache]: Analyzing trace with hash 476174552, now seen corresponding path program 1793 times [2020-02-10 19:56:09,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:09,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519718168] [2020-02-10 19:56:09,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:10,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 19:56:10,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519718168] [2020-02-10 19:56:10,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:10,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:10,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453650319] [2020-02-10 19:56:10,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:10,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:10,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:10,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:10,074 INFO L87 Difference]: Start difference. First operand 373 states and 1263 transitions. Second operand 9 states. [2020-02-10 19:56:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:10,173 INFO L93 Difference]: Finished difference Result 553 states and 1643 transitions. [2020-02-10 19:56:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:10,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:10,175 INFO L225 Difference]: With dead ends: 553 [2020-02-10 19:56:10,175 INFO L226 Difference]: Without dead ends: 541 [2020-02-10 19:56:10,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 19:56:10,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-02-10 19:56:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 377. [2020-02-10 19:56:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:56:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1270 transitions. [2020-02-10 19:56:10,184 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1270 transitions. Word has length 22 [2020-02-10 19:56:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:10,184 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1270 transitions. [2020-02-10 19:56:10,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:10,184 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1270 transitions. [2020-02-10 19:56:10,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:10,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:10,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 19:56:10,185 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 19:56:10,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:10,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1331481206, now seen corresponding path program 1794 times [2020-02-10 19:56:10,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:10,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224053307] [2020-02-10 19:56:10,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:10,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 19:56:10,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224053307] [2020-02-10 19:56:10,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:10,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:10,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865551505] [2020-02-10 19:56:10,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:10,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:10,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:10,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:10,466 INFO L87 Difference]: Start difference. First operand 377 states and 1270 transitions. Second operand 9 states. [2020-02-10 19:56:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:10,583 INFO L93 Difference]: Finished difference Result 540 states and 1624 transitions. [2020-02-10 19:56:10,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:10,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:10,585 INFO L225 Difference]: With dead ends: 540 [2020-02-10 19:56:10,585 INFO L226 Difference]: Without dead ends: 520 [2020-02-10 19:56:10,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 19:56:10,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-02-10 19:56:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 370. [2020-02-10 19:56:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 19:56:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1257 transitions. [2020-02-10 19:56:10,595 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1257 transitions. Word has length 22 [2020-02-10 19:56:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:10,595 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1257 transitions. [2020-02-10 19:56:10,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1257 transitions. [2020-02-10 19:56:10,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:10,595 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:10,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 19:56:10,596 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 19:56:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:10,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1821375844, now seen corresponding path program 1795 times [2020-02-10 19:56:10,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:10,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154351912] [2020-02-10 19:56:10,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:10,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 19:56:10,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154351912] [2020-02-10 19:56:10,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:10,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:10,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423397547] [2020-02-10 19:56:10,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:10,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:10,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:10,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:10,870 INFO L87 Difference]: Start difference. First operand 370 states and 1257 transitions. Second operand 9 states. [2020-02-10 19:56:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:10,947 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-02-10 19:56:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:10,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:10,948 INFO L225 Difference]: With dead ends: 555 [2020-02-10 19:56:10,949 INFO L226 Difference]: Without dead ends: 546 [2020-02-10 19:56:10,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-02-10 19:56:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 372. [2020-02-10 19:56:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:56:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1261 transitions. [2020-02-10 19:56:10,958 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1261 transitions. Word has length 22 [2020-02-10 19:56:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:10,958 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1261 transitions. [2020-02-10 19:56:10,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1261 transitions. [2020-02-10 19:56:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:10,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:10,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 19:56:10,959 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 19:56:10,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:10,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1938361650, now seen corresponding path program 1796 times [2020-02-10 19:56:10,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:10,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405645686] [2020-02-10 19:56:10,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:11,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 19:56:11,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405645686] [2020-02-10 19:56:11,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:11,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:11,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312916815] [2020-02-10 19:56:11,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:11,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:11,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:11,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:11,227 INFO L87 Difference]: Start difference. First operand 372 states and 1261 transitions. Second operand 9 states. [2020-02-10 19:56:11,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:11,337 INFO L93 Difference]: Finished difference Result 558 states and 1639 transitions. [2020-02-10 19:56:11,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:11,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:11,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:11,338 INFO L225 Difference]: With dead ends: 558 [2020-02-10 19:56:11,338 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:56:11,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:56:11,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 371. [2020-02-10 19:56:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:56:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1259 transitions. [2020-02-10 19:56:11,347 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1259 transitions. Word has length 22 [2020-02-10 19:56:11,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:11,347 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1259 transitions. [2020-02-10 19:56:11,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1259 transitions. [2020-02-10 19:56:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:11,348 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:11,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 19:56:11,348 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 19:56:11,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:11,348 INFO L82 PathProgramCache]: Analyzing trace with hash 220937990, now seen corresponding path program 1797 times [2020-02-10 19:56:11,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:11,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396377206] [2020-02-10 19:56:11,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:11,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 19:56:11,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396377206] [2020-02-10 19:56:11,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:11,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:11,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59061759] [2020-02-10 19:56:11,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:11,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:11,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:11,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:11,611 INFO L87 Difference]: Start difference. First operand 371 states and 1259 transitions. Second operand 9 states. [2020-02-10 19:56:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:11,704 INFO L93 Difference]: Finished difference Result 554 states and 1632 transitions. [2020-02-10 19:56:11,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:11,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:11,705 INFO L225 Difference]: With dead ends: 554 [2020-02-10 19:56:11,705 INFO L226 Difference]: Without dead ends: 545 [2020-02-10 19:56:11,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 19:56:11,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-02-10 19:56:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 372. [2020-02-10 19:56:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-02-10 19:56:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1260 transitions. [2020-02-10 19:56:11,714 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1260 transitions. Word has length 22 [2020-02-10 19:56:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:11,714 INFO L479 AbstractCegarLoop]: Abstraction has 372 states and 1260 transitions. [2020-02-10 19:56:11,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1260 transitions. [2020-02-10 19:56:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:11,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:11,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 19:56:11,715 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 19:56:11,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:11,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1927858546, now seen corresponding path program 1798 times [2020-02-10 19:56:11,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:11,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626014136] [2020-02-10 19:56:11,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56: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 19:56:11,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626014136] [2020-02-10 19:56:11,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:11,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:11,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533498114] [2020-02-10 19:56:11,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:11,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:11,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:11,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:11,973 INFO L87 Difference]: Start difference. First operand 372 states and 1260 transitions. Second operand 9 states. [2020-02-10 19:56:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:12,083 INFO L93 Difference]: Finished difference Result 549 states and 1631 transitions. [2020-02-10 19:56:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:12,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:12,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:12,085 INFO L225 Difference]: With dead ends: 549 [2020-02-10 19:56:12,085 INFO L226 Difference]: Without dead ends: 535 [2020-02-10 19:56:12,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-02-10 19:56:12,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 371. [2020-02-10 19:56:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-02-10 19:56:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1258 transitions. [2020-02-10 19:56:12,095 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1258 transitions. Word has length 22 [2020-02-10 19:56:12,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:12,095 INFO L479 AbstractCegarLoop]: Abstraction has 371 states and 1258 transitions. [2020-02-10 19:56:12,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1258 transitions. [2020-02-10 19:56:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:12,095 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:12,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 19:56:12,096 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 19:56:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash 168422470, now seen corresponding path program 1799 times [2020-02-10 19:56:12,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:12,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38852190] [2020-02-10 19:56:12,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:12,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 19:56:12,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38852190] [2020-02-10 19:56:12,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:12,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:12,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988296040] [2020-02-10 19:56:12,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:12,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:12,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:12,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:12,367 INFO L87 Difference]: Start difference. First operand 371 states and 1258 transitions. Second operand 9 states. [2020-02-10 19:56:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:12,464 INFO L93 Difference]: Finished difference Result 551 states and 1638 transitions. [2020-02-10 19:56:12,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:12,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:12,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:12,466 INFO L225 Difference]: With dead ends: 551 [2020-02-10 19:56:12,466 INFO L226 Difference]: Without dead ends: 539 [2020-02-10 19:56:12,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 19:56:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-02-10 19:56:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 375. [2020-02-10 19:56:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:56:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1265 transitions. [2020-02-10 19:56:12,476 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1265 transitions. Word has length 22 [2020-02-10 19:56:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:12,476 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1265 transitions. [2020-02-10 19:56:12,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1265 transitions. [2020-02-10 19:56:12,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:12,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:12,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 19:56:12,477 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 19:56:12,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:12,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1779363428, now seen corresponding path program 1800 times [2020-02-10 19:56:12,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:12,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020422827] [2020-02-10 19:56:12,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:12,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 19:56:12,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020422827] [2020-02-10 19:56:12,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:12,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:12,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470625759] [2020-02-10 19:56:12,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:12,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:12,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:12,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:12,748 INFO L87 Difference]: Start difference. First operand 375 states and 1265 transitions. Second operand 9 states. [2020-02-10 19:56:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:12,843 INFO L93 Difference]: Finished difference Result 538 states and 1619 transitions. [2020-02-10 19:56:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:12,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:12,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:12,845 INFO L225 Difference]: With dead ends: 538 [2020-02-10 19:56:12,845 INFO L226 Difference]: Without dead ends: 517 [2020-02-10 19:56:12,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-02-10 19:56:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 367. [2020-02-10 19:56:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2020-02-10 19:56:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1252 transitions. [2020-02-10 19:56:12,854 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1252 transitions. Word has length 22 [2020-02-10 19:56:12,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:12,854 INFO L479 AbstractCegarLoop]: Abstraction has 367 states and 1252 transitions. [2020-02-10 19:56:12,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1252 transitions. [2020-02-10 19:56:12,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:12,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:12,855 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:12,855 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 19:56:12,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:12,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1290682328, now seen corresponding path program 1801 times [2020-02-10 19:56:12,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:12,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757022069] [2020-02-10 19:56:12,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:13,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757022069] [2020-02-10 19:56:13,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:13,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:13,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602432042] [2020-02-10 19:56:13,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:13,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:13,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:13,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:13,128 INFO L87 Difference]: Start difference. First operand 367 states and 1252 transitions. Second operand 9 states. [2020-02-10 19:56:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:13,214 INFO L93 Difference]: Finished difference Result 618 states and 1820 transitions. [2020-02-10 19:56:13,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:13,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:13,216 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:56:13,216 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:56:13,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 19:56:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:56:13,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 380. [2020-02-10 19:56:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:56:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1297 transitions. [2020-02-10 19:56:13,226 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1297 transitions. Word has length 22 [2020-02-10 19:56:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:13,226 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1297 transitions. [2020-02-10 19:56:13,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1297 transitions. [2020-02-10 19:56:13,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:13,227 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:13,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 19:56:13,227 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 19:56:13,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:13,227 INFO L82 PathProgramCache]: Analyzing trace with hash 299583558, now seen corresponding path program 1802 times [2020-02-10 19:56:13,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:13,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050836307] [2020-02-10 19:56:13,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:13,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 19:56:13,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050836307] [2020-02-10 19:56:13,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:13,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:13,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430053452] [2020-02-10 19:56:13,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:13,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:13,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:13,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:13,499 INFO L87 Difference]: Start difference. First operand 380 states and 1297 transitions. Second operand 9 states. [2020-02-10 19:56:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:13,600 INFO L93 Difference]: Finished difference Result 613 states and 1807 transitions. [2020-02-10 19:56:13,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:13,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:13,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:13,602 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:56:13,602 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:56:13,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:56:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 376. [2020-02-10 19:56:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:56:13,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1288 transitions. [2020-02-10 19:56:13,611 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1288 transitions. Word has length 22 [2020-02-10 19:56:13,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:13,611 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1288 transitions. [2020-02-10 19:56:13,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1288 transitions. [2020-02-10 19:56:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:13,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:13,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 19:56:13,612 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 19:56:13,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1189770156, now seen corresponding path program 1803 times [2020-02-10 19:56:13,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:13,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561205949] [2020-02-10 19:56:13,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:13,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 19:56:13,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561205949] [2020-02-10 19:56:13,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:13,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:13,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61615951] [2020-02-10 19:56:13,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:13,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:13,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:13,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:13,888 INFO L87 Difference]: Start difference. First operand 376 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:56:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:13,962 INFO L93 Difference]: Finished difference Result 616 states and 1812 transitions. [2020-02-10 19:56:13,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:13,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:13,964 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:56:13,964 INFO L226 Difference]: Without dead ends: 600 [2020-02-10 19:56:13,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:13,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-02-10 19:56:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 379. [2020-02-10 19:56:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:56:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1292 transitions. [2020-02-10 19:56:13,974 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1292 transitions. Word has length 22 [2020-02-10 19:56:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:13,974 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1292 transitions. [2020-02-10 19:56:13,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1292 transitions. [2020-02-10 19:56:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:13,975 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:13,975 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:13,975 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 19:56:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1063133782, now seen corresponding path program 1804 times [2020-02-10 19:56:13,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:13,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240236718] [2020-02-10 19:56:13,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:14,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 19:56:14,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240236718] [2020-02-10 19:56:14,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:14,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:14,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901626876] [2020-02-10 19:56:14,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:14,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:14,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:14,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:14,246 INFO L87 Difference]: Start difference. First operand 379 states and 1292 transitions. Second operand 9 states. [2020-02-10 19:56:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:14,378 INFO L93 Difference]: Finished difference Result 610 states and 1798 transitions. [2020-02-10 19:56:14,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:14,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:14,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:14,380 INFO L225 Difference]: With dead ends: 610 [2020-02-10 19:56:14,380 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 19:56:14,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 19:56:14,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 19:56:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 376. [2020-02-10 19:56:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:56:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1285 transitions. [2020-02-10 19:56:14,390 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1285 transitions. Word has length 22 [2020-02-10 19:56:14,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:14,390 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1285 transitions. [2020-02-10 19:56:14,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1285 transitions. [2020-02-10 19:56:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:14,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:14,391 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:14,391 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 19:56:14,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:14,391 INFO L82 PathProgramCache]: Analyzing trace with hash 816815346, now seen corresponding path program 1805 times [2020-02-10 19:56:14,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:14,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417432729] [2020-02-10 19:56:14,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:14,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 19:56:14,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417432729] [2020-02-10 19:56:14,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:14,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:14,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590023389] [2020-02-10 19:56:14,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:14,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:14,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:14,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:14,658 INFO L87 Difference]: Start difference. First operand 376 states and 1285 transitions. Second operand 9 states. [2020-02-10 19:56:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:14,766 INFO L93 Difference]: Finished difference Result 605 states and 1789 transitions. [2020-02-10 19:56:14,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:14,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:14,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:14,768 INFO L225 Difference]: With dead ends: 605 [2020-02-10 19:56:14,768 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:56:14,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 19:56:14,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:56:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 378. [2020-02-10 19:56:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:56:14,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1288 transitions. [2020-02-10 19:56:14,777 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1288 transitions. Word has length 22 [2020-02-10 19:56:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:14,777 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1288 transitions. [2020-02-10 19:56:14,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1288 transitions. [2020-02-10 19:56:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:14,778 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:14,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 19:56:14,778 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 19:56:14,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:14,778 INFO L82 PathProgramCache]: Analyzing trace with hash -2136219162, now seen corresponding path program 1806 times [2020-02-10 19:56:14,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:14,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269345599] [2020-02-10 19:56:14,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:15,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 19:56:15,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269345599] [2020-02-10 19:56:15,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:15,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:15,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219143728] [2020-02-10 19:56:15,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:15,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:15,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:15,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:15,051 INFO L87 Difference]: Start difference. First operand 378 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:56:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:15,154 INFO L93 Difference]: Finished difference Result 604 states and 1785 transitions. [2020-02-10 19:56:15,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:15,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:15,156 INFO L225 Difference]: With dead ends: 604 [2020-02-10 19:56:15,156 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 19:56:15,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 19:56:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 19:56:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 373. [2020-02-10 19:56:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:56:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1278 transitions. [2020-02-10 19:56:15,165 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1278 transitions. Word has length 22 [2020-02-10 19:56:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:15,165 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1278 transitions. [2020-02-10 19:56:15,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1278 transitions. [2020-02-10 19:56:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:15,165 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:15,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 19:56:15,166 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 19:56:15,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:15,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1244232028, now seen corresponding path program 1807 times [2020-02-10 19:56:15,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:15,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196730309] [2020-02-10 19:56:15,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:15,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 19:56:15,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196730309] [2020-02-10 19:56:15,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:15,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:15,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069362854] [2020-02-10 19:56:15,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:15,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:15,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:15,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:15,443 INFO L87 Difference]: Start difference. First operand 373 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:56:15,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:15,526 INFO L93 Difference]: Finished difference Result 624 states and 1834 transitions. [2020-02-10 19:56:15,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:15,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:15,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:15,528 INFO L225 Difference]: With dead ends: 624 [2020-02-10 19:56:15,528 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 19:56:15,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 19:56:15,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 19:56:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 381. [2020-02-10 19:56:15,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:56:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1298 transitions. [2020-02-10 19:56:15,538 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1298 transitions. Word has length 22 [2020-02-10 19:56:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:15,539 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1298 transitions. [2020-02-10 19:56:15,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1298 transitions. [2020-02-10 19:56:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:15,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:15,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 19:56:15,539 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 19:56:15,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:15,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1460469382, now seen corresponding path program 1808 times [2020-02-10 19:56:15,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:15,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903230837] [2020-02-10 19:56:15,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:15,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 19:56:15,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903230837] [2020-02-10 19:56:15,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:15,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:15,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523519638] [2020-02-10 19:56:15,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:15,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:15,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:15,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:15,808 INFO L87 Difference]: Start difference. First operand 381 states and 1298 transitions. Second operand 9 states. [2020-02-10 19:56:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:15,916 INFO L93 Difference]: Finished difference Result 619 states and 1821 transitions. [2020-02-10 19:56:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:15,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:15,918 INFO L225 Difference]: With dead ends: 619 [2020-02-10 19:56:15,918 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 19:56: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 19:56:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 19:56:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 377. [2020-02-10 19:56:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:56:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1288 transitions. [2020-02-10 19:56:15,928 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1288 transitions. Word has length 22 [2020-02-10 19:56:15,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:15,928 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1288 transitions. [2020-02-10 19:56:15,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:15,928 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1288 transitions. [2020-02-10 19:56:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:15,929 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:15,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 19:56:15,929 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 19:56:15,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:15,929 INFO L82 PathProgramCache]: Analyzing trace with hash -104444724, now seen corresponding path program 1809 times [2020-02-10 19:56:15,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:15,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448989001] [2020-02-10 19:56:15,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:16,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 19:56:16,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448989001] [2020-02-10 19:56:16,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:16,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:16,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569412914] [2020-02-10 19:56:16,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:16,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:16,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:16,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:16,210 INFO L87 Difference]: Start difference. First operand 377 states and 1288 transitions. Second operand 9 states. [2020-02-10 19:56:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:16,287 INFO L93 Difference]: Finished difference Result 626 states and 1835 transitions. [2020-02-10 19:56:16,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:16,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:16,289 INFO L225 Difference]: With dead ends: 626 [2020-02-10 19:56:16,289 INFO L226 Difference]: Without dead ends: 610 [2020-02-10 19:56:16,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 19:56:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-02-10 19:56:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 382. [2020-02-10 19:56:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:56:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1296 transitions. [2020-02-10 19:56:16,298 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1296 transitions. Word has length 22 [2020-02-10 19:56:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:16,298 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1296 transitions. [2020-02-10 19:56:16,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:16,298 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1296 transitions. [2020-02-10 19:56:16,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:16,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:16,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 19:56:16,299 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 19:56:16,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1805772626, now seen corresponding path program 1810 times [2020-02-10 19:56:16,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:16,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940829330] [2020-02-10 19:56:16,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:16,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 19:56:16,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940829330] [2020-02-10 19:56:16,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:16,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:16,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896086549] [2020-02-10 19:56:16,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:16,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:16,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:16,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:16,574 INFO L87 Difference]: Start difference. First operand 382 states and 1296 transitions. Second operand 9 states. [2020-02-10 19:56:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:16,692 INFO L93 Difference]: Finished difference Result 622 states and 1823 transitions. [2020-02-10 19:56:16,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:16,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:16,694 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:56:16,694 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 19:56:16,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 19:56:16,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 19:56:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 377. [2020-02-10 19:56:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:56:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-02-10 19:56:16,702 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-02-10 19:56:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:16,703 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-02-10 19:56:16,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:16,703 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-02-10 19:56:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:16,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:16,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 19:56:16,703 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 19:56:16,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:16,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1319741138, now seen corresponding path program 1811 times [2020-02-10 19:56:16,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:16,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21568619] [2020-02-10 19:56:16,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:16,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21568619] [2020-02-10 19:56:16,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:16,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:16,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112424397] [2020-02-10 19:56:16,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:16,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:16,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:16,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:16,979 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-02-10 19:56:17,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:17,089 INFO L93 Difference]: Finished difference Result 614 states and 1808 transitions. [2020-02-10 19:56:17,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:17,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:17,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:17,091 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:56:17,091 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 19:56:17,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 19:56:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 380. [2020-02-10 19:56:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:56:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1289 transitions. [2020-02-10 19:56:17,100 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1289 transitions. Word has length 22 [2020-02-10 19:56:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:17,100 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1289 transitions. [2020-02-10 19:56:17,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1289 transitions. [2020-02-10 19:56:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:17,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:17,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 19:56:17,101 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 19:56:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:17,101 INFO L82 PathProgramCache]: Analyzing trace with hash -446000458, now seen corresponding path program 1812 times [2020-02-10 19:56:17,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:17,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937621109] [2020-02-10 19:56:17,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56: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 19:56:17,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937621109] [2020-02-10 19:56:17,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:17,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:17,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30413967] [2020-02-10 19:56:17,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:17,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:17,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:17,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:17,378 INFO L87 Difference]: Start difference. First operand 380 states and 1289 transitions. Second operand 9 states. [2020-02-10 19:56:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:17,495 INFO L93 Difference]: Finished difference Result 615 states and 1807 transitions. [2020-02-10 19:56:17,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:17,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:17,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:17,497 INFO L225 Difference]: With dead ends: 615 [2020-02-10 19:56:17,497 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:56:17,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 19:56:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:56:17,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 373. [2020-02-10 19:56:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:56:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1275 transitions. [2020-02-10 19:56:17,506 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1275 transitions. Word has length 22 [2020-02-10 19:56:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:17,506 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1275 transitions. [2020-02-10 19:56:17,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1275 transitions. [2020-02-10 19:56:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:17,507 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:17,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 19:56:17,507 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 19:56:17,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:17,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1788251988, now seen corresponding path program 1813 times [2020-02-10 19:56:17,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:17,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440601997] [2020-02-10 19:56:17,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:17,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440601997] [2020-02-10 19:56:17,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:17,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:17,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928344070] [2020-02-10 19:56:17,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:17,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:17,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:17,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:17,781 INFO L87 Difference]: Start difference. First operand 373 states and 1275 transitions. Second operand 9 states. [2020-02-10 19:56:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:17,868 INFO L93 Difference]: Finished difference Result 618 states and 1814 transitions. [2020-02-10 19:56:17,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:17,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:17,870 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:56:17,870 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:56:17,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:17,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:56:17,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 379. [2020-02-10 19:56:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:56:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1289 transitions. [2020-02-10 19:56:17,880 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1289 transitions. Word has length 22 [2020-02-10 19:56:17,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:17,880 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1289 transitions. [2020-02-10 19:56:17,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:17,880 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1289 transitions. [2020-02-10 19:56:17,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:17,881 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:17,881 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:17,881 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 19:56:17,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:17,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1661615614, now seen corresponding path program 1814 times [2020-02-10 19:56:17,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:17,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989680407] [2020-02-10 19:56:17,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:18,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 19:56:18,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989680407] [2020-02-10 19:56:18,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:18,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:18,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537702879] [2020-02-10 19:56:18,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:18,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:18,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:18,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:18,147 INFO L87 Difference]: Start difference. First operand 379 states and 1289 transitions. Second operand 9 states. [2020-02-10 19:56:18,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:18,255 INFO L93 Difference]: Finished difference Result 612 states and 1800 transitions. [2020-02-10 19:56:18,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:18,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:18,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:18,256 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:56:18,257 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:56:18,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 19:56:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:56:18,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 376. [2020-02-10 19:56:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:56:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1282 transitions. [2020-02-10 19:56:18,265 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1282 transitions. Word has length 22 [2020-02-10 19:56:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:18,266 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1282 transitions. [2020-02-10 19:56:18,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1282 transitions. [2020-02-10 19:56:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:18,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:18,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 19:56:18,266 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 19:56:18,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:18,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1431004152, now seen corresponding path program 1815 times [2020-02-10 19:56:18,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:18,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650625407] [2020-02-10 19:56:18,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:18,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 19:56:18,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650625407] [2020-02-10 19:56:18,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:18,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:18,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624977696] [2020-02-10 19:56:18,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:18,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:18,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:18,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:18,556 INFO L87 Difference]: Start difference. First operand 376 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:56:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:18,641 INFO L93 Difference]: Finished difference Result 622 states and 1821 transitions. [2020-02-10 19:56:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:18,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:18,642 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:56:18,642 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:56:18,643 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:18,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:56:18,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 381. [2020-02-10 19:56:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:56:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1290 transitions. [2020-02-10 19:56:18,652 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1290 transitions. Word has length 22 [2020-02-10 19:56:18,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:18,652 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1290 transitions. [2020-02-10 19:56:18,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1290 transitions. [2020-02-10 19:56:18,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:18,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:18,653 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:18,653 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 19:56:18,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:18,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1322504706, now seen corresponding path program 1816 times [2020-02-10 19:56:18,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:18,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59579569] [2020-02-10 19:56:18,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:18,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 19:56:18,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59579569] [2020-02-10 19:56:18,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:18,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:18,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085703787] [2020-02-10 19:56:18,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:18,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:18,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:18,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:18,925 INFO L87 Difference]: Start difference. First operand 381 states and 1290 transitions. Second operand 9 states. [2020-02-10 19:56:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:19,033 INFO L93 Difference]: Finished difference Result 618 states and 1809 transitions. [2020-02-10 19:56:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:19,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:19,035 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:56:19,035 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 19:56:19,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 19:56:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 19:56:19,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 376. [2020-02-10 19:56:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:56:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1279 transitions. [2020-02-10 19:56:19,045 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1279 transitions. Word has length 22 [2020-02-10 19:56:19,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:19,045 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1279 transitions. [2020-02-10 19:56:19,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:19,045 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1279 transitions. [2020-02-10 19:56:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:19,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:19,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 19:56:19,046 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 19:56:19,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:19,046 INFO L82 PathProgramCache]: Analyzing trace with hash -588530234, now seen corresponding path program 1817 times [2020-02-10 19:56:19,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:19,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58343971] [2020-02-10 19:56:19,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:19,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 19:56:19,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58343971] [2020-02-10 19:56:19,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:19,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:19,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539211746] [2020-02-10 19:56:19,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:19,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:19,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:19,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:19,315 INFO L87 Difference]: Start difference. First operand 376 states and 1279 transitions. Second operand 9 states. [2020-02-10 19:56:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:19,431 INFO L93 Difference]: Finished difference Result 607 states and 1788 transitions. [2020-02-10 19:56:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:19,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:19,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:19,433 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:56:19,433 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 19:56:19,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 19:56:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 378. [2020-02-10 19:56:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:56:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1282 transitions. [2020-02-10 19:56:19,442 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1282 transitions. Word has length 22 [2020-02-10 19:56:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:19,442 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1282 transitions. [2020-02-10 19:56:19,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1282 transitions. [2020-02-10 19:56:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:19,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:19,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:19,443 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 19:56:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:19,443 INFO L82 PathProgramCache]: Analyzing trace with hash -761777926, now seen corresponding path program 1818 times [2020-02-10 19:56:19,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:19,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376166131] [2020-02-10 19:56:19,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:19,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 19:56:19,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376166131] [2020-02-10 19:56:19,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:19,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:19,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550007151] [2020-02-10 19:56:19,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:19,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:19,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:19,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:19,712 INFO L87 Difference]: Start difference. First operand 378 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:56:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:19,833 INFO L93 Difference]: Finished difference Result 609 states and 1790 transitions. [2020-02-10 19:56:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:19,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:19,835 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:56:19,835 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:56:19,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 19:56:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:56:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 373. [2020-02-10 19:56:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:56:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 19:56:19,844 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 19:56:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:19,844 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 19:56:19,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:19,844 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 19:56:19,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:19,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:19,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 19:56:19,845 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 19:56:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:19,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1312425102, now seen corresponding path program 1819 times [2020-02-10 19:56:19,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:19,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298311195] [2020-02-10 19:56:19,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:20,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 19:56:20,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298311195] [2020-02-10 19:56:20,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:20,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:20,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909135351] [2020-02-10 19:56:20,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:20,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:20,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:20,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:20,115 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 19:56:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:20,217 INFO L93 Difference]: Finished difference Result 598 states and 1772 transitions. [2020-02-10 19:56:20,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:20,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:20,219 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:56:20,219 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:56:20,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 19:56:20,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:56:20,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 377. [2020-02-10 19:56:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:56:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1282 transitions. [2020-02-10 19:56:20,229 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1282 transitions. Word has length 22 [2020-02-10 19:56:20,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:20,229 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1282 transitions. [2020-02-10 19:56:20,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1282 transitions. [2020-02-10 19:56:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:20,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:20,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 19:56:20,230 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 19:56:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:20,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1640609406, now seen corresponding path program 1820 times [2020-02-10 19:56:20,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:20,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787864497] [2020-02-10 19:56:20,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:20,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 19:56:20,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787864497] [2020-02-10 19:56:20,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:20,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:20,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659692618] [2020-02-10 19:56:20,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:20,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:20,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:20,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:20,502 INFO L87 Difference]: Start difference. First operand 377 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:56:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:20,602 INFO L93 Difference]: Finished difference Result 597 states and 1768 transitions. [2020-02-10 19:56:20,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:20,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:20,604 INFO L225 Difference]: With dead ends: 597 [2020-02-10 19:56:20,604 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:56:20,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 19:56:20,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:56:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 375. [2020-02-10 19:56:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:56:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1277 transitions. [2020-02-10 19:56:20,613 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1277 transitions. Word has length 22 [2020-02-10 19:56:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:20,613 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1277 transitions. [2020-02-10 19:56:20,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1277 transitions. [2020-02-10 19:56:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:20,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:20,613 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:20,613 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 19:56:20,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:20,614 INFO L82 PathProgramCache]: Analyzing trace with hash 236713946, now seen corresponding path program 1821 times [2020-02-10 19:56:20,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:20,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299506264] [2020-02-10 19:56:20,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:20,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 19:56:20,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299506264] [2020-02-10 19:56:20,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:20,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:20,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910039422] [2020-02-10 19:56:20,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:20,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:20,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:20,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:20,886 INFO L87 Difference]: Start difference. First operand 375 states and 1277 transitions. Second operand 9 states. [2020-02-10 19:56:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:20,985 INFO L93 Difference]: Finished difference Result 601 states and 1777 transitions. [2020-02-10 19:56:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:20,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:20,987 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:56:20,987 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:56:20,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:56:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 378. [2020-02-10 19:56:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:56:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1282 transitions. [2020-02-10 19:56:20,996 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1282 transitions. Word has length 22 [2020-02-10 19:56:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:20,996 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1282 transitions. [2020-02-10 19:56:20,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1282 transitions. [2020-02-10 19:56:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:20,997 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:20,997 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:20,997 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 19:56:20,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:20,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1591684214, now seen corresponding path program 1822 times [2020-02-10 19:56:20,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:20,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438796623] [2020-02-10 19:56:20,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:21,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 19:56:21,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438796623] [2020-02-10 19:56:21,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:21,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:21,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159236747] [2020-02-10 19:56:21,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:21,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:21,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:21,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:21,272 INFO L87 Difference]: Start difference. First operand 378 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:56:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:21,382 INFO L93 Difference]: Finished difference Result 602 states and 1776 transitions. [2020-02-10 19:56:21,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:21,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:21,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:21,384 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:56:21,384 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:56:21,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 19:56:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:56:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 375. [2020-02-10 19:56:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:56:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1275 transitions. [2020-02-10 19:56:21,392 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1275 transitions. Word has length 22 [2020-02-10 19:56:21,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:21,393 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1275 transitions. [2020-02-10 19:56:21,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1275 transitions. [2020-02-10 19:56:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:21,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:21,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 19:56:21,393 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 19:56:21,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:21,394 INFO L82 PathProgramCache]: Analyzing trace with hash 505561354, now seen corresponding path program 1823 times [2020-02-10 19:56:21,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:21,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482736736] [2020-02-10 19:56:21,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:21,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 19:56:21,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482736736] [2020-02-10 19:56:21,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:21,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:21,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094401155] [2020-02-10 19:56:21,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:21,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:21,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:21,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:21,663 INFO L87 Difference]: Start difference. First operand 375 states and 1275 transitions. Second operand 9 states. [2020-02-10 19:56:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:21,779 INFO L93 Difference]: Finished difference Result 598 states and 1768 transitions. [2020-02-10 19:56:21,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:21,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:21,780 INFO L225 Difference]: With dead ends: 598 [2020-02-10 19:56:21,781 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:56:21,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 19:56:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:56:21,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 377. [2020-02-10 19:56:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:56:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1278 transitions. [2020-02-10 19:56:21,790 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1278 transitions. Word has length 22 [2020-02-10 19:56:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:21,790 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1278 transitions. [2020-02-10 19:56:21,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1278 transitions. [2020-02-10 19:56:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:21,791 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:21,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 19:56:21,791 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 19:56:21,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:21,791 INFO L82 PathProgramCache]: Analyzing trace with hash 332313662, now seen corresponding path program 1824 times [2020-02-10 19:56:21,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:21,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310578283] [2020-02-10 19:56:21,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:22,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 19:56:22,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310578283] [2020-02-10 19:56:22,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:22,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:22,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389810239] [2020-02-10 19:56:22,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:22,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:22,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:22,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:22,063 INFO L87 Difference]: Start difference. First operand 377 states and 1278 transitions. Second operand 9 states. [2020-02-10 19:56:22,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:22,172 INFO L93 Difference]: Finished difference Result 600 states and 1770 transitions. [2020-02-10 19:56:22,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:22,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:22,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:22,174 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:56:22,174 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 19:56:22,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 19:56:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 19:56:22,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 370. [2020-02-10 19:56:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 19:56:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1265 transitions. [2020-02-10 19:56:22,184 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1265 transitions. Word has length 22 [2020-02-10 19:56:22,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:22,184 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1265 transitions. [2020-02-10 19:56:22,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:22,184 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1265 transitions. [2020-02-10 19:56:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:22,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:22,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 19:56:22,185 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 19:56:22,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:22,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1502837946, now seen corresponding path program 1825 times [2020-02-10 19:56:22,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:22,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877659671] [2020-02-10 19:56:22,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:22,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 19:56:22,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877659671] [2020-02-10 19:56:22,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:22,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:22,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657188358] [2020-02-10 19:56:22,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:22,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:22,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:22,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:22,442 INFO L87 Difference]: Start difference. First operand 370 states and 1265 transitions. Second operand 9 states. [2020-02-10 19:56:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:22,536 INFO L93 Difference]: Finished difference Result 614 states and 1799 transitions. [2020-02-10 19:56:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:22,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:22,538 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:56:22,538 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:56:22,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:56:22,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 380. [2020-02-10 19:56:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:56:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1294 transitions. [2020-02-10 19:56:22,548 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1294 transitions. Word has length 22 [2020-02-10 19:56:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:22,548 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1294 transitions. [2020-02-10 19:56:22,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1294 transitions. [2020-02-10 19:56:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:22,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:22,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 19:56:22,549 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 19:56:22,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:22,549 INFO L82 PathProgramCache]: Analyzing trace with hash 87427940, now seen corresponding path program 1826 times [2020-02-10 19:56:22,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:22,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585284353] [2020-02-10 19:56:22,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:22,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 19:56:22,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585284353] [2020-02-10 19:56:22,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:22,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:22,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381901621] [2020-02-10 19:56:22,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:22,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:22,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:22,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:22,799 INFO L87 Difference]: Start difference. First operand 380 states and 1294 transitions. Second operand 9 states. [2020-02-10 19:56:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:22,907 INFO L93 Difference]: Finished difference Result 609 states and 1786 transitions. [2020-02-10 19:56:22,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:22,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:22,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:22,909 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:56:22,909 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:56:22,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:22,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:56:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 376. [2020-02-10 19:56:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:56:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1285 transitions. [2020-02-10 19:56:22,919 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1285 transitions. Word has length 22 [2020-02-10 19:56:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:22,919 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1285 transitions. [2020-02-10 19:56:22,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1285 transitions. [2020-02-10 19:56:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:22,920 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:22,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:22,920 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 19:56:22,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:22,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1401925774, now seen corresponding path program 1827 times [2020-02-10 19:56:22,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:22,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158950021] [2020-02-10 19:56:22,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:23,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 19:56:23,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158950021] [2020-02-10 19:56:23,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:23,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:23,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361034655] [2020-02-10 19:56:23,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:23,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:23,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:23,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:23,170 INFO L87 Difference]: Start difference. First operand 376 states and 1285 transitions. Second operand 9 states. [2020-02-10 19:56:23,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:23,250 INFO L93 Difference]: Finished difference Result 612 states and 1791 transitions. [2020-02-10 19:56:23,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:23,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:23,252 INFO L225 Difference]: With dead ends: 612 [2020-02-10 19:56:23,252 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:56:23,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:56:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 379. [2020-02-10 19:56:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:56:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1289 transitions. [2020-02-10 19:56:23,261 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1289 transitions. Word has length 22 [2020-02-10 19:56:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:23,261 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1289 transitions. [2020-02-10 19:56:23,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1289 transitions. [2020-02-10 19:56:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:23,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:23,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 19:56:23,262 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 19:56:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:23,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1275289400, now seen corresponding path program 1828 times [2020-02-10 19:56:23,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:23,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337255915] [2020-02-10 19:56:23,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:23,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 19:56:23,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337255915] [2020-02-10 19:56:23,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:23,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:23,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119398610] [2020-02-10 19:56:23,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:23,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:23,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:23,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:23,505 INFO L87 Difference]: Start difference. First operand 379 states and 1289 transitions. Second operand 9 states. [2020-02-10 19:56:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:23,608 INFO L93 Difference]: Finished difference Result 606 states and 1777 transitions. [2020-02-10 19:56:23,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:23,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:23,610 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:56:23,610 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:56:23,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:56:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 376. [2020-02-10 19:56:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:56:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1282 transitions. [2020-02-10 19:56:23,620 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1282 transitions. Word has length 22 [2020-02-10 19:56:23,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:23,620 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1282 transitions. [2020-02-10 19:56:23,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:23,620 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1282 transitions. [2020-02-10 19:56:23,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:23,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:23,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 19:56:23,621 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 19:56:23,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:23,621 INFO L82 PathProgramCache]: Analyzing trace with hash 604659728, now seen corresponding path program 1829 times [2020-02-10 19:56:23,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:23,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618064979] [2020-02-10 19:56:23,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:23,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 19:56:23,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618064979] [2020-02-10 19:56:23,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:23,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:23,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906502332] [2020-02-10 19:56:23,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:23,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:23,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:23,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:23,882 INFO L87 Difference]: Start difference. First operand 376 states and 1282 transitions. Second operand 9 states. [2020-02-10 19:56:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:23,986 INFO L93 Difference]: Finished difference Result 601 states and 1768 transitions. [2020-02-10 19:56:23,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:23,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:23,988 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:56:23,988 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:56:23,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 19:56:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:56:23,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 378. [2020-02-10 19:56:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:56:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1285 transitions. [2020-02-10 19:56:23,998 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1285 transitions. Word has length 22 [2020-02-10 19:56:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:23,998 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1285 transitions. [2020-02-10 19:56:23,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1285 transitions. [2020-02-10 19:56:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:23,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:23,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 19:56:23,999 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 19:56:23,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:23,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1946592516, now seen corresponding path program 1830 times [2020-02-10 19:56:23,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:24,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137513195] [2020-02-10 19:56:24,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:24,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 19:56:24,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137513195] [2020-02-10 19:56:24,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:24,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:24,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675433826] [2020-02-10 19:56:24,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:24,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:24,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:24,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:24,255 INFO L87 Difference]: Start difference. First operand 378 states and 1285 transitions. Second operand 9 states. [2020-02-10 19:56:24,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:24,353 INFO L93 Difference]: Finished difference Result 600 states and 1764 transitions. [2020-02-10 19:56:24,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:24,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:24,355 INFO L225 Difference]: With dead ends: 600 [2020-02-10 19:56:24,355 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:56:24,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 19:56:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:56:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 373. [2020-02-10 19:56:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:56:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1275 transitions. [2020-02-10 19:56:24,365 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1275 transitions. Word has length 22 [2020-02-10 19:56:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:24,365 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1275 transitions. [2020-02-10 19:56:24,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1275 transitions. [2020-02-10 19:56:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:24,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:24,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 19:56:24,366 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 19:56:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash 609590684, now seen corresponding path program 1831 times [2020-02-10 19:56:24,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:24,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322078328] [2020-02-10 19:56:24,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:24,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322078328] [2020-02-10 19:56:24,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:24,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:24,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050919169] [2020-02-10 19:56:24,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:24,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:24,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:24,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:24,626 INFO L87 Difference]: Start difference. First operand 373 states and 1275 transitions. Second operand 9 states. [2020-02-10 19:56:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:24,718 INFO L93 Difference]: Finished difference Result 618 states and 1808 transitions. [2020-02-10 19:56:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:24,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:24,719 INFO L225 Difference]: With dead ends: 618 [2020-02-10 19:56:24,720 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:56:24,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 19:56:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:56:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 381. [2020-02-10 19:56:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-02-10 19:56:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1295 transitions. [2020-02-10 19:56:24,729 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1295 transitions. Word has length 22 [2020-02-10 19:56:24,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:24,729 INFO L479 AbstractCegarLoop]: Abstraction has 381 states and 1295 transitions. [2020-02-10 19:56:24,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1295 transitions. [2020-02-10 19:56:24,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:24,730 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:24,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 19:56:24,730 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 19:56:24,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:24,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2095110726, now seen corresponding path program 1832 times [2020-02-10 19:56:24,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:24,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915821341] [2020-02-10 19:56:24,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:24,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915821341] [2020-02-10 19:56:24,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:24,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:24,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973701725] [2020-02-10 19:56:24,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:24,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:24,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:24,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:24,980 INFO L87 Difference]: Start difference. First operand 381 states and 1295 transitions. Second operand 9 states. [2020-02-10 19:56:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:25,088 INFO L93 Difference]: Finished difference Result 613 states and 1795 transitions. [2020-02-10 19:56:25,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:25,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:25,090 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:56:25,090 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:56:25,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 19:56:25,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:56:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 377. [2020-02-10 19:56:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:56:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1285 transitions. [2020-02-10 19:56:25,099 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1285 transitions. Word has length 22 [2020-02-10 19:56:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:25,100 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1285 transitions. [2020-02-10 19:56:25,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1285 transitions. [2020-02-10 19:56:25,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:25,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:25,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 19:56:25,100 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 19:56:25,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:25,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1942153612, now seen corresponding path program 1833 times [2020-02-10 19:56:25,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:25,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827420466] [2020-02-10 19:56:25,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:25,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 19:56:25,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827420466] [2020-02-10 19:56:25,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:25,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:25,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158281882] [2020-02-10 19:56:25,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:25,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:25,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:25,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:25,360 INFO L87 Difference]: Start difference. First operand 377 states and 1285 transitions. Second operand 9 states. [2020-02-10 19:56:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:25,445 INFO L93 Difference]: Finished difference Result 614 states and 1800 transitions. [2020-02-10 19:56:25,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:25,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:25,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:25,446 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:56:25,447 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:56:25,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 19:56:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:56:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 383. [2020-02-10 19:56:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-02-10 19:56:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1295 transitions. [2020-02-10 19:56:25,456 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1295 transitions. Word has length 22 [2020-02-10 19:56:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:25,456 INFO L479 AbstractCegarLoop]: Abstraction has 383 states and 1295 transitions. [2020-02-10 19:56:25,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1295 transitions. [2020-02-10 19:56:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:25,457 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:25,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 19:56:25,457 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 19:56:25,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash 351053584, now seen corresponding path program 1834 times [2020-02-10 19:56:25,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:25,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963401348] [2020-02-10 19:56:25,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:25,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 19:56:25,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963401348] [2020-02-10 19:56:25,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:25,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:25,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937593835] [2020-02-10 19:56:25,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:25,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:25,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:25,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:25,713 INFO L87 Difference]: Start difference. First operand 383 states and 1295 transitions. Second operand 9 states. [2020-02-10 19:56:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:25,829 INFO L93 Difference]: Finished difference Result 602 states and 1781 transitions. [2020-02-10 19:56:25,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:25,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:25,831 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:56:25,831 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:56:25,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 19:56:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:56:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 377. [2020-02-10 19:56:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:56:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1281 transitions. [2020-02-10 19:56:25,840 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1281 transitions. Word has length 22 [2020-02-10 19:56:25,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:25,840 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1281 transitions. [2020-02-10 19:56:25,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1281 transitions. [2020-02-10 19:56:25,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:25,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:25,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 19:56:25,841 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 19:56:25,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:25,841 INFO L82 PathProgramCache]: Analyzing trace with hash 726857198, now seen corresponding path program 1835 times [2020-02-10 19:56:25,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:25,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881435831] [2020-02-10 19:56:25,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:26,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 19:56:26,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881435831] [2020-02-10 19:56:26,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:26,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:26,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830742884] [2020-02-10 19:56:26,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:26,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:26,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:26,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:26,091 INFO L87 Difference]: Start difference. First operand 377 states and 1281 transitions. Second operand 9 states. [2020-02-10 19:56:26,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:26,198 INFO L93 Difference]: Finished difference Result 606 states and 1779 transitions. [2020-02-10 19:56:26,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:26,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:26,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:26,200 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:56:26,200 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 19:56:26,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 19:56:26,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 19:56:26,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 380. [2020-02-10 19:56:26,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-02-10 19:56:26,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1286 transitions. [2020-02-10 19:56:26,210 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1286 transitions. Word has length 22 [2020-02-10 19:56:26,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:26,210 INFO L479 AbstractCegarLoop]: Abstraction has 380 states and 1286 transitions. [2020-02-10 19:56:26,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1286 transitions. [2020-02-10 19:56:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:26,210 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:26,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 19:56:26,211 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 19:56:26,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1839062764, now seen corresponding path program 1836 times [2020-02-10 19:56:26,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:26,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734287947] [2020-02-10 19:56:26,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:26,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 19:56:26,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734287947] [2020-02-10 19:56:26,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:26,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:26,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898517767] [2020-02-10 19:56:26,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:26,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:26,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:26,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:26,455 INFO L87 Difference]: Start difference. First operand 380 states and 1286 transitions. Second operand 9 states. [2020-02-10 19:56:26,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:26,583 INFO L93 Difference]: Finished difference Result 599 states and 1772 transitions. [2020-02-10 19:56:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:26,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:26,585 INFO L225 Difference]: With dead ends: 599 [2020-02-10 19:56:26,585 INFO L226 Difference]: Without dead ends: 579 [2020-02-10 19:56:26,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:26,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-02-10 19:56:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 373. [2020-02-10 19:56:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:56:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-02-10 19:56:26,595 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-02-10 19:56:26,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:26,595 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-02-10 19:56:26,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-02-10 19:56:26,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:26,595 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:26,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 19:56:26,596 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 19:56:26,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:26,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2097297108, now seen corresponding path program 1837 times [2020-02-10 19:56:26,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:26,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286703807] [2020-02-10 19:56:26,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:26,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 19:56:26,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286703807] [2020-02-10 19:56:26,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:26,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:26,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989256664] [2020-02-10 19:56:26,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:26,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:26,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:26,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:26,850 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-02-10 19:56:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:26,926 INFO L93 Difference]: Finished difference Result 613 states and 1791 transitions. [2020-02-10 19:56:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:26,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:26,928 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:56:26,928 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 19:56:26,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 19:56:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 379. [2020-02-10 19:56:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-02-10 19:56:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1286 transitions. [2020-02-10 19:56:26,938 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1286 transitions. Word has length 22 [2020-02-10 19:56:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:26,938 INFO L479 AbstractCegarLoop]: Abstraction has 379 states and 1286 transitions. [2020-02-10 19:56:26,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1286 transitions. [2020-02-10 19:56:26,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:26,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:26,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 19:56:26,939 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 19:56:26,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:26,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1970660734, now seen corresponding path program 1838 times [2020-02-10 19:56:26,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:26,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657344662] [2020-02-10 19:56:26,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:27,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 19:56:27,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657344662] [2020-02-10 19:56:27,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:27,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:27,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067141253] [2020-02-10 19:56:27,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:27,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:27,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:27,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:27,182 INFO L87 Difference]: Start difference. First operand 379 states and 1286 transitions. Second operand 9 states. [2020-02-10 19:56:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:27,309 INFO L93 Difference]: Finished difference Result 607 states and 1777 transitions. [2020-02-10 19:56:27,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:27,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:27,311 INFO L225 Difference]: With dead ends: 607 [2020-02-10 19:56:27,311 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:56:27,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 19:56:27,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:56:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 376. [2020-02-10 19:56:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:56:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1279 transitions. [2020-02-10 19:56:27,321 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1279 transitions. Word has length 22 [2020-02-10 19:56:27,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:27,321 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1279 transitions. [2020-02-10 19:56:27,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1279 transitions. [2020-02-10 19:56:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:27,322 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:27,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 19:56:27,322 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 19:56:27,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1562067306, now seen corresponding path program 1839 times [2020-02-10 19:56:27,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:27,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108213432] [2020-02-10 19:56:27,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:27,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 19:56:27,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108213432] [2020-02-10 19:56:27,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:27,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:27,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720641589] [2020-02-10 19:56:27,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:27,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:27,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:27,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:27,578 INFO L87 Difference]: Start difference. First operand 376 states and 1279 transitions. Second operand 9 states. [2020-02-10 19:56:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:27,659 INFO L93 Difference]: Finished difference Result 611 states and 1789 transitions. [2020-02-10 19:56:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:27,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:27,661 INFO L225 Difference]: With dead ends: 611 [2020-02-10 19:56:27,661 INFO L226 Difference]: Without dead ends: 595 [2020-02-10 19:56: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 19:56:27,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-02-10 19:56:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 382. [2020-02-10 19:56:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:56:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1289 transitions. [2020-02-10 19:56:27,670 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1289 transitions. Word has length 22 [2020-02-10 19:56:27,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:27,670 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1289 transitions. [2020-02-10 19:56:27,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1289 transitions. [2020-02-10 19:56:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:27,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56: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 19:56:27,671 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 19:56:27,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:27,671 INFO L82 PathProgramCache]: Analyzing trace with hash -815636380, now seen corresponding path program 1840 times [2020-02-10 19:56:27,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:27,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147893893] [2020-02-10 19:56:27,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:27,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 19:56:27,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147893893] [2020-02-10 19:56:27,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:27,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:27,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967479276] [2020-02-10 19:56:27,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:27,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:27,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:27,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:27,933 INFO L87 Difference]: Start difference. First operand 382 states and 1289 transitions. Second operand 9 states. [2020-02-10 19:56:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:28,060 INFO L93 Difference]: Finished difference Result 599 states and 1770 transitions. [2020-02-10 19:56:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:28,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:28,062 INFO L225 Difference]: With dead ends: 599 [2020-02-10 19:56:28,062 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:56:28,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:28,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:56:28,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 376. [2020-02-10 19:56:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-02-10 19:56:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-02-10 19:56:28,072 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-02-10 19:56:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:28,072 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-02-10 19:56:28,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-02-10 19:56:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:28,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:28,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 19:56:28,073 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 19:56:28,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:28,073 INFO L82 PathProgramCache]: Analyzing trace with hash 713365604, now seen corresponding path program 1841 times [2020-02-10 19:56:28,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:28,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392470991] [2020-02-10 19:56:28,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:28,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 19:56:28,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392470991] [2020-02-10 19:56:28,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:28,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:28,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914718411] [2020-02-10 19:56:28,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:28,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:28,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:28,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:28,321 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-02-10 19:56:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:28,449 INFO L93 Difference]: Finished difference Result 601 states and 1764 transitions. [2020-02-10 19:56:28,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:28,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:28,450 INFO L225 Difference]: With dead ends: 601 [2020-02-10 19:56:28,451 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:56:28,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 19:56:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:56:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 378. [2020-02-10 19:56:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:56:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1279 transitions. [2020-02-10 19:56:28,460 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1279 transitions. Word has length 22 [2020-02-10 19:56:28,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:28,460 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1279 transitions. [2020-02-10 19:56:28,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1279 transitions. [2020-02-10 19:56:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:28,461 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:28,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 19:56:28,461 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 19:56:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1284820410, now seen corresponding path program 1842 times [2020-02-10 19:56:28,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:28,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971426250] [2020-02-10 19:56:28,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:28,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 19:56:28,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971426250] [2020-02-10 19:56:28,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:28,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:28,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075092021] [2020-02-10 19:56:28,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:28,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:28,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:28,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:28,714 INFO L87 Difference]: Start difference. First operand 378 states and 1279 transitions. Second operand 9 states. [2020-02-10 19:56:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:28,844 INFO L93 Difference]: Finished difference Result 595 states and 1760 transitions. [2020-02-10 19:56:28,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:28,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:28,845 INFO L225 Difference]: With dead ends: 595 [2020-02-10 19:56:28,845 INFO L226 Difference]: Without dead ends: 577 [2020-02-10 19:56:28,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:28,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-02-10 19:56:28,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 373. [2020-02-10 19:56:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-02-10 19:56:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1269 transitions. [2020-02-10 19:56:28,855 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1269 transitions. Word has length 22 [2020-02-10 19:56:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:28,855 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 1269 transitions. [2020-02-10 19:56:28,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1269 transitions. [2020-02-10 19:56:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:28,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:28,855 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:28,855 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 19:56:28,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:28,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1003379982, now seen corresponding path program 1843 times [2020-02-10 19:56:28,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:28,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226806850] [2020-02-10 19:56:28,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:29,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226806850] [2020-02-10 19:56:29,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:29,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:29,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235885349] [2020-02-10 19:56:29,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:29,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:29,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:29,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:29,114 INFO L87 Difference]: Start difference. First operand 373 states and 1269 transitions. Second operand 9 states. [2020-02-10 19:56:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:29,242 INFO L93 Difference]: Finished difference Result 593 states and 1748 transitions. [2020-02-10 19:56:29,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:29,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:29,244 INFO L225 Difference]: With dead ends: 593 [2020-02-10 19:56:29,244 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:56:29,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:56:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 377. [2020-02-10 19:56:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:56:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1279 transitions. [2020-02-10 19:56:29,253 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1279 transitions. Word has length 22 [2020-02-10 19:56:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:29,253 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1279 transitions. [2020-02-10 19:56:29,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1279 transitions. [2020-02-10 19:56:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:29,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:29,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 19:56:29,254 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 19:56:29,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:29,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1949654526, now seen corresponding path program 1844 times [2020-02-10 19:56:29,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:29,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724534221] [2020-02-10 19:56:29,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:29,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 19:56:29,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724534221] [2020-02-10 19:56:29,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:29,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:29,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196372640] [2020-02-10 19:56:29,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:29,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:29,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:29,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:29,509 INFO L87 Difference]: Start difference. First operand 377 states and 1279 transitions. Second operand 9 states. [2020-02-10 19:56:29,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:29,636 INFO L93 Difference]: Finished difference Result 592 states and 1744 transitions. [2020-02-10 19:56:29,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:29,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:29,638 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:56:29,638 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:56:29,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 19:56:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:56:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 375. [2020-02-10 19:56:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:56:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-02-10 19:56:29,648 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-02-10 19:56:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:29,648 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-02-10 19:56:29,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-02-10 19:56:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:29,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:29,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 19:56:29,649 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 19:56:29,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:29,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1538609784, now seen corresponding path program 1845 times [2020-02-10 19:56:29,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:29,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633245746] [2020-02-10 19:56:29,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:29,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 19:56:29,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633245746] [2020-02-10 19:56:29,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:29,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:29,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313660256] [2020-02-10 19:56:29,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:29,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:29,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:29,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:29,897 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-02-10 19:56:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:30,023 INFO L93 Difference]: Finished difference Result 594 states and 1750 transitions. [2020-02-10 19:56:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:30,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:30,024 INFO L225 Difference]: With dead ends: 594 [2020-02-10 19:56:30,024 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:56:30,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 19:56:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:56:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 378. [2020-02-10 19:56:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-02-10 19:56:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1279 transitions. [2020-02-10 19:56:30,034 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1279 transitions. Word has length 22 [2020-02-10 19:56:30,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:30,034 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1279 transitions. [2020-02-10 19:56:30,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1279 transitions. [2020-02-10 19:56:30,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:30,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:30,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 19:56:30,035 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 19:56:30,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:30,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1310220776, now seen corresponding path program 1846 times [2020-02-10 19:56:30,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:30,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481492369] [2020-02-10 19:56:30,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:30,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 19:56:30,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481492369] [2020-02-10 19:56:30,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:30,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:30,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828477086] [2020-02-10 19:56:30,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:30,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:30,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:30,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:30,280 INFO L87 Difference]: Start difference. First operand 378 states and 1279 transitions. Second operand 9 states. [2020-02-10 19:56:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:30,407 INFO L93 Difference]: Finished difference Result 587 states and 1743 transitions. [2020-02-10 19:56:30,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:30,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:30,409 INFO L225 Difference]: With dead ends: 587 [2020-02-10 19:56:30,409 INFO L226 Difference]: Without dead ends: 571 [2020-02-10 19:56:30,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 19:56:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-02-10 19:56:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 375. [2020-02-10 19:56:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-02-10 19:56:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1272 transitions. [2020-02-10 19:56:30,419 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1272 transitions. Word has length 22 [2020-02-10 19:56:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:30,419 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 1272 transitions. [2020-02-10 19:56:30,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1272 transitions. [2020-02-10 19:56:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:30,420 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:30,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 19:56:30,420 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 19:56:30,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:30,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1807457192, now seen corresponding path program 1847 times [2020-02-10 19:56:30,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:30,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399847745] [2020-02-10 19:56:30,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:30,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 19:56:30,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399847745] [2020-02-10 19:56:30,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:30,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:30,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053066741] [2020-02-10 19:56:30,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:30,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:30,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:30,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:30,670 INFO L87 Difference]: Start difference. First operand 375 states and 1272 transitions. Second operand 9 states. [2020-02-10 19:56:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:30,804 INFO L93 Difference]: Finished difference Result 592 states and 1743 transitions. [2020-02-10 19:56:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:30,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:30,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:30,805 INFO L225 Difference]: With dead ends: 592 [2020-02-10 19:56:30,805 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:56:30,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:56:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 377. [2020-02-10 19:56:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-02-10 19:56:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1275 transitions. [2020-02-10 19:56:30,815 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1275 transitions. Word has length 22 [2020-02-10 19:56:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:30,815 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1275 transitions. [2020-02-10 19:56:30,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1275 transitions. [2020-02-10 19:56:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:30,816 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:30,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 19:56:30,816 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 19:56:30,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:30,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1916055298, now seen corresponding path program 1848 times [2020-02-10 19:56:30,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:30,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325342862] [2020-02-10 19:56:30,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:31,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 19:56:31,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325342862] [2020-02-10 19:56:31,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:31,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:31,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374748901] [2020-02-10 19:56:31,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:31,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:31,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:31,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:31,066 INFO L87 Difference]: Start difference. First operand 377 states and 1275 transitions. Second operand 9 states. [2020-02-10 19:56:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:31,195 INFO L93 Difference]: Finished difference Result 586 states and 1739 transitions. [2020-02-10 19:56:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:31,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:31,196 INFO L225 Difference]: With dead ends: 586 [2020-02-10 19:56:31,196 INFO L226 Difference]: Without dead ends: 566 [2020-02-10 19:56:31,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 19:56:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-02-10 19:56:31,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 370. [2020-02-10 19:56:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-02-10 19:56:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1262 transitions. [2020-02-10 19:56:31,206 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1262 transitions. Word has length 22 [2020-02-10 19:56:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:31,207 INFO L479 AbstractCegarLoop]: Abstraction has 370 states and 1262 transitions. [2020-02-10 19:56:31,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1262 transitions. [2020-02-10 19:56:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:31,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:31,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 19:56:31,207 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 19:56:31,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:31,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1989957178, now seen corresponding path program 1849 times [2020-02-10 19:56:31,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:31,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785594580] [2020-02-10 19:56:31,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:31,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 19:56:31,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785594580] [2020-02-10 19:56:31,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:31,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:31,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021167372] [2020-02-10 19:56:31,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:31,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:31,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:31,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:31,481 INFO L87 Difference]: Start difference. First operand 370 states and 1262 transitions. Second operand 9 states. [2020-02-10 19:56:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:31,571 INFO L93 Difference]: Finished difference Result 627 states and 1839 transitions. [2020-02-10 19:56:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-02-10 19:56:31,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-02-10 19:56:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:31,573 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:56:31,573 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 19:56:31,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 19:56:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 19:56:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 382. [2020-02-10 19:56:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-02-10 19:56:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1300 transitions. [2020-02-10 19:56:31,583 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1300 transitions. Word has length 22 [2020-02-10 19:56:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:31,583 INFO L479 AbstractCegarLoop]: Abstraction has 382 states and 1300 transitions. [2020-02-10 19:56:31,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-02-10 19:56:31,583 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1300 transitions. [2020-02-10 19:56:31,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-02-10 19:56:31,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:31,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 19:56:31,584 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 19:56:31,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:31,584 INFO L82 PathProgramCache]: Analyzing trace with hash -399691292, now seen corresponding path program 1850 times [2020-02-10 19:56:31,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:31,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427972996] [2020-02-10 19:56:31,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:31,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 19:56:31,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427972996] [2020-02-10 19:56:31,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:31,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-02-10 19:56:31,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162816759] [2020-02-10 19:56:31,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-02-10 19:56:31,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:31,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-02-10 19:56:31,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:56:31,856 INFO L87 Difference]: Start difference. First operand 382 states and 1300 transitions. Second operand 9 states. Received shutdown request... [2020-02-10 19:56:31,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:56:31,880 WARN L544 AbstractCegarLoop]: Verification canceled [2020-02-10 19:56:31,886 WARN L227 ceAbstractionStarter]: Timeout [2020-02-10 19:56:31,886 INFO L202 PluginConnector]: Adding new model example_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 07:56:31 BasicIcfg [2020-02-10 19:56:31,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 19:56:31,887 INFO L168 Benchmark]: Toolchain (without parser) took 768268.25 ms. Allocated memory was 138.9 MB in the beginning and 1.0 GB in the end (delta: 868.2 MB). Free memory was 119.6 MB in the beginning and 695.2 MB in the end (delta: -575.6 MB). Peak memory consumption was 292.6 MB. Max. memory is 7.1 GB. [2020-02-10 19:56:31,888 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 19:56:31,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.11 ms. Allocated memory is still 138.9 MB. Free memory was 119.4 MB in the beginning and 117.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-02-10 19:56:31,888 INFO L168 Benchmark]: Boogie Preprocessor took 19.80 ms. Allocated memory is still 138.9 MB. Free memory was 117.7 MB in the beginning and 116.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-02-10 19:56:31,888 INFO L168 Benchmark]: RCFGBuilder took 358.72 ms. Allocated memory is still 138.9 MB. Free memory was 116.5 MB in the beginning and 103.6 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2020-02-10 19:56:31,889 INFO L168 Benchmark]: TraceAbstraction took 767846.45 ms. Allocated memory was 138.9 MB in the beginning and 1.0 GB in the end (delta: 868.2 MB). Free memory was 103.2 MB in the beginning and 695.2 MB in the end (delta: -592.0 MB). Peak memory consumption was 276.2 MB. Max. memory is 7.1 GB. [2020-02-10 19:56:31,890 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.22 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 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 34.11 ms. Allocated memory is still 138.9 MB. Free memory was 119.4 MB in the beginning and 117.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.80 ms. Allocated memory is still 138.9 MB. Free memory was 117.7 MB in the beginning and 116.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 358.72 ms. Allocated memory is still 138.9 MB. Free memory was 116.5 MB in the beginning and 103.6 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 767846.45 ms. Allocated memory was 138.9 MB in the beginning and 1.0 GB in the end (delta: 868.2 MB). Free memory was 103.2 MB in the beginning and 695.2 MB in the end (delta: -592.0 MB). Peak memory consumption was 276.2 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 constructing difference of abstraction (382states) and FLOYD_HOARE automaton (currently 3 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (35 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 767.6s, OverallIterations: 1856, TraceHistogramMax: 1, AutomataDifference: 208.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.8s, HoareTripleCheckerStatistics: 123989 SDtfs, 188151 SDslu, 300170 SDs, 0 SdLazy, 96743 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 89.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16667 GetRequests, 1862 SyntacticMatches, 0 SemanticMatches, 14805 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9250 ImplicationChecksByTransitivity, 594.8s 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.6s AutomataMinimizationTime, 1855 MinimizatonAttempts, 364899 StatesRemovedByMinimization, 1849 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 526.8s InterpolantComputationTime, 40832 NumberOfCodeBlocks, 40832 NumberOfCodeBlocksAsserted, 1856 NumberOfCheckSat, 38976 ConstructedInterpolants, 0 QuantifiedInterpolants, 18833640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1856 InterpolantComputations, 1856 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